arXiv subjects
Publications and source records attributed to Jean-Jacques Slotine.
We discuss technical results on learning function approximations using piecewise-linear basis functions, and analyze their stability and convergence using nonlinear contraction theory.
Finding actions that satisfy the constraints imposed by both external inputs and internal representations is central to decision making. We demonstrate that some important classes of constraint satisfaction problems (CSPs) can be solved by networks composed of homogeneous cooperative-competitive modules that have connectivity similar to motifs observed in the superficial layers of neocortex. The winner-take-all modules are sparsely coupled by programming neurons that embed the constraints onto the otherwise homogeneous modular computational substrate. We show rules that embed any instance of the CSPs planar four-color graph coloring, maximum independent set, and Sudoku on this substrate, and provide mathematical proofs that guarantee these graph coloring problems will convergence to a solution. The network is composed of non-saturating linear threshold neurons. Their lack of right saturation allows the overall network to explore the problem space driven through the unstable dynamics generated by recurrent excitation. The direction of exploration is steered by the constraint neurons. While many problems can be solved using only linear inhibitory constraints, network performance on hard problems benefits significantly when these negative constraints are implemented by non-linear multiplicative inhibition. Overall, our results demonstrate the importance of instability rather than stability in network computation, and also offer insight into the computational role of dual inhibitory mechanisms in neural circuits.
In modern power systems, the operating point, at which the demand and supply are balanced, may take different values due to changes in loads and renewable generation levels. Understanding the dynamics of stressed power systems with a range of operating points would be essential to assuring their reliable operation, and possibly allow higher integration of renewable resources. This letter introduces a non-traditional way to think about the stability assessment problem of power systems. Instead of estimating the set of initial states leading to a given operating condition, we characterize the set of operating conditions that a power grid converges to from a given initial state under changes in power injections and lines. We term this problem as "inverse stability", a problem which is rarely addressed in the control and systems literature, and hence, poorly understood. Exploiting quadratic approximations of the system's energy function, we introduce an estimate of the inverse stability region. Also, we briefly describe three important applications of the inverse stability notion: (i) robust stability assessment of power systems w.r.t. different renewable generation levels, (ii) stability-constrained optimal power flow (sOPF), and (iii) stability-guaranteed corrective action design.
With the increased application of model-based whole-body control in legged robots, there has been a resurgence of research interest into methods for accurate system identification. An important class of methods focuses on the inertial parameters of rigid-body systems. These parameters consist of the mass, first mass moment (related to center of mass location), and rotational inertia matrix of each link. The main contribution of this paper is to formulate physical-consistency constraints on these parameters as Linear Matrix Inequalities (LMIs). The use of these constraints in identification can accelerate convergence and increase robustness to noisy data. It is critically observed that the proposed LMIs are expressed in terms of the covariance of the mass distribution, rather than its rotational moments of inertia. With this perspective, connections to the classical problem of moments in mathematics are shown to yield new bounding-volume constraints on the mass distribution of each link. While previous work ensured physical plausibility or used convex optimization in identification, the LMIs here uniquely enable both advantages. Constraints are applied to identification of a leg for the MIT Cheetah 3 robot. Detailed properties of transmission components are identified alongside link inertias, with parameter optimization carried out to global optimality through semidefinite programming.
Understanding how recurrent neural circuits can learn to implement dynamical systems is a fundamental challenge in neuroscience. The credit assignment problem, i.e. determining the local contribution of each synapse to the network's global output error, is a major obstacle in deriving biologically plausible local learning rules. Moreover, spiking recurrent networks implementing such tasks should not be hugely costly in terms of number of neurons and spikes, as they often are when adapted from rate models. Finally, these networks should be robust to noise and neural deaths in order to sustain these representations in the face of such naturally occurring perturbation. We approach this problem by fusing the theory of efficient, balanced spiking networks (EBN) with nonlinear adaptive control theory. Local learning rules are ensured by feeding back into the network its own error, resulting in a synaptic plasticity rule depending solely on presynaptic inputs and post-synaptic feedback. The spiking efficiency and robustness of the network are guaranteed by maintaining a tight excitatory/inhibitory balance, ensuring that each spike represents a local projection of the global output error and minimizes a loss function. The resulting networks can learn to implement complex dynamics with very small numbers of neurons and spikes, exhibit the same spike train variability as observed experimentally, and are extremely robust to noise and neuronal loss.
This paper studies the contraction properties of nonlinear differential-algebraic equation (DAE) systems. Specifically we develop scalable techniques for constructing the attraction regions associated with a particular stable equilibrium, by establishing the relation between the contraction rates of the original systems and the corresponding virtual extended systems. We show that for a contracting DAE system, the reduced system always contracts faster than the extended ones; furthermore, there always exists an extension with contraction rate arbitrarily close to that of the original system. The proposed construction technique is illustrated with a power system example in the context of transient stability assessment.
This paper solves the classical problem of simultaneous localization and mapping (SLAM) in a fashion which avoids linearized approximations altogether. Based on creating virtual synthetic measurements, the algorithm uses a linear time- varying (LTV) Kalman observer, bypassing errors and approximations brought by the linearization process in traditional extended Kalman filtering (EKF) SLAM. Convergence rates of the algorithm are established using contraction analysis. Different combinations of sensor information can be exploited, such as bearing measurements, range measurements, optical flow, or time-to-contact. As illustrated in simulations, the proposed algorithm can solve SLAM problems in both 2D and 3D scenarios with guaranteed convergence rates in a full nonlinear context.
This paper describes the use of spatially-sparse inputs to influence global changes in the behavior of Dynamic Movement Primitives (DMPs). The dynamics of DMPs are analyzed through the framework of contraction theory as networked hierarchies of contracting or transversely contracting systems. Within this framework, sparsely-inhibited rhythmic DMPs (SI-RDMPs) are introduced to both inhibit or enable rhythmic primitives through spatially-sparse modification of the DMP dynamics. SI-RDMPs are demonstrated in experiments to manage start-stop transitions for walking experiments with the MIT Cheetah. New analytical results on the coupling of oscillators with diverse natural frequencies are also discussed.
Observing and controlling complex networks are of paramount interest for understanding complex physical, biological and technological systems. Recent studies have made important advances in identifying sensor or driver nodes, through which we can observe or control a complex system. Yet, the observational uncertainty induced by measurement noise and the energy required for control continue to be significant challenges in practical applications. Here we show that the variability of control energy and observational uncertainty for different directions of the state space depend strongly on the number of driver nodes. In particular, we find that if all nodes are directly driven, control is energetically feasible, as the maximum energy increases sublinearly with the system size. If, however, we aim to control a system through a single node, control in some directions is energetically prohibitive, increasing exponentially with the system size. For the cases in between, the maximum energy decays exponentially when the number of driver nodes increases. We validate our findings in several model and real networks, arriving to a series of fundamental laws to describe the control energy that together deepen our understanding of complex systems.
Analyzing signals arising from dynamical systems typically requires many modeling assumptions and parameter estimation. In high dimensions, this modeling is particularly difficult due to the "curse of dimensionality". In this paper, we propose a method for building an intrinsic representation of such signals in a purely data-driven manner. First, we apply a manifold learning technique, diffusion maps, to learn the intrinsic model of the latent variables of the dynamical system, solely from the measurements. Second, we use concepts and tools from control theory and build a linear contracting observer to estimate the latent variables in a sequential manner from new incoming measurements. The effectiveness of the presented framework is demonstrated by applying it to a toy problem and to a music analysis application. In these examples we show that our method reveals the intrinsic variables of the analyzed dynamical systems.
In many large systems, such as those encountered in biology or economics, the dynamics are nonlinear and are only known very coarsely. It is often the case, however, that the signs (excitation or inhibition) of individual interactions are known. This paper extends to nonlinear systems the classical criteria of linear sign stability introduced in the 70's, yielding simple sufficient conditions to determine stability using only the sign patterns of the interactions.
Quorum sensing is a decentralized biological process, through which a community of cells with no global awareness coordinate their functional behaviors based solely on cell-medium interactions and local decisions. This paper draws inspirations from quorum sensing and colony competition to derive a new algorithm for data clustering. The algorithm treats each data as a single cell, and uses knowledge of local connectivity to cluster cells into multiple colonies simultaneously. It simulates auto-inducers secretion in quorum sensing to tune the influence radius for each cell. At the same time, sparsely distributed core cells spread their influences to form colonies, and interactions between colonies eventually determine each cell's identity. The algorithm has the flexibility to analyze not only static but also time-varying data, which surpasses the capacity of many existing algorithms. Its stability and convergence properties are established. The algorithm is tested on several applications, including both synthetic and real benchmarks data sets, alleles clustering, community detection, image segmentation. In particular, the algorithm's distinctive capability to deal with time-varying data allows us to experiment it on novel applications such as robotic swarms grouping and switching model identification. We believe that the algorithm's promising performance would stimulate many more exciting applications.
Our ability to control complex systems is a fundamental challenge of contemporary science. Recently introduced tools to identify the driver nodes, nodes through which we can achieve full control, predict the existence of multiple control configurations, prompting us to classify each node in a network based on their role in control. Accordingly a node is critical, intermittent or redundant if it acts as a driver node in all, some or none of the control configurations. Here we develop an analytical framework to identify the category of each node, leading to the discovery of two distinct control modes in complex systems: centralized vs distributed control. We predict the control mode for an arbitrary network and show that one can alter it through small structural perturbations. The uncovered bimodality has implications from network security to organizational research and offers new insights into the dynamics and control of complex systems.
Network motifs are overrepresented interconnection patterns found in real-world networks. What functional advantages may they offer for building complex systems? We show that most network motifs emerge from interconnections patterns that best exploit the intrinsic stability characteristics of individual nodes. This feature is observed at different scales in a network, from nodes to modules, suggesting an efficient mechanism to stably build complex systems.
Controlling complex networked systems to a desired state is a key research goal in contemporary science. Despite recent advances in studying the impact of network topology on controllability, a comprehensive understanding of the synergistic effect of network topology and individual dynamics on controllability is still lacking. Here we offer a theoretical study with particular interest in the diversity of dynamic units characterized by different types of individual dynamics. Interestingly, we find a global symmetry accounting for the invariance of controllability with respect to exchanging the densities of any two different types of dynamic units, irrespective of the network topology. The highest controllability arises at the global symmetry point, at which different types of dynamic units are of the same density. The lowest controllability occurs when all self-loops are either completely absent or present with identical weights. These findings further improve our understanding of network controllability and have implications for devising the optimal control of complex networked systems in a wide range of fields.
To learn and reason in the presence of uncertainty, the brain must be capable of imposing some form of regularization. Here we suggest, through theoretical and computational arguments, that the combination of noise with synchronization provides a plausible mechanism for regularization in the nervous system. The functional role of regularization is considered in a general context in which coupled computational systems receive inputs corrupted by correlated noise. Noise on the inputs is shown to impose regularization, and when synchronization upstream induces time-varying correlations across noise variables, the degree of regularization can be calibrated over time. The proposed mechanism is explored first in the context of a simple associative learning problem, and then in the context of a hierarchical sensory coding task. The resulting qualitative behavior coincides with experimental data from visual cortex.
This work explores four nonlinear classical models of neural oscillators, the Hodgkin-Huxley model, the Fitzhugh-Nagumo model, the Morris-Lecar model, and the Hindmarsh-Rose model. Nonlinear contraction theory is used to develop observers and perform synchronization analysis on these systems. Neural oscillation and signaling models are based on the biological function of the neuron, with behavior mediated through the channeling of ions across the cell membrane. The variable assumed to be measured is the membrane potential, which may be obtained empirically through the use of a neuronal force-clamp system, or may be transmitted through the axon to other neurons. All other variables are estimated by using partial state or full state observers. Basic observer rate convergence analysis is performed for the Fitzhugh Nagumo system, partial state observer design is performed for the Morris-Lecar system, and basic synchronization analysis is performed for both the Fitzhugh-Nagumo and the Hodgkin-Huxley systems.
In order to bring contraction analysis into the very fruitful and topical fields of stochastic and Bayesian systems, we extend here the theory describes in \cite{Lohmiller98} to random differential equations. We propose new definitions of contraction (almost sure contraction and contraction in mean square) which allow to master the evolution of a stochastic system in two manners. The first one guarantees eventual exponential convergence of the system for almost all draws, whereas the other guarantees the exponential convergence in $L_2$ of to a unique trajectory. We then illustrate the relative simplicity of this extension by analyzing usual deterministic properties in the presence of noise. Specifically, we analyze stochastic gradient descent, impact of noise on oscillators synchronization and extensions of combination properties of contracting systems to the stochastic case. This is a first step towards combining the interesting and simplifying properties of contracting systems with the probabilistic approach.