Search

This paper considers the tracking synchronization problem for a class of coupled reaction–diffusion neural networks (CRDNNs) with undirected topology. For the case where the tracking trajectory has identical individual dynamic as that of the network nodes, the edge-based and vertex-based adaptive strategies on coupling strengths as well as adaptive controllers, which demand merely the local neighbor information, are proposed to synchronize the CRDNNs to the tracking trajectory. To reduce the control costs, an adaptive pinning control technique is employed. For the case where the tracking trajectory has different individual dynamic from that of the network nodes, the vertex-based adaptive strategy is proposed to drive the synchronization error to a relatively small area, which is adjustable according to the parameters of the adaptive strategy. This kind of adaptive design can enhance the robustness of the network against the external disturbance posed on the tracking trajectory. The obtained theoretical results are verified by two representative examples. [ABSTRACT FROM AUTHOR]

This paper is concerned with the guaranteed cost control problem for a class of Markov jump discrete-time neural networks (NNs) with event-triggered mechanism, asynchronous jumping, and fading channels. The Markov jump NNs are introduced to be close to reality, where the modes of the NNs and guaranteed cost controller are determined by two mutually independent Markov chains. The asynchronous phenomenon is considered, which increases the difficulty of designing required mode-dependent controller. The event-triggered mechanism is designed by comparing the relative measurement error with the last triggered state at the process of data transmission, which is used to eliminate dispensable transmission and reduce the networked energy consumption. In addition, the signal fading is considered for the effect of signal reflection and shadow in wireless networks, which is modeled by the novel Rice fading models. Some novel sufficient conditions are obtained to guarantee that the closed-loop system reaches a specified cost value under the designed jumping state feedback control law in terms of linear matrix inequalities. Finally, some simulation results are provided to illustrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper investigates the synchronization issue of coupled reaction–diffusion neural networks with directed topology via an adaptive approach. Due to the complexity of the network structure and the presence of space variables, it is difficult to design proper adaptive strategies on coupling weights to accomplish the synchronous goal. Under the assumptions of two kinds of special network structures, that is, directed spanning path and directed spanning tree, some novel edge-based adaptive laws, which utilized the local information of node dynamics fully are designed on the coupling weights for reaching synchronization. By constructing appropriate energy function, and utilizing some analytical techniques, several sufficient conditions are given. Finally, some simulation examples are given to verify the effectiveness of the obtained theoretical results. [ABSTRACT FROM PUBLISHER]

This brief is concerned with stability analysis for delayed neural networks (DNNs). By establishing polynomials and introducing slack variables reasonably, some improved delay-product type of auxiliary polynomial-based functions (APFs) is developed to exploit additional degrees of freedom and more information on extra states. Then, by constructing Lyapunov–Krasovskii functional using APFs and integrals of quadratic forms with high order scalar functions, a novel stability criterion is derived for DNNs, in which the benefits of the improved inequalities are fully integrated and the information on delay and its derivative is well reflected. By virtue of the advantages of APFs, more desirable performance is achieved through the proposed approach, which is demonstrated by the numerical examples. [ABSTRACT FROM AUTHOR]

Clustering algorithms based on deep neural networks have been widely studied for image analysis. Most existing methods require partial knowledge of the true labels, namely, the number of clusters, which is usually not available in practice. In this article, we propose a Bayesian nonparametric framework, deep nonparametric Bayes (DNB), for jointly learning image clusters and deep representations in a doubly unsupervised manner. In doubly unsupervised learning, we are dealing with the problem of “unknown unknowns,” where we estimate not only the unknown image labels but also the unknown number of labels as well. The proposed algorithm alternates between generating a potentially unbounded number of clusters in the forward pass and learning the deep networks in the backward pass. With the help of the Dirichlet process mixtures, the proposed method is able to partition the latent representations space without specifying the number of clusters a priori. An important feature of this work is that all the estimation is realized with an end-to-end solution, which is very different from the methods that rely on post hoc analysis to select the number of clusters. Another key idea in this article is to provide a principled solution to the problem of “trivial solution” for deep clustering, which has not been much studied in the current literature. With extensive experiments on benchmark datasets, we show that our doubly unsupervised method achieves good clustering performance and outperforms many other unsupervised image clustering methods. [ABSTRACT FROM AUTHOR]

Adversarial training methods are frequently-used empirical defense methods against adversarial examples. While many regularization techniques demonstrate effectiveness when combined with adversarial training, these methods typically work in the time domain. However, as the adversarial vulnerability can be considered a high-frequency phenomenon, it is crucial to regulate adversarially-trained neural network models in the frequency domain to capture low-frequency and high-frequency features. Neural networks must fully utilize the detailed local features extracted by their receptive field. To address these challenges, we conduct a theoretical analysis of the regularization properties of wavelets, which can enhance adversarial training. We propose a wavelet regularization method based on the Haar wavelet decomposition named Wavelet Average Pooling. This wavelet regularization module is integrated into a wide residual neural network to form a new model called WideWaveletResNet. On the CIFAR-10 and CIFAR-100 datasets, our proposed Adversarial Wavelet Training method demonstrates considerable robustness against different types of attacks. It confirms our assumption that our wavelet regularization method can enhance adversarial robustness, particularly in deep and wide neural networks. We present a detailed comparison of different wavelet base functions and conduct visualization experiments of the Frequency Principle (F-Principle) and interpretability to demonstrate the effectiveness of our method. The code is available on the open-source website: https://github.com/momo1986/AdversarialWaveletTraining. [ABSTRACT FROM AUTHOR]