A NEW METHOD TO ANALYZE COMPLETE STABILITY OF PWL CELLULAR NEURAL NETWORKS

2001 ◽  
Vol 11 (03) ◽  
pp. 655-676 ◽  
Author(s):  
M. FORTI ◽  
A. TESI

In recent years, the standard Cellular Neural Networks (CNN's) introduced by Chua and Yang [1988] have been one of the most investigated paradigms for neural information processing. In a wide range of applications, the CNN's are required to be completely stable, i.e. each trajectory should converge toward some stationary state. However, a rigorous proof of complete stability, even in the simplest original setting of piecewise-linear (PWL) neuron activations and symmetric interconnections [Chua & Yang, 1988], is still lacking. This paper aims primarily at filling this gap, in order to give a sound analytical foundation to the CNN paradigm. To this end, a novel approach for studying complete stability is proposed. This is based on a fundamental limit theorem for the length of the CNN trajectories. The method differs substantially from the classic approach using LaSalle invariance principle, and permits to overcome difficulties encountered when using LaSalle approach to analyze complete stability of PWL CNN's. The main result obtained, is that a symmetric PWL CNN is completely stable for any choice of the network parameters, i.e. it possesses the Absolute Stability property of global pattern formation. This result is really general and shows that complete stability holds under hypotheses weaker than those considered in [Chua & Yang, 1988]. The result does not require, for example, that the CNN has binary stable equilibrium points only. It is valid even in degenerate situations where the CNN has infinite nonisolated equilibrium points. These features significantly extend the potential application fields of the standard CNN's.

2009 ◽  
Vol 21 (5) ◽  
pp. 1434-1458 ◽  
Author(s):  
Xuemei Li

This letter discusses the complete stability of discrete-time cellular neural networks with piecewise linear output functions. Under the assumption of certain symmetry on the feedback matrix, a sufficient condition of complete stability is derived by finite trajectory length. Because the symmetric conditions are not robust, the complete stability of networks may be lost under sufficiently small perturbations. The robust conditions of complete stability are also given for discrete-time cellular neural networks with multiple equilibrium points and a unique equilibrium point. These complete stability results are robust and available.


Author(s):  
Ansgar Rössig ◽  
Milena Petkovic

Abstract We consider the problem of verifying linear properties of neural networks. Despite their success in many classification and prediction tasks, neural networks may return unexpected results for certain inputs. This is highly problematic with respect to the application of neural networks for safety-critical tasks, e.g. in autonomous driving. We provide an overview of algorithmic approaches that aim to provide formal guarantees on the behaviour of neural networks. Moreover, we present new theoretical results with respect to the approximation of ReLU neural networks. On the other hand, we implement a solver for verification of ReLU neural networks which combines mixed integer programming with specialized branching and approximation techniques. To evaluate its performance, we conduct an extensive computational study. For that we use test instances based on the ACAS Xu system and the MNIST handwritten digit data set. The results indicate that our approach is very competitive with others, i.e. it outperforms the solvers of Bunel et al. (in: Bengio, Wallach, Larochelle, Grauman, Cesa-Bianchi, Garnett (eds) Advances in neural information processing systems (NIPS 2018), 2018) and Reluplex (Katz et al. in: Computer aided verification—29th international conference, CAV 2017, Heidelberg, Germany, July 24–28, 2017, Proceedings, 2017). In comparison to the solvers ReluVal (Wang et al. in: 27th USENIX security symposium (USENIX Security 18), USENIX Association, Baltimore, 2018a) and Neurify (Wang et al. in: 32nd Conference on neural information processing systems (NIPS), Montreal, 2018b), the number of necessary branchings is much smaller. Our solver is publicly available and able to solve the verification problem for instances which do not have independent bounds for each input neuron.


2012 ◽  
Vol 89 ◽  
pp. 106-113 ◽  
Author(s):  
Qi Han ◽  
Xiaofeng Liao ◽  
Tengfei Weng ◽  
Chuandong Li ◽  
Hongyu Huang

2004 ◽  
Vol 14 (08) ◽  
pp. 2579-2653 ◽  
Author(s):  
MAKOTO ITOH ◽  
LEON O. CHUA

The global phase portrait of structurally stable two-cell cellular neural networks is studied. The configuration of equilibrium points, the number of limit cycles and their locations are investigated systematically.


2006 ◽  
Vol 27 (1) ◽  
pp. 20-37 ◽  
Author(s):  
Nadine Helmbold ◽  
Thomas Rammsayer

In the present study, the relationship between timing performance and psychometric intelligence as measured by a speed and a power test of intelligence was examined. For this purpose performance on the Zahlen-Verbindungs-Test (ZVT), the Wiener Matrizen-Test (WMT), seven psychophysical temporal tasks, and the Hick reaction-time paradigm was obtained in 190 participants. Correlational and principal component analyses suggested a unitary timing mechanism referred to as temporal g. Performance on single temporal tasks and individual factor scores on temporal g were substantially related to both speed and power measures of psychometric intelligence. Temporal g exhibited higher sensitivity to the prediction of performance on the power test than on the speed test. Furthermore, stepwise multiple regression analysis and commonality analysis revealed that timing performance provides a more powerful predictor of psychometric intelligence than traditional reaction-time measures derived from the Hick paradigm. These findings support the notion that the temporal resolution capacity of the brain as assessed with psychophysical temporal tasks reflects an essential property of brain functioning, which is relevant to a wide range of intelligence-related aspects of neural information processing.


2008 ◽  
Vol 18 (11) ◽  
pp. 3221-3231
Author(s):  
JUNG-CHAO BAN ◽  
CHIH-HUNG CHANG

This investigation elucidates the dense entropy of two-dimensional inhomogeneous cellular neural networks (ICNN) with/without input. It is strongly related to the learning problem (or inverse problem); the necessary and sufficient conditions for the admissibility of local patterns must be characterized. For ICNN with/without input, the entropy function is dense in [0, log 2] with respect to the parameter space and the radius of the interacting cells, indicating that, in some sense, ICNN exhibit a wide range of phenomena.


2003 ◽  
Vol 13 (06) ◽  
pp. 489-498 ◽  
Author(s):  
R. TETZLAFF ◽  
R. KUNZ ◽  
C. NIEDERHÖFER

In this paper, we present a novel approach to the prediction of epileptic seizures using boolean CNN with linear weight functions. Three different binary pattern occurrence behaviours will be discussed and analysed for several invasive recordings of brain electrical activity. Furthermore analogic binary pattern detection algorithms will be introduced for a possible prediction of epileptic seizures.


Sign in / Sign up

Export Citation Format

Share Document