arXiv subjects

Jean-Jacques Slotine

Publications and source records attributed to Jean-Jacques Slotine.

At least 91 records · Page 5Linked to original sources

arXiv2013

Synchronization and quorum sensing in a swarm of humanoid robots

With the advent of inexpensive simple humanoid robots, new classes of robotic questions can be considered experimentally. One of these is collective behavior of groups of humanoid robots, and in particular robot synchronization and swarming. The goal of this work is to robustly synchronize a group of humanoid robots, and to demonstrate the approach experimentally on a choreography of 8 robots. We aim to be robust to network latencies, and to allow robots to join or leave the group at any time (for example a fallen robot should be able to stand up to rejoin the choreography). Contraction theory is used to allow each robot in the group to synchronize to a common virtual oscillator, and quorum sensing strategies are exploited to fit within the available bandwidth. The humanoids used are Nao's, developed by Aldebaran Robotics.

nlin.AO↗

arXiv2013

Stochastic Contraction in Riemannian Metrics

Stochastic contraction analysis is a recently developed tool for studying the global stability properties of nonlinear stochastic systems, based on a differential analysis of convergence in an appropriate metric. To date, stochastic contraction results and sharp associated performance bounds have been established only in the specialized context of state-independent metrics, which restricts their applicability. This paper extends stochastic contraction analysis to the case of general time- and state-dependent Riemannian metrics, in both discrete-time and continuous-time settings, thus extending its applicability to a significantly wider range of nonlinear stochastic dynamics.

math.OC↗

arXiv2013

Large Gain Stability of Extremum Seeking and Higher-Order Averaging Theory

Convergence of Extremum Seeking (ES) algorithms has been established in the limit of small gains. Using averaging theory and contraction analysis, we propose a framework for computing explicit bounds on the departure of the ES scheme from its ideal dominant-order average dynamics. The bounds remain valid for possibly large gains. They allow us to establish stability and estimate convergence rates, and they open the way to selecting "optimal" finite gains for the ES scheme.

math.OC↗

arXiv2013

Effect of correlations on network controllability

A dynamical system is controllable if by imposing appropriate external signals on a subset of its nodes, it can be driven from any initial state to any desired state in finite time. Here we study the impact of various network characteristics on the minimal number of driver nodes required to control a network. We find that clustering and modularity have no discernible impact, but the symmetries of the underlying matching problem can produce linear, quadratic or no dependence on degree correlation coefficients, depending on the nature of the underlying correlations. The results are supported by numerical simulations and help narrow the observed gap between the predicted and the observed number of driver nodes in real networks.

physics.soc-ph↗

arXiv2012

A contraction theory-based analysis of the stability of the Extended Kalman Filter

The contraction properties of the Extended Kalman Filter, viewed as a deterministic observer for nonlinear systems, are analyzed. This yields new conditions under which exponential convergence of the state error can be guaranteed. As contraction analysis studies the evolution of an infinitesimal discrepancy between neighboring trajectories, and thus stems from a differential framework, the sufficient convergence conditions are different from the ones that previously appeared in the literature, which were derived in a Lyapunov framework. This article sheds another light on the theoretical properties of this popular observer.

eess.SY↗

arXiv2012

Multiclass Learning with Simplex Coding

In this paper we discuss a novel framework for multiclass learning, defined by a suitable coding/decoding strategy, namely the simplex coding, that allows to generalize to multiple classes a relaxation approach commonly used in binary classification. In this framework, a relaxation error analysis can be developed avoiding constraints on the considered hypotheses class. Moreover, we show that in this setting it is possible to derive the first provably consistent regularized method with training/tuning complexity which is independent to the number of classes. Tools from convex analysis are introduced that can be used beyond the scope of this paper.

stat.ML↗

arXiv2012

Competition through selective inhibitory synchrony

Models of cortical neuronal circuits commonly depend on inhibitory feedback to control gain, provide signal normalization, and to selectively amplify signals using winner-take-all (WTA) dynamics. Such models generally assume that excitatory and inhibitory neurons are able to interact easily, because their axons and dendrites are co-localized in the same small volume. However, quantitative neuroanatomical studies of the dimensions of axonal and dendritic trees of neurons in the neocortex show that this co-localization assumption is not valid. In this paper we describe a simple modification to the WTA circuit design that permits the effects of distributed inhibitory neurons to be coupled through synchronization, and so allows a single WTA to be distributed widely in cortical space, well beyond the arborization of any single inhibitory neuron, and even across different cortical areas. We prove by non-linear contraction analysis, and demonstrate by simulation that distributed WTA sub-systems combined by such inhibitory synchrony are inherently stable. We show analytically that synchronization is substantially faster than winner selection. This circuit mechanism allows networks of independent WTAs to fully or partially compete with each other.

q-bio.NC↗

arXiv2012

Control centrality and hierarchical structure in complex networks

We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly determined by the network's degree distribution. We rigorously prove that in a directed network without loops the control centrality of a node is uniquely determined by its layer index or topological position in the underlying hierarchical structure of the network. Inspired by the deep relation between control centrality and hierarchical structure in a general directed network, we design an efficient attack strategy against the controllability of malicious networks.

physics.soc-ph↗

arXiv2011

Collective stability of networks of winner-take-all circuits

The neocortex has a remarkably uniform neuronal organization, suggesting that common principles of processing are employed throughout its extent. In particular, the patterns of connectivity observed in the superficial layers of the visual cortex are consistent with the recurrent excitation and inhibitory feedback required for cooperative-competitive circuits such as the soft winner-take-all (WTA). WTA circuits offer interesting computational properties such as selective amplification, signal restoration, and decision making. But, these properties depend on the signal gain derived from positive feedback, and so there is a critical trade-off between providing feedback strong enough to support the sophisticated computations, while maintaining overall circuit stability. We consider the question of how to reason about stability in very large distributed networks of such circuits. We approach this problem by approximating the regular cortical architecture as many interconnected cooperative-competitive modules. We demonstrate that by properly understanding the behavior of this small computational module, one can reason over the stability and convergence of very large networks composed of these modules. We obtain parameter ranges in which the WTA circuit operates in a high-gain regime, is stable, and can be aggregated arbitrarily to form large stable networks. We use nonlinear Contraction Theory to establish conditions for stability in the fully nonlinear case, and verify these solutions using numerical simulations. The derived bounds allow modes of operation in which the WTA network is multi-stable and exhibits state-dependent persistent activities. Our approach is sufficiently general to reason systematically about the stability of any network, biological or technological, composed of networks of small modules that express competition through shared inhibition.

q-bio.NC↗

arXiv2011

Synchronization and Redundancy: Implications for Robustness of Neural Learning and Decision Making

Learning and decision making in the brain are key processes critical to survival, and yet are processes implemented by non-ideal biological building blocks which can impose significant error. We explore quantitatively how the brain might cope with this inherent source of error by taking advantage of two ubiquitous mechanisms, redundancy and synchronization. In particular we consider a neural process whose goal is to learn a decision function by implementing a nonlinear gradient dynamics. The dynamics, however, are assumed to be corrupted by perturbations modeling the error which might be incurred due to limitations of the biology, intrinsic neuronal noise, and imperfect measurements. We show that error, and the associated uncertainty surrounding a learned solution, can be controlled in large part by trading off synchronization strength among multiple redundant neural systems against the noise amplitude. The impact of the coupling between such redundant systems is quantified by the spectrum of the network Laplacian, and we discuss the role of network topology in synchronization and in reducing the effect of noise. A range of situations in which the mechanisms we model arise in brain science are discussed, and we draw attention to experimental evidence suggesting that cortical circuits capable of implementing the computations of interest here can be found on several scales. Finally, simulations comparing theoretical bounds to the relevant empirical quantities show that the theoretical estimates we derive can be tight.

q-bio.NC↗

arXiv2010

Generalized cyclic algorithms for formation acquisition and control

This paper presents a new approach to distributed nonlinear control for formation acquisition and maintenance, inspired by recent results on cyclic topologies and based on tools from contraction theory. First, simple nonlinear control laws are derived to achieve global exponential convergence to basic symmetric formations. Next, convergence to more complex structures is obtained using control laws based on the idea of convergence primitives, linear combinations of basic control elements. All control laws use only local information and communication to achieve a desired global behavior.

nlin.PS↗

arXiv2010

On Synchronization of Coupled Hopf-Kuramoto Oscillators with Phase Delays

This paper presents new methods and results on almost global synchronization of coupled Hopf nonlinear oscillators, which are commonly used as the dynamic model of engineered central pattern generators (CPGs). On balanced graphs, any positive coupling gain is proven to induce almost global asymptotic synchronization, and a threshold value for truly global exponential synchronization is also computed. Furthermore, a hierarchical connection between coupled Hopf oscillators and Kuramoto oscillators is identified. Finally, a new result on the synchronization of Kuramoto oscillators with arbitrary time-varying heterogeneous frequencies and delays is derived.

math.OC↗

arXiv2009

How synchronization protects from noise

Synchronization phenomena are pervasive in biology. In neuronal networks, the mechanisms of synchronization have been extensively studied from both physiological and computational viewpoints. The functional role of synchronization has also attracted much interest and debate. In particular, synchronization may allow distant sites in the brain to communicate and cooperate with each other, and therefore it may play a role in temporal binding and in attention and sensory-motor integration mechanisms. In this article, we study another role for synchronization: the so-called "collective enhancement of precision." We argue, in a full nonlinear dynamical context, that synchronization may help protect interconnected neurons from the influence of random perturbations -- intrinsic neuronal noise -- which affect all neurons in the nervous system. This property may allow reliable computations to be carried out even in the presence of significant noise (as experimentally found e.g., in retinal ganglion cells in primates), as mathematically it is key to obtaining meaningful downstream signals, whether in terms of precisely-timed interaction (temporal coding), population coding, or frequency coding. Using stochastic contraction theory, we show how synchronization of nonlinear dynamical systems helps protect these systems from random perturbations. Our main contribution is a mathematical proof that, under specific quantified conditions, the impact of noise on each individual system and on the spatial mean can essentially be cancelled through synchronization. Similar concepts may be applicable to questions in systems biology.

q-bio.NC↗

arXiv2008

Audio Classification from Time-Frequency Texture

Time-frequency representations of audio signals often resemble texture images. This paper derives a simple audio classification algorithm based on treating sound spectrograms as texture images. The algorithm is inspired by an earlier visual classification scheme particularly efficient at classifying textures. While solely based on time-frequency texture features, the algorithm achieves surprisingly good performance in musical instrument classification experiments.

cs.CV↗

arXiv2008

Visual Grouping by Neural Oscillators

Distributed synchronization is known to occur at several scales in the brain, and has been suggested as playing a key functional role in perceptual grouping. State-of-the-art visual grouping algorithms, however, seem to give comparatively little attention to neural synchronization analogies. Based on the framework of concurrent synchronization of dynamic systems, simple networks of neural oscillators coupled with diffusive connections are proposed to solve visual grouping problems. Multi-layer algorithms and feedback mechanisms are also studied. The same algorithm is shown to achieve promising results on several classical visual grouping problems, including point clustering, contour integration and image segmentation.

cs.CV↗

arXiv2008

Fast Wavelet-Based Visual Classification

We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work of Serre et al. Specifically, trading-off biological accuracy for computational efficiency, we explore using wavelet and grouplet-like transforms to parallel the tuning of visual cortex V1 and V2 cells, alternated with max operations to achieve scale and translation invariance. A feature selection procedure is applied during learning to accelerate recognition. We introduce a simple attention-like feedback mechanism, significantly improving recognition and robustness in multiple-object scenes. In experiments, the proposed algorithm achieves or exceeds state-of-the-art success rate on object recognition, texture and satellite image classification, language identification and sound classification.

cs.CV↗

arXiv2008

Neuronal networks and controlled symmetries, a generic framework

The extraordinary computational power of the brain may be related in part to the fact that each of the smaller neural networks that compose it can behave transiently in many different ways, depending on its inputs. Mathematically, input continuity helps to show how a large network, constructed recursively from smaller blocks, can exhibit robust specific properties according to its input. By extending earlier work on synchrony and symmetry, we exploit input continuity of contracting systems to ensure robust control of diverse spatial and spatio-temporal symmetries of the output signal in such a network.

q-bio.NC↗

arXiv2006

Stable Concurrent Synchronization in Dynamic System Networks

In a network of dynamical systems, concurrent synchronization is a regime where multiple groups of fully synchronized elements coexist. In the brain, concurrent synchronization may occur at several scales, with multiple ``rhythms'' interacting and functional assemblies combining neural oscillators of many different types. Mathematically, stable concurrent synchronization corresponds to convergence to a flow-invariant linear subspace of the global state space. We derive a general condition for such convergence to occur globally and exponentially. We also show that, under mild conditions, global convergence to a concurrently synchronized regime is preserved under basic system combinations such as negative feedback or hierarchies, so that stable concurrently synchronized aggregates of arbitrary size can be constructed. Robustnesss of stable concurrent synchronization to variations in individual dynamics is also quantified. Simple applications of these results to classical questions in systems neuroscience and robotics are discussed.

q-bio.NC↗