arXiv subjects

Rodolphe Sepulchre

Publications and source records attributed to Rodolphe Sepulchre.

125 records · Page 7Linked to original sources

arXiv2013

Sensitivity analysis of circadian entrainment in the space of phase response curves

Sensitivity analysis is a classical and fundamental tool to evaluate the role of a given parameter in a given system characteristic. Because the phase response curve is a fundamental input--output characteristic of oscillators, we developed a sensitivity analysis for oscillator models in the space of phase response curves. The proposed tool can be applied to high-dimensional oscillator models without facing the curse of dimensionality obstacle associated with numerical exploration of the parameter space. Application of this tool to a state-of-the-art model of circadian rhythms suggests that it can be useful and instrumental to biological investigations.

math.DS↗

arXiv2013

Kick synchronization versus diffusive synchronization

The paper provides an introductory discussion about two fundamental models of oscillator synchronization: the (continuous-time) diffusive model, that dominates the mathematical literature on synchronization, and the (hybrid) kick model, that accounts for most popular examples of synchronization, but for which only few theoretical results exist. The paper stresses fundamental differences between the two models, such as the different contraction measures underlying the analysis, as well as important analogies that can be drawn in the limit of weak coupling.

eess.SY↗

arXiv2012

Rank-preserving geometric means of positive semi-definite matrices

The generalization of the geometric mean of positive scalars to positive definite matrices has attracted considerable attention since the seminal work of Ando. The paper generalizes this framework of matrix means by proposing the definition of a rank-preserving mean for two or an arbitrary number of positive semi-definite matrices of fixed rank. The proposed mean is shown to be geometric in that it satisfies all the expected properties of a rank-preserving geometric mean. The work is motivated by operations on low-rank approximations of positive definite matrices in high-dimensional spaces.

math.OC↗

arXiv2012

An anisotropy preserving metric for DTI processing

Statistical analysis of Diffusion Tensor Imaging (DTI) data requires a computational framework that is both numerically tractable (to account for the high dimensional nature of the data) and geometric (to account for the nonlinear nature of diffusion tensors). Building upon earlier studies that have shown that a Riemannian framework is appropriate to address these challenges, the present paper proposes a novel metric and an accompanying computational framework for DTI data processing. The proposed metric retains the geometry and the computational tractability of earlier methods grounded in the affine invariant metric. In addition, and in contrast to earlier methods, it provides an interpolation method which preserves anisotropy, a central information carried by diffusion tensor data.

cs.CV↗

arXiv2012

Contraction of monotone phase-coupled oscillators

This paper establishes a global contraction property for networks of phase-coupled oscillators characterized by a monotone coupling function. The contraction measure is a total variation distance. The contraction property determines the asymptotic behavior of the network, which is either finite-time synchronization or asymptotic convergence to a splay state.

math.DS↗

arXiv2012

Global analysis of a continuum model for monotone pulse-coupled oscillators

We consider a continuum of phase oscillators on the circle interacting through an impulsive instantaneous coupling. In contrast with previous studies on related pulse-coupled models, the stability results obtained in the continuum limit are global. For the nonlinear transport equation governing the evolution of the oscillators, we propose (under technical assumptions) a global Lyapunov function which is induced by a total variation distance between quantile densities. The monotone time evolution of the Lyapunov function completely characterizes the dichotomic behavior of the oscillators: either the oscillators converge in finite time to a synchronous state or they asymptotically converge to an asynchronous state uniformly spread on the circle. The results of the present paper apply to popular phase oscillators models (e.g. the well-known leaky integrate-and-fire model) and draw a strong parallel between the analysis of finite and infinite populations. In addition, they provide a novel approach for the (global) analysis of pulse-coupled oscillators.

math.AP↗

arXiv2012

An organizing center in a planar model of neuronal excitability

The paper studies the excitability properties of a generalized FitzHugh-Nagumo model. The model differs from the purely competitive FitzHugh-Nagumo model in that it accounts for the effect of cooperative gating variables such as activation of calcium currents. Excitability is explored by unfolding a pitchfork bifurcation that is shown to organize five different types of excitability. In addition to the three classical types of neuronal excitability, two novel types are described and distinctly associated to the presence of cooperative variables.

math.DS↗

arXiv2011

A Novel Phase Portrait to Understand Neuronal Excitability

Fifty years ago, Fitzugh introduced a phase portrait that became famous for a twofold reason: it captured in a physiological way the qualitative behavior of Hodgkin-Huxley model and it revealed the power of simple dynamical models to unfold complex firing patterns. To date, in spite of the enormous progresses in qualitative and quantitative neural modeling, this phase portrait has remained the core picture of neuronal excitability. Yet, a major difference between the neurophysiology of 1961 and of 2011 is the recognition of the prominent role of calcium channels in firing mechanisms. We show that including this extra current in Hodgkin-Huxley dynamics leads to a revision of Fitzugh-Nagumo phase portrait that affects in a fundamental way the reduced modeling of neural excitability. The revisited model considerably enlarges the modeling power of the original one. In particular, it captures essential electrophysiological signatures that otherwise require non-physiological alteration or considerable complexication of the classical model. As a basic illustration, the new model is shown to highlight a core dynamical mechanism by which the calcium conductance controls the two distinct firing modes of thalamocortical neurons.

math.DS↗

arXiv2011

Regression on fixed-rank positive semidefinite matrices: a Riemannian approach

The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space and on scalability to high-dimensional problems. The mathematical developments rely on the theory of gradient descent algorithms adapted to the Riemannian geometry that underlies the set of fixed-rank positive semidefinite matrices. In contrast with previous contributions in the literature, no restrictions are imposed on the range space of the learned matrix. The resulting algorithms maintain a linear complexity in the problem size and enjoy important invariance properties. We apply the proposed algorithms to the problem of learning a distance function parameterized by a positive semidefinite matrix. Good performance is observed on classical benchmarks.

cs.LG↗

arXiv2010

Consensus in non-commutative spaces

Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. Tsitsiklis Lyapunov function is shown to be the Hilbert distance to consensus in log coordinates. Birkhoff theorem, which proves contraction of the Hilbert metric for any positive homogeneous monotone map, provides an early yet general convergence result for consensus algorithms. Because Birkhoff theorem holds in arbitrary cones, we extend consensus algorithms to the cone of positive definite matrices. The proposed generalization finds applications in the convergence analysis of quantum stochastic maps, which are a generalization of stochastic maps to non-commutative probability spaces.

math.OC↗

arXiv2009

Riemannian Metric and Geometric Mean for Positive Semidefinite Matrices of Fixed Rank

This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric. The resulting Riemannian space has strong geometrical properties: it is geodesically complete, and the metric is invariant with respect to all transformations that preserve angles (orthogonal transformations, scalings, and pseudoinversion). A meaningful approximation of the associated Riemannian distance is proposed, that can be efficiently numerically computed via a simple algorithm based on SVD. The induced mean preserves the rank, possesses the most desirable characteristics of a geometric mean, and is easy to compute.

math.OC↗

arXiv2009

Synchronization on the circle

The goal of the present paper is to highlight the fundamental differences of so-called synchronization or consensus algorithms when the agents to synchronize evolve on a compact homogeneous manifold (like the circle, sphere or the group of rotation matrices), instead of a vector space. For the benefit of understanding, the discussion is restricted to the circle. First, a fundamental consensus algorithm on R^n is reviewed, from which continuous- and discrete-time synchronization algorithms on the circle are deduced by analogy. It is shown how they are connected to Kuramoto and Vicsek models from the literature. Their convergence properties are similar to vector spaces only for specific graphs or if the agents are all located within a semicircle. Examples are proposed to illustrate several other possible behaviors. Finally, new algorithms are proposed to recover (almost-)global synchronization properties.

math.OC↗

arXiv2008

Generalized power method for sparse principal component analysis

In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if the data matrix has many more columns (variables) than rows. We then propose and analyze a simple gradient method suited for the task. It appears that our algorithm has best convergence properties in the case when either the objective function or the feasible set are strongly convex, which is the case with our single-unit formulations and can be enforced in the block case. Finally, we demonstrate numerically on a set of random and gene expression test problems that our approach outperforms existing algorithms both in quality of the obtained solution and in computational speed.

math.OC↗

arXiv2008

Consensus optimization on manifolds

The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost function. This leads to efficient gradient algorithms to synchronize (i.e. maximizing the consensus) or balance (i.e. minimizing the consensus) the agents; a convenient adaptation of the gradient algorithms is used when the communication graph is directed and time-varying. The cost function is linked to a specific centroid definition on manifolds, introduced here as the induced arithmetic mean, that is easily computable in closed form and may be of independent interest for a number of manifolds. The special orthogonal group SO(n) and the Grassmann manifold Gr(p,n) are treated as original examples. A link is also drawn with the many existing results on the circle.

math.OC↗

arXiv2008

Coordinated motion design on Lie groups

The present paper proposes a unified geometric framework for coordinated motion on Lie groups. It first gives a general problem formulation and analyzes ensuing conditions for coordinated motion. Then, it introduces a precise method to design control laws in fully actuated and underactuated settings with simple integrator dynamics. It thereby shows that coordination can be studied in a systematic way once the Lie group geometry of the configuration space is well characterized. This allows among others to retrieve control laws in the literature for particular examples. A link with Brockett's double bracket flows is also made. The concepts are illustrated on SO(3), SE(2) and SE(3).

math.OC↗

arXiv2008

Stabilization of Three-Dimensional Collective Motion

This paper proposes a methodology to stabilize relative equilibria in a model of identical, steered particles moving in three-dimensional Euclidean space. Exploiting the Lie group structure of the resulting dynamical system, the stabilization problem is reduced to a consensus problem on the Lie algebra. The resulting equilibria correspond to parallel, circular and helical formations. We first derive the stabilizing control laws in the presence of all-to-all communication. Providing each agent with a consensus estimator, we then extend the results to a general setting that allows for unidirectional and time-varying communication topologies.

math.OC↗

arXiv2008

Synchronization in Networks of Identical Linear Systems

The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main result is the construction of a dynamic output feedback coupling that achieves synchronization if the decoupled systems have no exponentially unstable mode and if the communication graph is uniformly connected. The result can be interpreted as a generalization of classical consensus algorithms. Stronger conditions are shown to be sufficient but to some extent, also necessary to ensure synchronization with the diffusive static output coupling often considered in the literature.

math.OC↗