arXiv subjects

Olivier Faugeras

Publications and source records attributed to Olivier Faugeras.

At least 19 recordsLinked to original sources

arXiv2025

Universality of the mean-field equations of networks of Hopfield-like neurons

We revisit the problem of characterising the mean-field limit of a network of Hopfield-like neurons. Building on the previous works of Ben Arous and Guionnet we establish for a large class of networks of Hopfield-like neurons, i.e. rate neurons, the mean-field equations on a time interval $[0,\,T]$, $T>0$, of the thermodynamic limit of these networks, i.e. the limit when the number of neurons goes to infinity. Here, we do not assume that the synaptic weights describing the connections between the neurons are i.i.d. as zero-mean Gaussians. The limit equations are stochastic and very simply described in terms of two functions, a ``correlation'' function noted $K_Q(t,\,s)$ and a ``mean'' function noted $m_Q(t)$. The ``noise'' part of the equations is a linear function of the Brownian motion, which is obtained by solving a Volterra equation of the second kind whose resolving kernel is expressed as a function of $K_Q$. We give a constructive proof of the uniqueness of the limit equations. We use the corresponding algorithm for an effective computation of the functions $K_Q$ and $m_Q$, given the weights distribution. Several numerical experiments are reported.

math.PR↗

arXiv2020

Asymptotic behavior of a network of neurons with random linear interactions

We study the asymptotic behavior for asymmetric neuronal dynamics in a network of linear Hopfield neurons. The interaction between the neurons is modeled by random couplings which are centered i.i.d. random variables with finite moments of all orders. We prove that if the initial condition of the network is a set of i.i.d. random variables and independent of the synaptic weights, each component of the limit system is described as the sum of the corresponding coordinate of the initial condition with a centered Gaussian process whose covariance function can be described in terms of a modified Bessel function. This process is not Markovian. The convergence is in law almost surely with respect to the random weights. Our method is essentially based on the method of moments to obtain a Central Limit Theorem.

math.PR↗

arXiv2019

A neural field model for color perception unifying assimilation and contrast

We address the question of color-space interactions in the brain, by proposing a neural field model of color perception with spatial context for the visual area V1 of the cortex. Our framework reconciles two opposing perceptual phenomena, known as simultaneous contrast and chromatic assimilation. They have been previously shown to act synergistically, so that at some point in an image, the color seems perceptually more similar to that of adjacent neighbors, while being more dissimilar from that of remote ones. Thus, their combined effects are enhanced in the presence of a spatial pattern, and can be measured as larger shifts in color matching experiments. Our model supposes a hypercolumnar structure coding for colors in V1, and relies on the notion of color opponency introduced by Hering. The connectivity kernel of the neural field exploits the balance between attraction and repulsion in color and physical spaces, so as to reproduce the sign reversal in the influence of neighboring points. The color sensation at a point, defined from a steady state of the neural activities, is then extracted as a nonlinear percept conveyed by an assembly of neurons. It connects the cortical and perceptual levels, because we describe the search for a color match in asymmetric matching experiments as a mathematical projection on color sensations. We validate our color neural field alongside this color matching framework, by performing a multi-parameter regression to data produced by psychophysicists and ourselves. All the results show that we are able to explain the nonlinear behavior of shifts observed along one or two dimensions in color space, which cannot be done using a simple linear model.

q-bio.NC↗

arXiv2019

The meanfield limit of a network of Hopfield neurons with correlated synaptic weights

We study the asymptotic behaviour for asymmetric neuronal dynamics in a network of Hopfield neurons. The randomness in the network is modelled by random couplings which are centered Gaussian correlated random variables. We prove that the annealed law of the empirical measure satisfies a large deviation principle without any condition on time. We prove that the good rate function of this large deviation principle achieves its minimum value at a unique Gaussian measure which is not Markovian. This implies almost sure convergence of the empirical measure under the quenched law. We prove that the limit equations are expressed as an infinite countable set of linear non Markovian SDEs.

math.PR↗

arXiv2016

Large Deviations of a Spatially-Stationary Network of Interacting Neurons

In this work we determine a process-level Large Deviation Principle (LDP) for a model of interacting neurons indexed by a lattice $\mathbb{Z}^d$. The neurons are subject to noise, which is modelled as a correlated martingale. The probability law governing the noise is strictly stationary, and we are therefore able to find a LDP for the probability laws $Π^n$ governing the stationary empirical measure $\hatμ^n$ generated by the neurons in a cube of length $(2n+1)$. We use this LDP to determine an LDP for the neural network model. The connection weights between the neurons evolve according to a learning rule / neuronal plasticity, and these results are adaptable to a large variety of neural network models. This LDP is of great use in the mathematical modelling of neural networks, because it allows a quantification of the likelihood of the system deviating from its limit, and also a determination of which direction the system is likely to deviate. The work is also of interest because there are nontrivial correlations between the neurons even in the asymptotic limit, thereby presenting itself as a generalisation of traditional mean-field models.

math.PR↗

arXiv2015

On the Hamiltonian structure of large deviations in stochastic hybrid systems

We develop the connection between large deviation theory and more applied approaches to stochastic hybrid systems by highlighting a common underlying Hamiltonian structure. A stochastic hybrid system involves the coupling between a piecewise deterministic dynamical system in $R^d$ and a time-homogeneous Markov chain on some discrete space $Γ$. We assume that the Markov chain on $Γ$ is ergodic, and that the discrete dynamics is much faster than the piecewise deterministic dynamics (separation of time-scales). Using the Perron-Frobenius theorem and the calculus-of-variations, we evaluate the rate function of a large deviation principle in terms of a classical action, whose Hamiltonian is given by the Perron eigenvalue of a $|Γ|$-dimensional linear equation. The corresponding linear operator depends on the transition rates of the Markov chain and the nonlinear functions of the piecewise deterministic system. The resulting Hamiltonian is identical to one derived using path-integrals and WKB methods. We illustrate the theory by considering the example of stochastic ion channels.

math.PR↗

arXiv2015

Clarification and complement to "Mean-field description and propagation of chaos in networks of Hodgkin-Huxley and FitzHugh-Nagumo neurons"

In this note, we clarify the well-posedness of the limit equations to the mean-field $N$-neuron models proposed in Baladron et al. and we prove the associated propagation of chaos property. We also complete the modeling issue in Baladron et al. by discussing the well-posedness of the stochastic differential equations which govern the behavior of the ion channels and the amount of available neurotransmitters.

math.PR↗

arXiv2015

Noise-induced behaviors in neural mean field dynamics

The collective behavior of cortical neurons is strongly affected by the presence of noise at the level of individual cells. In order to study these phenomena in large-scale assemblies of neurons, we consider networks of firing-rate neurons with linear intrinsic dynamics and nonlinear coupling, belonging to a few types of cell populations and receiving noisy currents. Asymptotic equations as the number of neurons tends to infinity (mean field equations) are rigorously derived based on a probabilistic approach. These equations are implicit on the probability distribution of the solutions which generally makes their direct analysis difficult. However, in our case, the solutions are Gaussian, and their moments satisfy a closed system of nonlinear ordinary differential equations (ODEs), which are much easier to study than the original stochastic network equations, and the statistics of the empirical process uniformly converge towards the solutions of these ODEs. Based on this description, we analytically and numerically study the influence of noise on the collective behaviors, and compare these asymptotic regimes to simulations of the network. We observe that the mean field equations provide an accurate description of the solutions of the network equations for network sizes as small as a few hundreds of neurons. In particular, we observe that the level of noise in the system qualitatively modifies its collective behavior, producing for instance synchronized oscillations of the whole network, desynchronization of oscillating regimes, and stabilization or destabilization of stationary solutions. These results shed a new light on the role of noise in shaping collective dynamics of neurons, and gives us clues for understanding similar phenomena observed in biological networks.

math.DS↗

arXiv2014

Asymptotic description of stochastic neural networks. I - existence of a Large Deviation Principle

We study the asymptotic law of a network of interacting neurons when the number of neurons becomes infinite. The dynamics of the neurons is described by a set of stochastic differential equations in discrete time. The neurons interact through the synaptic weights which are Gaussian correlated random variables. We describe the asymptotic law of the network when the number of neurons goes to infinity. Unlike previous works which made the biologically unrealistic assumption that the weights were i.i.d. random variables, we assume that they are correlated. We introduce the process-level empirical measure of the trajectories of the solutions to the equations of the finite network of neurons and the averaged law (with respect to the synaptic weights) of the trajectories of the solutions to the equations of the network of neurons. The result is that the image law through the empirical measure satisfies a large deviation principle with a good rate function. We provide an analytical expression of this rate function in terms of the spectral representation of certain Gaussian processes.

math.PR↗

arXiv2014

Asymptotic description of stochastic neural networks. II - Characterization of the limit law

We continue the development, started in of the asymptotic description of certain stochastic neural networks. We use the Large Deviation Principle (LDP) and the good rate function H announced there to prove that H has a unique minimum mu_e, a stationary measure on the set of trajectories. We characterize this measure by its two marginals, at time 0, and from time 1 to T. The second marginal is a stationary Gaussian measure. With an eye on applications, we show that its mean and covariance operator can be inductively computed. Finally we use the LDP to establish various convergence results, averaged and quenched.

math.PR↗

arXiv2014

On the form of the relative entropy between measures on the space of continuous functions

In this paper we derive an integral (with respect to time) representation of the relative entropy (or Kullback-Leibler Divergence) between measures mu and P on the space of continuous functions from time 0 to T. The underlying measure P is a weak solution to a Martingale Problem with continuous coefficients. Since the relative entropy governs the exponential rate of convergence of the empirical measure (according to Sanov's Theorem), this representation is of use in the numerical and analytical investigation of finite-size effects in systems of interacting diffusions.

math.PR↗

arXiv2013

Asymptotic description of neural networks with correlated synaptic weights

We study the asymptotic law of a network of interacting neurons when the number of neurons becomes infinite. Given a completely connected network of neurons in which the synaptic weights are Gaussian correlated random variables, we describe the asymptotic law of the network when the number of neurons goes to infinity. We introduce the process-level empirical measure of the trajectories of the solutions to the equations of the finite network of neurons and the averaged law (with respect to the synaptic weights) of the trajectories of the solutions to the equations of the network of neurons. The main result of this article is that the image law through the empirical measure satisfies a large deviation principle with a good rate function which is shown to have a unique global minimum. Our analysis of the rate function allows us also to characterize the limit measure as the image of a stationary Gaussian measure defined on a transformed set of trajectories.

math.PR↗

arXiv2013

Stochastic neural field equations: A rigorous footing

We extend the theory of neural fields which has been developed in a deterministic framework by considering the influence spatio-temporal noise. The outstanding problem that we here address is the development of a theory that gives rigorous meaning to stochastic neural field equations, and conditions ensuring that they are well-posed. Previous investigations in the field of computational and mathematical neuroscience have been numerical for the most part. Such questions have been considered for a long time in the theory of stochastic partial differential equations, where at least two different approaches have been developed, each having its advantages and disadvantages. It turns out that both approaches have also been used in computational and mathematical neuroscience, but with much less emphasis on the underlying theory. We present a review of two existing theories and show how they can be used to put the theory of stochastic neural fields on a rigorous footing. We also provide general conditions on the parameters of the stochastic neural field equations under which we guarantee that these equations are well-posed. In so doing we relate each approach to previous work in computational and mathematical neuroscience. We hope this will provide a reference that will pave the way for future studies (both theoretical and applied) of these equations, where basic questions of existence and uniqueness will no longer be a cause for concern.

math.PR↗

arXiv2013

A large deviation principle for networks of rate neurons with correlated synaptic weights

We study the asymptotic law of a network of interacting neurons when the number of neurons becomes infinite. Given a completely connected network of firing rate neurons in which the synaptic weights are Gaussian correlated random variables, we describe the asymptotic law of the network when the number of neurons goes to infinity. We introduce the process-level empirical measure of the trajectories of the solutions to the equations of the finite network of neurons and the averaged law (with respect to the synaptic weights) of the trajectories of the solutions to the equations of the network of neurons. The main result of this article is that the image law through the empirical measure satisfies a large deviation principle with a good rate function which is shown to have a unique global minimum. Our analysis of the rate function allows us also to characterize the limit measure as the image of a stationary Gaussian measure defined on a transformed set of trajectories. This is potentially very useful for applications in neuroscience since the Gaussian measure can be completely characterized by its mean and spectral density. It also facilitates the assessment of the probability of finite-size effects.

math.PR↗

arXiv2011

Mean Field description of and propagation of chaos in recurrent multipopulation networks of Hodgkin-Huxley and Fitzhugh-Nagumo neurons

We derive the mean-field equations arising as the limit of a network of interacting spiking neurons, as the number of neurons goes to infinity. The neurons belong to a fixed number of populations and are represented either by the Hodgkin-Huxley model or by one of its simplified version, the Fitzhugh-Nagumo model. The synapses between neurons are either electrical or chemical. The network is assumed to be fully connected. The maximum conductances vary randomly. Under the condition that all neurons initial conditions are drawn independently from the same law that depends only on the population they belong to, we prove that a propagation of chaos phenomenon takes places, namely that in the mean-field limit, any finite number of neurons become independent and, within each population, have the same probability distribution. This probability distribution is solution of a set of implicit equations, either nonlinear stochastic differential equations resembling the McKean-Vlasov equations, or non-local partial differential equations resembling the McKean-Vlasov-Fokker- Planck equations. We prove the well-posedness of these equations, i.e. the existence and uniqueness of a solution. We also show the results of some preliminary numerical experiments that indicate that the mean-field equations are a good representation of the mean activity of a finite size network, even for modest sizes. These experiment also indicate that the McKean-Vlasov-Fokker- Planck equations may be a good way to understand the mean-field dynamics through, e.g., a bifurcation analysis.

q-bio.NC↗

arXiv2011

A Markovian event-based framework for stochastic spiking neural networks

In spiking neural networks, the information is conveyed by the spike times, that depend on the intrinsic dynamics of each neuron, the input they receive and on the connections between neurons. In this article we study the Markovian nature of the sequence of spike times in stochastic neural networks, and in particular the ability to deduce from a spike train the next spike time, and therefore produce a description of the network activity only based on the spike times regardless of the membrane potential process. To study this question in a rigorous manner, we introduce and study an event-based description of networks of noisy integrate-and-fire neurons, i.e. that is based on the computation of the spike times. We show that the firing times of the neurons in the networks constitute a Markov chain, whose transition probability is related to the probability distribution of the interspike interval of the neurons in the network. In the cases where the Markovian model can be developed, the transition probability is explicitly derived in such classical cases of neural networks as the linear integrate-and-fire neuron models with excitatory and inhibitory interactions, for different types of synapses, possibly featuring noisy synaptic integration, transmission delays and absolute and relative refractory period. This covers most of the cases that have been investigated in the event-based description of spiking deterministic neural networks.

stat.AP↗

arXiv2010

Illusions in the Ring Model of visual orientation selectivity

The Ring Model of orientation tuning is a dynamical model of a hypercolumn of visual area V1 in the human neocortex that has been designed to account for the experimentally observed orientation tuning curves by local, i.e., cortico-cortical computations. The tuning curves are stationary, i.e. time independent, solutions of this dynamical model. One important assumption underlying the Ring Model is that the LGN input to V1 is weakly tuned to the retinal orientation and that it is the local computations in V1 that sharpen this tuning. Because the equations that describe the Ring Model have built-in equivariance properties in the synaptic weight distribution with respect to a particular group acting on the retinal orientation of the stimulus, the model in effect encodes an infinite number of tuning curves that are arbitrarily translated with respect to each other. By using the Orbit Space Reduction technique we rewrite the model equations in canonical form as functions of polynomials that are invariant with respect to the action of this group. This allows us to combine equivariant bifurcation theory with an efficient numerical continuation method in order to compute the tuning curves predicted by the Ring Model. Surprisingly some of these tuning curves are not tuned to the stimulus. We interpret them as neural illusions and show numerically how they can be induced by simple dynamical stimuli. These neural illusions are important biological predictions of the model. If they could be observed experimentally this would be a strong point in favour of the Ring Model. We also show how our theoretical analysis allows to very simply specify the ranges of the model parameters by comparing the model predictions with published experimental observations.

math.DS↗

arXiv2010

Bifurcation of hyperbolic planforms

Motivated by a model for the perception of textures by the visual cortex in primates, we analyse the bifurcation of periodic patterns for nonlinear equations describing the state of a system defined on the space of structure tensors, when these equations are further invariant with respect to the isometries of this space. We show that the problem reduces to a bifurcation problem in the hyperbolic plane D (Poincaré disc). We make use of the concept of periodic lattice in D to further reduce the problem to one on a compact Riemann surface D/T, where T is a cocompact, torsion-free Fuchsian group. The knowledge of the symmetry group of this surface allows to carry out the machinery of equivariant bifurcation theory. Solutions which generically bifurcate are called "H-planforms", by analogy with the "planforms" introduced for pattern formation in Euclidean space. This concept is applied to the case of an octagonal periodic pattern, where we are able to classify all possible H-planforms satisfying the hypotheses of the Equivariant Branching Lemma. These patterns are however not straightforward to compute, even numerically, and in the last section we describe a method for computation illustrated with a selection of images of octagonal H-planforms.

math.DS↗