Search

• This paper proposes a new feature selection method called SLMEA. • The sparse transformation and pseudo label matrix are combined to optimize. • The pseudo label matrix is used to guide the learning of low-dimensional space. • The similarity matrix is constructed adaptively. • The constraint of ℓ 2 , 1 / 2 -norm is applied to the matrix. • The SLMEA can have higher clustering accuracy and normalized mutual information. Traditional feature selection algorithms usually explore the relationship between data and cluster structure in a single space, so the internal relationship obtained is not very rich, and it is not enough to select more valuable features. To solve the above problems, in order to fully mine the intrinsic correlation information in different spaces, so that the relationship between data, features and clustering structure can be explored at the same time, this paper proposes a feature selection method based on sparse and low-dimensional representation with maximum entropy adaptive graph (SLMEA). Firstly, the SLMEA combines the sparse transform representation with pseudo-label matrix learning to optimize, and uses the pseudo-label matrix to guide the learning of sparse low-dimensional space. It can not only explore the relationship between data and pseudo-labels in data space, but also mine the association between features and pseudo-labels in feature space, so as to select more discriminative features. Secondly, based on the maximum entropy theory, the similarity matrix is constructed adaptively, so that the two different manifold structures corresponding to sparse transform representation and pseudo label matrix learning can be adaptively learned and retained in the iterative process. In addition, in order to ensure the sparsity of the transformation matrix, the constraint of ℓ 2 , 1 / 2 -norm is applied to the matrix, which can better deal with the redundant features and obtain more sparse solutions. Finally, the SLMEA uses an alternate iterative update method to optimize the objective function, and carries out extensive experiments on eight mainstream datasets. Compared with seven state-of-the-art algorithms, SLMEA can have higher clustering accuracy and normalized mutual information. [ABSTRACT FROM AUTHOR]

Modern and new integrated technologies have changed the traditional systems by using more advanced machine learning, artificial intelligence methods, new generation standards, and smart and intelligent devices. The new integrated networks like the Internet of Things (IoT) and 5G standards offer various benefits and services. However, these networks have suffered from multiple object detection, localization, and classification issues. Conventional Neural Networks (CNN) and their variants have been adopted for object detection, classification, and localization in IoT networks to create autonomous devices to make decisions and perform tasks without human intervention and helpful to learn in-depth features. Motivated by these facts, this paper investigates existing object detection and recognition techniques by using CNN models used in IoT networks. This paper presents a Conventional Neural Networks for 5G-Enabled Internet of Things Network (CNN-5GIoT) model for moving and static objects in IoT networks after a detailed comparison. The proposed model is evaluated with existing models to check the accuracy of real-time tracking. The proposed model is more efficient for real-time object detection and recognition than conventional methods. [ABSTRACT FROM AUTHOR]

• Heterogeneous networks with both heterogeneous coefficients and heterogeneous nonlinear functions are investigated. • A generalized impulsive controller is designed. • Parameter uncertainties of both linear and nonlinear dynamics are considered. • The sufficient criteria of quasi-synchronization are derived for the heterogeneous networks. The target of this paper is studying the problem of quasi-synchronization of heterogeneous Lur'e networks with uncertain parameters and impulsive effect. Considering the heterogeneity of Lur'e networks, quasi-synchronization instead of synchronization is discussed. Noting that the uncertain factors exist extensively in reality, uncertain parameters are introduced to the system in this paper. By using the Schur complement lemma, stability theory and the principle of comparison, the sufficient criteria for the heterogeneous networks to achieve quasi-synchronization are derived, and the upper bound of exponential quasi-synchronization errors is calculated. In addition, two corollaries are presented in consideration of homogeneous systems and weighted undirected graphs. Finally, three numerical simulations are given to illustrate the effectiveness of the control protocol and theoretical results. [ABSTRACT FROM AUTHOR]

• This paper proposes a disentangled module to decouple the unary term and pairwise term in the one-shot video object segmentation approaches. • The pairwise term is used to capture spatio-temporal information. Meanwhile, the salient target in each frame is enhanced in the unary term. • The pairwise term tends to seek the relationship between the target pixel and its reference pixel. The unary term seeks the salience of different pixels in each frame. This paper proposes a novel self-supervised method for one-shot video object segmentation where the object annotations are only provided in the first frame. The current self-supervised video object segmentation approaches are implemented by modeling the pairwise correspondence between the target and reference frames. The pairwise correspondence only maintains spatio-temporal consistency. However, the VOS tasks not only require a spatio-temporal relationship between the two frames but also require the salient object information for each frame. In order to achieve this goal, we propose a disentangled representation strategy to disentangle the temporal correspondence into the pairwise term and unary term. The pairwise and unary terms capture inter-frame spatio-temporal and intra-frame salient object information, respectively. To demonstrate the importance of the disentangled representation, we apply the proposed approach to DAVIS-2017 and YouTube-VOS datasets. Experimental results confirm the effectiveness of the proposed solution. [ABSTRACT FROM AUTHOR]

Studies, with the increasing concern for mental health, have shown that interventions along with social support can reduce stress and depression. However, counselling centers do not have enough resources to provide counselling and social support to all the participants in their interest. This paper helps social support organizations (e.g., university counselling centers) sequentially select the participants for interventions. Meanwhile, Deep Reinforcement Learning (DRL) has shown significant success in learning an efficient policy for sequential decision-making problems in both fully observable environments and partially observable environments with small action space. In this paper, we consider emotion propagation from other neighbours of the influencees, initial uncertainties of mental states and influence in the student network. We propose a new architecture called DRLPSO (Deep Reinforcement Learning with Particle Swarm Optimization) to enhance learning performance in a partially observable environment with a large state and action space. DRLPSO consists of two stages: the Discrete Particle Swarm Optimization (DPSO) and Deep Q-learning integrated with Long Short-Term Memory (DQ-LSTM). In the first stage, we apply DPSO by initializing n particles that converge to multiple optimal actions for each belief state. In the second stage, the action with the best Q-value from the DPSO action set is executed to obtain belief and observation (history of action). We evaluated the proposed method empirically with the simulated student networks with mental state propagation compared to the state-of-the-art algorithms. The experimental results demonstrate that DRLPSO outperforms the state-of-the-art DRL methods by an average of 32%. [ABSTRACT FROM AUTHOR]

Structure from motion (SFM), a research hotspot in the intelligent transportation field (including autonomous driving, environmental perception and augmented reality (AR) for artificial intelligence terminals), can automatically recover ego-motion state estimations and 3D scene reconstructions from multiple images or video sequences. Most existing vision methods operate offline in indoor scenes, and their reconstruction accuracies greatly depend on the tracking lifetimes and accuracies of feature points. Reprojection matrix and redundant regression noise computations are exponential disasters for the calculation and reconstruction drift of large-scale scenes. This paper proposes a quadruple tripatch-wise modular architecture (QTMA) for autonomous vehicle stereo image sequences that decomposes rigid scenes into nonrigid motion-segmented pieces for reconstruction. An advanced energy function for salient image features is established by combining multiple feature types with weighted finite-element mesh. Closed quadruple annular matching and relocation are performed via multiresolution pyramid images. The proposed incremental integral-mapping calculation method and unique tree-like stacked storage containers prolong the tracking lifetimes of consecutive frames and ensure the spatiotemporal consistency and robustness of the homonymous image features in different subsequences. Experimental results verify the effectiveness of this architecture for different transportation scenes; the frame rate processing speed reaches 30 fps, the calculation accuracy regarding the path distance difference reaches 99.49%, and the estimation results regarding the maximum speeds of motion are closer to the ground truth. The translation error of the motion pose is 0.0136%, and the rotation error is 0.0035 [deg/m], which has more yaw stability than the existing state-of-the-art methods. Furthermore, in the reconstructed point cloud quality demonstration, the mean value of roughness is reduced by 40.127%, the mean value of density is improved by 27.701%, and the accuracy reaches 91.149% within a certain distance tolerance. This paper has significant theoretical research value and application potential for positioning, path tracking, and navigation in adaptive cruise control (ACC) and advanced driver assistance systems (ADAS). [ABSTRACT FROM AUTHOR]

The present paper aims to propose a new type of information-theoretic method to augment the ratio of collective potentiality to its cost for the interpretation. Collective potentiality represents how many components, such as connection weights or neurons, are collectively used to deal with relations between inputs and outputs, while individual potentiality shows how an individual component potentially contributes to the inputs or outputs. From our viewpoint, the conventional interpretation methods have focused on the individual potentiality of components, ignoring these collective behaviors. Thus, the present paper stresses that neural networks should try to deal with the collective properties of components and to examine the final results from multiple points of view. For implementing this concept of potentiality maximization, we introduce the complementary potentiality minimization, which aims to reduce the strength of larger weights as much as possible, and at the same time, it can be used for increasing the potentiality. The method was applied to two intuitively interpretable data sets, namely, the absenteeism and online shoppers data sets. With both data sets, experimental results confirmed that the method could increase collective potentiality and considerably reduce the corresponding cost. The new method could extract many groups of weights with the same small strength, all of which tried to respond to the coming inputs, while the conventional methods, including the regularization ones, tried to produce a smaller number of stronger connection weights very selectively. In particular, the present method could produce stable compressed weights similar to the original correlation coefficients of the data sets, meaning that simple, independent, and linear relations could be detected, contrary to the presupposed non-linear ones. Thus, the collective interpretation, applied to two business data sets, revealed a possibility that, behind seemingly complicated non-linear relations between inputs and outputs, neural networks with collective potentiality augmentation with a smaller cost can extract the very simple relations for easy interpretation. All complicated relations can possibly be generated, based on those simple ones. [ABSTRACT FROM AUTHOR]

In this work, we examine the advantages of using multiple types of behaviours in recommendation systems. Intuitively, each user often takes some implicit actions (e.g., click) before making an explicit decision (e.g., purchase). Previous studies show that implicit and explicit feedback has different roles for a useful recommendation. However, these studies either exploit implicit and explicit behaviours separately or ignore the semantics of sequential interactions between users and items. In addition, we go from the hypothesis that a user's preferences at a time are combinations of long-term and short-term interests. In this paper, we propose some Deep Learning architectures. The first one is Implicit to Explicit (ITE) , to exploit users' interests through the sequence of their actions. The second and third ones are two versions of ITE with Bidirectional Encoder Representations from Transformers based (BERT-based) architecture called BERT-ITE and BERT-ITE-Si , which combine users' long- and short-term preferences without and with side information to enhance users' representations. The experimental results show that our models outperform previous state-of-the-art ones and also demonstrate our views on the effectiveness of exploiting the implicit to explicit order as well as combining long- and short-term preferences in three large-scale datasets. The source code of our paper is available at: https://github.com/tranquyenbk173/BERT_ITE. [ABSTRACT FROM AUTHOR]

In this paper, we consider the finite-time anti-synchronization for the master–slave neural networks with time delays. By means of combining integral inequality skills with other inequality skills, two novel criteria to assure the finite-time anti-synchronization for the discussed master–slave neural networks are presented under two classes of different controllers. Our results and method are different from those in existing papers. [ABSTRACT FROM AUTHOR]

Most existing Deep Reinforcement Learning (DRL) algorithms solely apply to discrete action or continuous action spaces. However, the agent often has both continuous and discrete action space, named hybrid action space. This paper proposes an action-decoupled algorithm for hybrid action space. Specifically, the hybrid action is decoupled, and then the original agent in the hybrid action space is abstracted into two agents. Each agent contains only discrete or continuous action space. The discrete and continuous actions are independent of each other to be executed simultaneously. We use the Soft Actor-Critic (SAC) algorithm as the optimization method and name our proposed algorithm Action Decoupled SAC (AD-SAC). We handle multi-agent problems using a framework of Centralized Training Decentralized Execution (CTDE) and then reduce the concatenation of partial agent observations to avoid the interference of redundant observations. We design a hybrid action space environment for Unmanned Aerial Vehicles (UAVs) path planning and gimbal scanning using AirSim. The results show that our algorithm has better convergence and robustness than the discretization, relaxation, and the Parametrized Deep Q-Networks Learning (P-DQN) algorithms. Finally, we carried out a Hardware in the Loop (HITL) simulation experiment based on Pixhawk to verify the feasibility of our algorithm. [ABSTRACT FROM AUTHOR]

Multi-scale feature fusion is a commonly-used module in existing deep-learning models, and feature misalignment occurs in the process of feature fusion. The spatial misalignment hinders the learning of semantic representation with multi-scale levels, but which has not received much attention. This misalignment problem is caused by the feature position shift after using the convolution and interpolation operation in feature fusion. To solve the misalignment problem, this paper formulates the shift error mathematically and proposes a plug-and-play unbiased feature position alignment strategy to align convolution with interpolation. As a model-agnostic approach, unbiased feature position alignment can boost the performance of different models without introducing extra parameters. Furthermore, the unbiased feature position alignment is applied to build an unbiased human pose estimation method. Experimental results have demonstrated the effectiveness of the proposed unbiased pose model in comparison to the state-of-the-arts, especially in the low-resolution field. The codes are shared at https://github.com/WangChen100/Unbiased-Feature-Position-Alignment-for-Human-Pose-Estimation. [ABSTRACT FROM AUTHOR]

Deep neural networks (DNNs) have been shown to be vulnerable to backdoor attacks during training. Most of the existing backdoor defense methods are designed for specific types of backdoor attacks, and the work of detecting backdoors and mitigating backdoors is mostly separate. Currently, few general and complete defense frameworks have been developed. In this paper, we propose a lightweight, general, and complete defense framework against three main types of backdoor attacks. It can efficiently detect poisoned images and remove trigger patterns on poisoned images without costly retraining of the backdoor model. First, we use the feature difference between clean samples and poisoned samples in the middle layer of the model to distinguish them. Then, we remove the backdoor using image inpainting algorithm to remove the backdoor triggering pattern on the poisoned samples. We deploy three of the most popular backdoor attacks on three datasets to test the effectiveness of our defenses. Extensive experimental results show that our method can effectively defend against various backdoor attacks with a relatively small cost. In particular, we reduce the attack success rate of the more stealthy clean-label poisoning attack from 94.9% to 0.02% with little impact on the classification accuracy of the inpainted images. [ABSTRACT FROM AUTHOR]

Tagging can be regarded as the action of connecting relevant user-defined keywords to an item, indirectly improving the quality of the information retrieval services that rely on tags as data sources. Tag recommendation dramatically enhances the quality of tags by assisting users in tagging. Although there exist many studies on tag recommendation for textual content, few of them consider two characteristics in real applications, i.e., the long-tail distribution of tags and the topic-tag correlation. In this paper, we propose a Topic-Guided Tag Recommendation (TGTR) model to recommend tags by jointly incorporating dynamic neural topic. Specifically, TGTR first generates dynamic neural topic that would indicate the tags by a neural topic generator. Then, a sequence encoder is used to distill indicative features from the post. To effectively leverage the topic and alleviate the data imbalance, we design a multi-tag topical attention mechanism to get a tag-specific post representation for each tag with the help of dynamic neural topic. These three modules are seamlessly joined together via an end-to-end multi-task learning model, which is helpful for the three parts to enhance each other and balance the effects of topics and tags. Extensive experiments have been conducted on four real-world datasets and demonstrate that our model outperforms the state-of-the-art approaches by a large margin, especially on tail-tags. The code, data and hyper-parameter settings are publicly released for reproducibility. [ABSTRACT FROM AUTHOR]

Warped Gradient descent (WarpGrad) is a remarkable meta-learning method for gradient transformation by inserting warp-layers. However, the task-shared initialization provided by WarpGrad is difficult to be adaptive to each task. Moreover, transforming gradients with meta-learned warp-layers ignores the local geometric features or task-specific knowledge, and may lead to a significant risk of overfitting caused by the increase of parameters. In this paper, we propose ARWarpGrad to guarantee better generalization performance with faster convergence speed by modeling both the cross-task and task-specific knowledge. We introduce Initialization Modulation (IM) to meta-learn to initialize the task-learner specifically. Furthermore, the Mixed Gradient Preprocessing (MGP), which includes the Adaptive Learning Rates (ALR) and the Gaussian Momentum Dropout (GMD), is put forward to provide better adaptive optimization direction and length for task adaptation based on the feature of local geometries. In addition, Memory Regularization (MR) is provided to alleviate the overfitting problem effectively with the use of parameter memory. Ultimately, extensive experiments on three settings demonstrate that ARWarpGrad achieves state-of-the-art performance with convergence acceleration and overfitting prevention characteristics. [ABSTRACT FROM AUTHOR]

Although Deep Neural Networks (DNNs)-based object detectors are widely used in various fields, especially on aerial imagery object detections, it has been observed that a small elaborately designed patch attached to the images can mislead the DNNs-based detectors into producing erroneous output. However, the target detectors being attacked are quite simple, and the attack efficiency is relatively low in previous works, making it not practicable in real scenarios. To address these limitations, a new adversarial patch attack algorithm is proposed in this paper. Firstly, we designed a novel loss function using the intermediate outputs of the models rather than the model's final outputs interpreted by the detection head to optimize adversarial patches. The experiments conducted on the DOTA, RSOD, and NWPU VHR-10 datasets demonstrate that our method can significantly degrade the performance of the detectors. Secondly, we conducted intensive experiments to investigate the impact of different outputs of the detection model on generating adversarial patches, demonstrating the class score is not as effective as the objectness score. Thirdly, we comprehensively analyzed the attack transferability across different aerial imagery datasets, verifying that the patches generated on one dataset are also effective in attacking another. Moreover, we proposed ensemble training to boost the attack's transferability across models. Our work alarms the application of DNNs-based object detectors in aerial imagery. [ABSTRACT FROM AUTHOR]

Few-shot knowledge graph completion (FSKGC) refers to predicting new facts for a new relation with only few-shot observed entity pairs (triples) as support set. Existing solutions to FSKGC mainly conduct the matching process over entity pair representations. Although effective, a major concern of these models is that the entity interactions are not fully explored, based on the observation that they usually generate the pair representation before the matching stage. Such a design inherently overlooks the fine-grained information from entity interactions, leading to performance decrements in one or three shot, which require matching models to capture more sufficient semantic meanings for prediction. To remedy this issue, in this paper, we explore the entity interactions within and between different instances, i.e. , the co-occurrence of two entities, for FSKGC and propose our model named TransAM, Trans former A ppending M atcher. TransAM solves the FSKGC problem by computing the probability of entity sequence with a well-designed transformer matching network. Specifically, TransAM appends query entity pair to serialized reference entity sequence and utilizes transformer to calculate the probability by capturing intra- and inter- triple entity interactions. To bridge the gap between transformer and the triple structure, TransAM introduces rotary operation to preserve the head and tail roles of entity within the triple and distinguishes different triples by a separated triple position encoding. Empirical studies on two public benchmark datasets NELL-One and Wiki-One show that TransAM outperforms existing metric-learning solutions in MRR and Hits@1 with both one- and three- shot settings, and achieves comparable results on five-shot setting. Datasets and code will be public available at https://github.com/gawainx/TransAM. [ABSTRACT FROM AUTHOR]

Recently, a massive number of deep learning-based approaches have been successfully applied to various remote sensing image (RSI) recognition tasks. However, most existing advances of deep learning methods in the RSI field heavily rely on the features extracted by the manually designed backbone network, which severely hinders the potential of deep learning models due to the complexity of RSI and the limitation of prior knowledge. In this paper, we research a new design paradigm for the backbone architecture in RSI recognition tasks, including scene classification, land-cover classification and object detection. A novel one-shot architecture search framework based on a weight-sharing strategy and an evolutionary algorithm is proposed, called RSBNet, which consists of three stages: Firstly, a supernet constructed in a layer-wise search space is pretrained on a self-assembled large-scale RSI dataset based on an ensemble single-path training strategy. Next, the pre-trained supernet is equipped with different recognition heads through the switchable recognition module and respectively fine-tuned on the target dataset to obtain task-specific supernet. Finally, we search for the optimal backbone architecture for different recognition tasks based on the evolutionary algorithm without any network training. Extensive experiments have been conducted on five benchmark datasets for different recognition tasks, the results show the effectiveness of the proposed search paradigm and demonstrate that the searched backbone is able to flexibly adapt different RSI recognition tasks and achieve impressive performance. [ABSTRACT FROM AUTHOR]

In daily life, some conventional image processing operations, e.g., histogram equalization, and filtering, are widely used to improve the visual quality of digital images. This paper designs an image processing network based on CapsNets (capsule networks), in which additional data can be carried in the processed image. Given an image to be processed, the proposed network is able to achieve some conventional image processing operations with satisfactory results. Meanwhile, additional data can be embedded into the processed image during the process of training, and the existence of additional data cannot be discovered. In this way, additional data can be transmitted secretly via the processed image, which looks normal. Compared with existing data hiding algorithms that embed data by modifying image content, the proposal to embed data during the process of training is more secure. Experimental results verify the effectiveness of the proposed network, including the quality of the processed image, embedding capacity, and security. [ABSTRACT FROM AUTHOR]

This paper presents an effective weakly supervised learning algorithm LLP-AAE to leverage the adversarial autoencoder (AAE) for learning from label proportions (LLP), in which only the bag-level proportional information is available. Our LLP-AAE utilizes an autoencoder backbone and performs adversarial training in latent space to match the aggregated posterior distribution of hidden coding with the prior distributions. In this way, apart from the reconstruction task, the encoder is also dedicated to producing fake samples, in order to deceive discriminators as far as possible. Ultimately, the encoder is employed as a competent label predictor for unseen data. In addition to the LLP classifier, our model can also achieve controllable samples generation by feeding the decoder with gradually changing latent code, which is proven to be useful for a better LLP performance. We also provide a panoramic explanation for LLP-AAE by regarding the LLP problem as an alternative learning procedure between proportion-based pseudo label generation and discriminative reconstruction. Experiments on six benchmark image datasets demonstrate the advantage of our method both in style manipulation with the latent feature representation and comparable multi-class LLP performance with the state-of-the-art models. [ABSTRACT FROM AUTHOR]

In this paper, we propose a distributed finite-time optimization protocol for single-integrator continuous-time multi-agent systems, which utilizes a modified Newton–Raphson method. The inverse of Hessian matrix, sign function and the gradient are adopted for the design of the algorithms. The proposed algorithms make agents converge to the network optimizer under any initial state and finite time, respectively. Lyapunov method and the properties of sign function are employed to verify the convergence of the proposed algorithms. Besides, the adaptive method is also considered to avoid complex parameter conditions and centralized parameters. Finally, numerical simulations are provided to testify the presented results. [ABSTRACT FROM AUTHOR]

• We propose Expert-guided COntrastive learning (ECO) to learn cross-modal alignment. • Through ablation studies, we validate the effectiveness of each proposed component. • Ours shows improvement with the expert-based framework and compatability with CLIP. Transformers with collaborative experts have become a powerful framework for video-text retrieval. In specific, experts understand the specialized property of each domain (e.g. , appearance, motion, and audio) from videos and the video encoder aggregates those expertise features. However, previous works implicitly guide the video transformer by solving auxiliary video-text tasks with expertise features, since concatenation for the video transformer is the only effort to exploit the knowledge of experts. In this paper, we propose an expert-guided contrastive loss in order to fully exploit expert knowledge from videos. In detail, we sample a positive bag using an expert-wise similarity matrix to learn text encoder and decompose text representation into dynamic and static factors from given videos. Through extensive experiments, we verify the effectiveness of the proposed methods. Notably, we also demonstrate that our method brings significant improvements under the expert-based framework and it can collaborate with CLIP-based architectures for further performance boosts. [ABSTRACT FROM AUTHOR]

Mammography is an important screening criterion for breast cancer, one of the major diseases causing numerous deaths among female patients. Meanwhile, manual diagnosis of mammography is a time-consuming and labor-consuming job. Mammogram classification based on deep learning plays a vital role in computer-aided diagnosis (CAD) systems to mitigate the pressure on physicians. This paper proposes a learning-based multi-view mammogram classification model that captures long-distance dependence and extracts features of multiple receptive fields. Our model considers global and local features of mammography images using Transformer for global features and the proposed multiplex convolutions module for local features. We evaluate our proposed method on a dataset of mammography images obtained from a hospital in China. The proposed method achieves 90.57% accuracy and 94.86% AUC in benign or malignant classification tasks and outperforms other advanced methods for mammogram classification. It is worth noting that the proposed method only requires image-level labels and acts on the whole raw mammogram, which has clinical significance. [ABSTRACT FROM AUTHOR]

This paper presents an effective method for strengthening the discriminative ability of high-level deep features by enhancing and aggregating discriminative part-level features for the fine-grained vehicle recognition task. In general, the task of visual recognition concentrates more on the visual differences at the object level. However, for fine-grained object recognition, the visual differences between target objects typically exist in local discriminative areas, so it is more concerned about extracting fine-grained features from these part regions. In this context, we propose solving this issue with a novel feature extraction method from two perspectives: the generation of more feature descriptors of part regions through the learning process of deep networks and the aggregation of part-level discriminative features. This approach is designed to improve the backbone networks to generate finer-level part features through a part-level feature enhancement module and to investigate the intrinsic part-level features of the backbone networks with the help of a feature aggregation module. The enhancement module efficiently finds the finer features highly correlated to the part regions. Then the feature aggregation module builds correlations of similar part features through feature grouping and fusion. Moreover, our proposed method does not require additional parts annotations and achieves comparable performance on two widely-used benchmarks for recognizing fine-grained vehicle types. Experimental results and explainable visualizations demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Most recent U-Net based models have shown promising results for the challenging tasks in image inpainting field. However, they often generate content with blurred textures and distorted structures due to the lack of semantic consistency and texture continuity in the missing regions. In this paper, we propose to restore the missing areas at both structural and textural levels. Our method is built upon a U-Net structure, which repairs images by extracting semantic information from high to low resolution and then decoding it back to the original image. Specifically, we utilize the high-level semantic features learned in encoder to guide the inpainting of structure-aware features of its adjacent low-level feature map. Meanwhile, low-level feature maps have clearer texture compared with high-level ones, which can be used as a prior for textural repair of high-level feature maps. subsequently, a module is used to fuse the two repaired feature maps (i.e., structure-aware and texture-aware features) reasonably and obtain a feature map with reasonable semantics. Moreover, in order to learn more representative high-level semantics feature, we design the model as a siamese network for contrastive learning. Experiments on practical data show that our method outperforms other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Video person re-identification(re-ID) plays an important role in intelligent video surveillance, which can automatically match the same person across video clips under non-overlapping cameras. Despite great progress in re-ID, the performance of most existing methods still is corrupted severely under partial occlusion. Although some multi-granularity methods have alleviated this dilemma, these methods still suffer from weak diversity of features and conflict between rigid horizontal partition and vertical occlusion. In this paper, we propose a novel video person re-ID framework, called Multi-Granularity Occlusion Aware (MGOA), which extracts multi-granularity features by precisely erasing the occlusion. Different from previous works based on multiple granularities, the proposed MGOA predicts the partial occlusion in a coarse-to-fine manner instead of erasing the occlusion in video clips by one step. Specifically, we first propose the multi-granularity feature extraction to obtain diverse features at different levels of feature maps, which is beneficial for the fine erasure of the occlusion. Moreover, to avoid the limitation of horizontal stripes that cannot handle vertical occlusion, we design Attention-Aware Occlusion Erasure (AA-OE) that can obtain the attention maps with coarse occlusion erasure in the coarse-grained branch and the attention maps with fine occlusion erasure in the fine-grained branch. It is worth noting that each granularity in our network is not independent but relevant through the top-down information transmission between granularities, which transfers the erased occlusion feature maps of the current branch to the next finer-grained branch for guiding AA-OE to obtain more discriminative features. Extensive experiments on three challenging public benchmarks show that our MGOA can deal well with occlusion and achieves state-of-the-art performance. [ABSTRACT FROM AUTHOR]

[Display omitted] • Connecting Hessian trace with a generalization error bound. • Flat minima of loss landscape and stability analysis in dynamical systems. • Efficient Hessian trace regularization algorithm with Dropout. • Performance comparison on vision and language tasks. In this paper, we develop a novel regularization method for deep neural networks by penalizing the trace of Hessian. This regularizer is motivated by a recent guarantee bound of the generalization error. We explain its benefits in finding flat minima and avoiding Lyapunov stability in dynamical systems. We adopt the Hutchinson method as a classical unbiased estimator for the trace of a matrix and further accelerate its calculation using a Dropout scheme. Experiments demonstrate that our method outperforms existing regularizers and data augmentation methods, such as Jacobian, Confidence Penalty, Label Smoothing, Cutout, and Mixup. The code is available at https://github.com/Dean-lyc/Hessian-Regularization. [ABSTRACT FROM AUTHOR]

Recently, many efforts have been concentrated on land use land cover (LULC) classification due to rapid urbanization, environmental pollution, agriculture drought, frequent floods, and climate change. However, various aspects have attracted hyperspectral imaging due to there being informative discriminative features, such as spectral-spatial features. To this end, this paper is a comprehensive and systematic review of LULC classification using hyperspectral images by reviewing four significant research investigations. Moreover, the four investigations have addressed the following points: (1) the main components of the hyperspectral imaging, the modes of hyperspectral imaging with data acquisition methods, and the intrinsic differences between hyperspectral image and multispectral image, (2) the role of machine learning in LULC classification, and the standard deep learning methods: Convolution Neural Network (CNN), Stacked Autoencoder (SAE), Deep Belief Network (DBN), Recurrent Neural Network (RNN), and Generative Adversarial Network (GAN), (3) the standard benchmark hyperspectral datasets and the evaluation criteria, (4) the main challenges of LULC classification with the possible solutions for the limited training samples issue, the promising future directions, and finally the recent applications for LULC classification. [ABSTRACT FROM AUTHOR]

Accurate hand joints detection from images is a fundamental topic that is essential for many applications in computer vision and human–computer interaction. This paper presents a two-stage network for hand joints detection from a single unmarked image by using serial-parallel multi-scale feature fusion. In stage I, the hand regions are located by an encoder-decoder network, and the features of each detected hand region are extracted by a shallow spatial hand features representation module. The extracted hand features are then fed into stage II, which consists of serially connected feature extraction modules with similar structures, called "multi-scale feature fusion" (MSFF). An MSFF contains parallel multi-scale feature extraction branches, which generate initial hand joint heatmaps. The initial heatmaps are then mutually reinforced by the anatomic relationship between hand joints. The hand joint detection accuracy shows that the proposed network overperforms the state-of-the-art methods on current datasets, 1) RHD, 2) HS, 3) MPII & NZSL, 4) DCD8-6000, with the PCK@0.2 of 0.94, 0.92, 0.84, 0.97. Meanwhile, one hand in the image takes between 24 and 37 ms to process, which is adequate for supporting many real-time applications. [ABSTRACT FROM AUTHOR]

• A novel pillar-based features encoder named PSCFE is proposed in the paper. • The length-adaptive RNN-based module is designed to deal with the inhomogeneity. • ASCNet has achieved competitive performance in KITTI dataset. This paper presents a novel two-stage 3D point cloud object detector named ASCNet for autonomous driving. Most current works project 3D point clouds to 2D space, whereas the quantization loss in the transformation is inevitable. A Pillar-wise Spatial Context Feature Encoding (PSCFE) module is proposed in the paper to drive the learning of discriminative features and reduce the detailed information loss. The inhomogeneity that existed in 3D object detection from the point clouds, such as the inconsistent number of points in the pillars, the diverse size of Regions of Interest (RoI), should be treated wisely due to the sparsity and the individual specificity. We introduce a length-adaptive RNN-based module to solve the inhomogeneity. A novel backbone combining encoder-decoder and shortcut connection is designed in the paper to learn the multi-scale features for 3D object detection. Additionally, we utilize multiple RoI heads and class-wise NMS to deal with the class imbalance in scenes. Extensive experiments on the KITTI dataset demonstrate that our algorithm achieves competitive performance in 3D bounding box detection and BEV detection. [ABSTRACT FROM AUTHOR]

This paper studies the fixed-time stochastic synchronization problem of multi-weighted complex dynamical networks with impulsive effects. Different from most of previous networks, stochastic disturbances and impulsive effects are considered in this model. The non-chattering controller is utilized, and by devising a novel time-dependent Lyapunov function and dividing the impulsive intervals, a new sufficient criterion for the fixed-time stochastic synchronization (FDTSS) of multi-weighted complex dynamical networks (MWCDNs) is obtained. Secondly, compared with some existing results, this paper proposes a novel means of calculating the settling time by constructing comparison systems and exploiting the method of the classification discussion, and the settling time does not depend on the initial values of the system. In addition, compared with the existing fixed-time and finite-time controllers, the controller devised in this paper is continuous and do not involve sign functions, which non-chattering phenomenon in practical applications. Finally, the Lorenz system is submitted to certify the justifiability of the theoretical results. [ABSTRACT FROM AUTHOR]

Recent works have demonstrated the vulnerability of text classifiers to universal adversarial attacks, which are splicing carefully designed word sequences into the original text. These word sequences are natural, and adversarial examples generated by splicing them with the original text are unnatural. In this paper, we propose a framework for generating natural adversarial examples with an adversarially regularized autoencoder (ARAE) model and an inverter model. The framework maps discrete text into the continuous space, get the conversion of adversarial examples by adding universal adversarial perturbations in the continuous space, then generates natural adversarial examples. In order to achieve universal adversarial attacks, we design a universal adversarial perturbations search (UAPS) algorithm with the gradient of the loss function of the target classifier. Perturbations found by the UAPS algorithm can be directly added to the conversion of the original text in the continuous space. On two textual entailment datasets, we evaluate the fooling rate of generated adversarial examples on two RNN-based architectures and one Transformer-based architecture. The results show that all architectures are vulnerable to the adversarial examples. For example, on the SNLI dataset, the accuracy of the ESIM model for the "entailment" category drops from 88.35% to 2.26%. While achieving a high fooling rate, generated adversarial examples have good performance in naturalness. By further analysis, adversarial examples generated in this paper have transferability in neural networks. [ABSTRACT FROM AUTHOR]

In this paper, we propose a control framework for intelligent surgical robots under the Remote Center of Motion (RCM). The goal of a surgical robot is to assist surgeons in performing complex surgeries. RCM constraint implies that the surgical tip attached to the end-effector of the surgical robot does not slide away from the point of the incision while performing surgery. Implementation of a control algorithm to comply with RCM constraints is a complicated task because of the nonlinear model of the surgical robots and stringent conditions of accuracy imposed by the patient's safety. This paper proposes an optimization-driven approach to perform the surgical maneuver under RCM constraints. We then applied a bio-inspired optimization algorithm to solve the problem efficiently. For testing the performance of ZNNBAS, we used MATLAB to simulate a surgical procedure. A 7-DOF surgical robot (KUKA LBR IIWA 7) was used as a test bench for running the simulations. The simulation results show that the ZNNBAS is comparable with BAS, PSO, and GA and efficiently and robustly performed the task commanded maneuvers while enforcing the RCM constraints. [ABSTRACT FROM AUTHOR]

Video-based person re-identification plays a critical role in intelligent video surveillance by learning temporal correlations from consecutive video frames. Most existing methods aim to solve the challenging variations of pose, occlusion, backgrounds and so on by using attention mechanism. They almost all draw attention to the occlusion and learn occlusion-invariant video representations by abandoning the occluded area or frames, while the other areas in these frames contain sufficient spatial information and temporal cues. To overcome these drawbacks, this paper proposes a comprehensive attention mechanism covering what , where , and when to pay attention in the discriminative spatial-temporal feature learning, namely What-Where-When Attention Network (W3AN). Concretely, W3AN designs a spatial attention module to focus on pedestrian identity and obvious attributes by the importance estimating layer (What and Where), and a temporal attention module to calculate the frame-level importance (when), which is embedded into a graph attention network to exploit temporal attention features rather than computing weighted average feature for video frames like existing methods. Moreover, the experiments on three widely-recognized datasets demonstrate the effectiveness of our proposed W3AN model and the discussion of major modules elaborates the contributions of this paper. [ABSTRACT FROM AUTHOR]

As the smallest structural unit of feature mapping, the convolution kernel in a deep convolution neural networks (DCNN) convolutional layer is responsible for the input channel features to output channel features. A specific convolution kernel belongs to a specific group from the perspective of the input channel, and it belongs to a specific filter from the perspective of the output channel. If the input and output channels are simultaneously considered in the pruning process, the performance of the pruning model can be further improved. This paper proposes progressive kernel pruning with salient mapping of input-output channels, introduces the concept of input-output channel saliency and defines single-port salient mapping channels and dual-port salient mapping channels. This study demonstrates that single-port salient mapping channels can ensure that each input channel signal has a relatively strong convolution kernel mapped to the output channel, and vice versa. The dual-port salient mapping channel is a channel with high feature mapping abilities from both the input and output directions. Additionally, the average mapping ability measure index is defined, which is used to control the kernel pruning process of the single-port salient mapping channel to switch to the kernel pruning process of the dual-port salient mapping channel. The experimental results and analysis show that the method proposed in this paper can be used to effectively prune a heavyweight model and a lightweight model and can obtain a better accuracy under the conditions of higher compression ratio and acceleration ratios. For example, when VGG-16 is pruned on CIFAR-10, the compression ratio and acceleration ration are 91.00 × and 15.24 × , respectively, and the classification accuracy of the model decreased slightly by 0.22%. When ResNet-101 is pruned on ImageNet, the compression ratio and acceleration ratio are 3.90 × and 3.38 × , respectively, and the classification accuracy of the model decreased slightly by 0.48%. The proposed method is significantly better than state-of-the-art methods. [ABSTRACT FROM AUTHOR]

In this paper, we study a projective multi-synchronization problem for fractional-order complex-valued coupled multi-stable neural networks (FCVCMNNs) with time-delays. Using a complex decomposition approach, FCVCMNNs are divided into their real and imaginary components. Our method uses certain conditions for each subnetwork to achieve the multiple local equilibrium points or stable periodic orbits that are exponentially stable, which, when combined with the Lyapunov functions method, result in FCVCMNNs that are projectively multi-synchronized. The FCVCMNNs, on the other hand, are examined directly through the use of the Lyapunov functional method and linear matrix inequality (LMI). Various new sufficient conditions in the form of complex-valued LMIs are presented for the projective multi-synchronization of the considered FCVCMNNs. As a final step, we provide two numerical simulations to verify the effectiveness of the main results derived in this paper. [ABSTRACT FROM AUTHOR]

Noise and physical constraints of redundant manipulators are the two major challenges in the repetitive motion planning (RMP) problems. Therefore, this paper proposed a power-exponent-type modified recurrent neural network (PET-MRNN) to simultaneously address both noise and physical constraints. Moreover, PET-MRNN model is activated by a new Sbp-sinh type nonlinear activation function proposed in this paper. The Sbp-sinh type activation function is first applied to such time varying quadratic program (TVQP) solving and possesses excellent convergence performance. Theoretical analysis proves that the PET-MRNN model can completely eliminate noise disturbance through learning and compensation during the convergence process, and then converge the residual error to zero and obtain the theoretical solution. Finally, simulation and experiments further proved the superiority of the PET-MRNN and the Sbp-sinh type activation function. [ABSTRACT FROM AUTHOR]

This paper engages in a comprehensive investigation concerning the application of Explainable Artificial Intelligence (xAI) within the context of deep learning and Artificial Intelligence, with a specific focus on its implications for cybersecurity. Firstly, the paper gives an overview of xAI techniques and their significance and benefits when applied in cybersecurity. Subsequently, the authors methodically delineate their systematic mapping study, which serves as an investigative tool for discerning the potential trajectory of the field. This strategic methodological framework lets one identify the future research directions and opportunities that underlie the integration of xAI within the realm of Deep Learning, Artificial Intelligence, and cybersecurity, which are described in-depth. Then, the paper brings together all the gathered insights from this extensive investigation and closes with final conclusions. • Application of xAI in Network Intrusion Detection. • Research directions in integrating xAI with cybersecurity. • Guide for developing impactful xAI solutions. [ABSTRACT FROM AUTHOR]

Different from the existing multiple Mittag-Leffler stability or multiple asymptotic stability, the multiple exponential stability, which has explicit and faster convergence rate, is investigated in this paper for fractional-order impulsive control Cohen–Grossberg neural networks. First, by using the definition of Dirac delta function, the fractional-order control Cohen–Grossberg neural networks are translated into fractional-order impulsive neural networks, in which pulse effect relies on the fractional order of the addressed system. Then, based on maximum norm, 1 − norm and general q − norm (q = 2 n) , a series of novel criteria are obtained respectively to ensure that such n − neuron neural networks can have ∏ i = 1 n (2 L i + 1) total equilibrium points and ∏ i = 1 n (L i + 1) locally exponentially stable equilibrium points, by utilizing the known fixed point theorem, the method of average impulsive interval, the theory of fractional-order differential equations, and the method of Lyapunov function. This paper's investigation reveals the effects of impulsive function, impulsive interval, and fractional order on the dynamic behaviors. Finally, theoretical results are shown to be effective by four illustrative examples. [ABSTRACT FROM AUTHOR]

This paper is concerned with a conflict that N -pursuers versus M -evaders. It is a multi-pursuer multi-evader game extended from classical differential game theory to simultaneously address target selection and multi-player pursuit-evasion. Every pursuer attempts to intercept the evader it has chosen as its target while every evader does the opposite. This is modeled as a multi-player nonzero-sum differential game under a weighted directed graph. Moreover, a novel and more practical framework, the Unique-Choice (UC) games framework, is provided. Hamilton–Jacobi–Isaacs (HJI) is used for solving the game to derive the optimal distributed control strategy for each player based on graph theory. An important but has not been extensively studied issue, target selection, is studied. Different from the former research, this paper proposes a more reasonable criterion for target selection which makes the cost of pursuers minimized. The pursuers are proven to intercept evaders successfully with the proposed optimal pursuit strategy. Several illustrative examples under two different cases are presented, and the results show that the cost of pursuers with the proposed target selection algorithm is the minimum of all results. [ABSTRACT FROM AUTHOR]

Most learning-to-rank recommendation models assume users prefer interacted items more than non-interacted ones. All non-interacted items have the same chance to be selected as negative samples. However, the observed interaction data usually shows long-tailed distributions, making traditional recommendation models trained on such data tend to rank popular items higher than users' true preference and degrading the performance of recommender systems. Some existing debias methods focus on eliminating such popularity bias, while simply removing all the popularity bias may diminish recommendation accuracy because popularity also contains some useful information implying item attractiveness, making it pivotal to handling popularity bias in proper ways. In this paper, popularity is recognized to have both positive and negative effects on recommendation. The positive effect of popularity should be amplified while the negative effect should be mitigated. Therefore, this paper proposes two novel schemes to distinguish the positive and negative impact of popularity in learning-to-rank models. First, we propose a popular-weighted sampler to sample non-interacted popular items from users' collaborative items as negative samples with higher probabilities. We believe that if a popular item is collaboratively similar to a user but not interacted with by him, it is more likely to be a true negative sample for the user. We sample such items with higher probabilities to mitigate the harmful negative popularity bias. Second, popularity could be a significant indicator of items' intrinsic quality. Hence, we design a popularity regularization scheme to capture item attractiveness, prompting cold-start users to prefer popular items. Finally, we conduct extensive experiments to evaluate the performance of the proposed schemes. Experimental results demonstrate that our approach can improve existing learning-to-rank models' performance and outperform state-of-the-art debias methods. • We design a novel popularity-weighted sampler to sample negative items. • We propose a popularity regularization term to capture items' attractiveness. • We evaluate the performance of the schemes with extensive experiments. [ABSTRACT FROM AUTHOR]

The predefined-time cooperative output regulation of second-order nonlinear multiagent systems with an unknown exosystem is investigated in this paper. Existing similar work is almost limited to exactly known exosystems, and the upper bound of convergence time for closed-loop systems is difficult to adjust and predict, which may not meet practical needs. In this paper, we first propose a new dynamic compensator called predefined-time distributed observer, which guarantees that each agent estimates the state and parameters about the linear exosystem with unknown system matrix through the general directed communication network within the time set by an explicit parameter. Subsequently, combining the improved dynamic gain control method and the proposed predefined-time distributed observer, a novel distributed dynamic predefined-time control scheme is proposed, which solves the problem of this paper by simplifying the tedious arithmetic process caused by the traditional backstepping method. The final simulation experiments verify the effectiveness of the proposed control scheme. • We extended similar articles to more general leader and controlled objects. • The settling time of our controller can be set directly and structure is simple. • We present a new distributed observer for unknown leader and general digraph. • The designed observer can work for an arbitrarily set period of time. • We transform an unknown leader into a known one in a predefined time. [ABSTRACT FROM AUTHOR]

This paper investigates fully distributed scaled non-negative edge-consensus problems of networked systems with actuator saturation and unmeasurable internal states. By using the adaptive control method, output-feedback-based low-gain technique, and graph theory, a new adaptive algorithm is designed to obtain scaled edge-consensus conditions, under which the difficulties caused by the constraints on edge states and controllers are overcome. There are three interesting characteristics that any global information of networks is not used in this paper's algorithm and result, including the number of vertexes and edges; the feasible solutions of the scaled edge-consensus conditions exist and can be easily obtained; the convergence rate of the controller is adjustable. Furthermore, the designed algorithm is expanded in the cases without actuator saturation. Finally, three examples are given to verify the theoretical results. [ABSTRACT FROM AUTHOR]

This paper presents a formal verification guided approach for a principled design and implementation of robust and resilient learning-enabled systems. We focus on learning-enabled state estimation systems (LE-SESs), which have been widely used in robotics applications to determine the current state (e.g., location, speed, direction, etc.) of a complex system. The LE-SESs are networked systems, composed of a set of connected components including: Bayes filters for state estimation, and neural networks for processing sensory input. We study LE-SESs from the perspective of formal verification, which determines the satisfiabilty of a system model against the specified properties. Over LE-SESs, we investigate two key properties – robustness and resilience – and provide their formal definitions. To enable formal verification, we reduce the LE-SESs to a novel class of labelled transition systems, named {PO}2-LTS in the paper, and formally express the properties as constrained optimisation objectives. We prove that the verification problems are NP-complete. Based on {PO}2-LTS and the optimisation objectives, practical verification algorithms are developed to check the satisfiability of the properties on the LE-SESs. As a major case study, we interrogate a real-world dynamic tracking system which uses a single Kalman Filter (KF) – a special case of Bayes filter – to localise and track a ground vehicle. Its perception system, based on convolutional neural networks, processes a high-resolution Wide Area Motion Imagery (WAMI) data stream. Experimental results show that our algorithms can not only verify the properties of the WAMI tracking system but also provide representative examples, the latter of which inspired us to take an enhanced LE-SESs design where runtime monitors or joint-KFs are required. Experimental results confirm the improvement in the robustness of the enhanced design. [ABSTRACT FROM AUTHOR]

Modern machine learning algorithms aim to extract fine-grained information from data to provide accurate predictions, which often conflicts with the goal of privacy protection. This paper addresses the practical and theoretical importance of developing privacy-preserving machine learning algorithms that ensure good performance while preserving privacy. In this paper, we focus on the privacy and utility (measured by excess risk bounds) performances of differentially private stochastic gradient descent (SGD) algorithms in the setting of stochastic convex optimization. Specifically, we examine the pointwise problem in the low-noise setting for which we derive sharper excess risk bounds for the differentially private SGD algorithm. In the pairwise learning setting, we propose a simple differentially private SGD algorithm based on gradient perturbation. Furthermore, we develop novel utility bounds for the proposed algorithm, proving that it achieves optimal excess risk rates even for non-smooth losses. Notably, we establish fast learning rates for privacy-preserving pairwise learning under the low-noise condition, which is the first of its kind. [ABSTRACT FROM AUTHOR]

This paper introduces Elegans-AI models, a class of neural networks that leverage the connectome topology of the Caenorhabditis elegans to design deep and reservoir architectures. Utilizing deep learning models inspired by the connectome, this paper leverages the evolutionary selection process to consolidate the functional arrangement of biological neurons within their networks. The initial goal involves the conversion of natural connectomes into artificial representations. The second objective centers on embedding the complex circuitry topology of artificial connectomes into both deep learning and deep reservoir networks, highlighting their neural-dynamic short-term and long-term memory and learning capabilities. Lastly, our third objective aims to establish structural explainability by examining the heterophilic/homophilic properties within the connectome and their impact on learning capabilities. In our study, the Elegans-AI models demonstrate superior performance compared to similar models that utilize either randomly rewired artificial connectomes or simulated bio-plausible ones. Notably, these Elegans-AI models achieve a top-1 accuracy of 99.99% on both Cifar10 and Cifar100, and 99.84% on MNIST Unsup. They do this with significantly fewer learning parameters, particularly when reservoir configurations of the connectome are used. Our findings indicate a clear connection between bio-plausible network patterns, the small-world characteristic, and learning outcomes, emphasizing the significant role of evolutionary optimization in shaping the topology of artificial neural networks for improved learning performance. [ABSTRACT FROM AUTHOR]

This paper studies the consensus problem of a new multi-agent system via multi-task, multi-control mechanism and multi-consensus strategy. Firstly, two multi-task algorithms are proposed, which can reasonably select some agent nodes with better performance to form the multi-agent system according to different tasks. Secondly, a multi-control protocol designed in this paper integrates continuous control mechanism, impulsive control mechanism and hybrid control mechanism, which has strong applicability and efficiency. Thirdly, a multi-consensus strategy is designed, and it can be converted into "average consensus strategy", "leader-following consensus strategy" and "hybrid consensus strategy" through different parameter settings, which greatly broadens the application field of the multi-agent system. We construct a dynamic model for the proposed multi-agent system, analyze it by using matrix measure and Lyapunov stability theory, and obtain the theorems that enable it to achieve multiple consensus. Finally, the efficiency and practicability of our theories are verified through several simulation experiments. We further carry out some comparative analysis with some relevant papers, and obtain the superiority of our theories in multiple indicators. [ABSTRACT FROM AUTHOR]

In recent years, exchangeable network structures that take datasets as input have been widely used to obtain representations of various datasets. Although they perform well, analyzing exchangeable network with a dataset as input is challenging. Given that this type of network can be viewed as a function acting on probability measures since datasets are drawn from various distributions, this paper theoretically analyzes exchangeable network structures from a probabilistic perspective. This paper proposes a probabilistic analytical framework that neural networks acting on probability measures, which is an extension of Multi-Layer Perceptrons (MLP). When only samples from each distribution are available, in this new analytical framework, neural networks acting on probability measures correspond to the traditional exchangeable structure defined on datasets. Using this new analytical framework, we can demonstrate the ability of exchangeable network structures to capture complex patterns, as it provides the universal approximation property of exchangeable network structures. Furthermore, we derive a consistency result that shows the parameter estimation of exchangeable network structures is consistent statistically under certain conditions. [ABSTRACT FROM AUTHOR]

With the increasing data size of multi classification problems, the running efficiency of classical algorithms is seriously affected. In the paper, in order to improve the implementation efficiency of the algorithm, we propose a quantum-enhanced solution method for multi classification problems. The method mainly introduces the quantum-enhanced technology into the classical algorithm. Aiming at the two steps of solving Euclid distance and kernel function in the classical algorithm, the paper relates the classical inner product principle with the amplitude evolution of quantum states. On the basis of quantizing the sample data, a general quantum circuit that can calculate the inner product is designed and constructed. The circuit can make full use of the advantages of quantum parallel computing to achieve exponential acceleration of computing efficiency. Aiming at solving linear equations in the classical algorithm, a quantum circuit based on the quantum singular value estimation is designed and constructed. The circuit makes use of the acceleration advantage of quantum computing in matrix computing to achieve polynomial acceleration of matrix computing. The experimental results show that the method can not only find the optimal solution for multi classification problems, but also greatly improve the operation efficiency of the algorithm. Compared with the classical methods, the method has at least polynomial improvement in time complexity and spatial complexity. [ABSTRACT FROM AUTHOR]