Etienne Tanré
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Etienne Tanré has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Alexandre Richard
Université Paris-Saclay, CentraleSupélec and CNRS FR-3487, Gif-sur-Yvette, France
7 shared publications - François Delarue
Laboratoire J.-A. Dieudonné, Université Côte d’Azur, Cedex 02, France
3 shared publications - Giulia Mezzadri
Centre Borelli, École Normale Supérieure Paris-Saclay, 91190 Gif-sur-Yvette, France
3 shared publications - Olivier Faugeras
INRIA Sophia Antipolis Mediterannee, 2004 Route Des Lucioles, Sophia Antipolis, 06410, France
3 shared publications - Patricia Reynaud-Bouret
Laboratoire J. A. Dieudonné, CNRS, Université Côte d'Azur, Nice, France
3 shared publications - Awa Diop
INRIA, Projet OMEGA, 2004 Route des Lucioles, BP93, 06902 Sophia-Antipolis, France
2 shared publications
Latest Publications
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (2) , 024405
Mean-field analysis of a neural network with stochastic spike-timing-dependent plasticity
Synaptic plasticity is the biological foundation of learning and memory and a key inspiration for efficient, spike-based neuromorphic computing. In both contexts, spike-timing-dependent plasticity (STDP) is a crucial adaptive rule. However, while analytical tools exist for spiking networks with fixed connections, they fail when STDP is introduced, creating a long-standing theoretical impasse. In this work, we demonstrate how mean-field theory can successfully bridge this gap. We derive the first McKean-Vlasov mean-field limit for a network of stochastic spiking units with discrete-state STDP synapses, providing a rigorous, low-dimensional description of a system previously considered analytically intractable due to strong heterogeneity and adaptive couplings. While motivated by neuroscience-introducing plasticity into a stochastic Wilson-Cowan model-our framework establishes a general theoretical tool for studying the collective dynamics of large systems of interacting spiking (as opposed to rate-based) units with adaptation. This result provides a new methodological avenue in statistical physics for analyzing a wide class of complex systems with plastic interactions.
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (2) , 024405
Mean-field analysis of a neural network with stochastic spike-timing-dependent plasticity
Synaptic plasticity is the biological foundation of learning and memory and a key inspiration for efficient, spike-based neuromorphic computing. In both contexts, spike-timing-dependent plasticity (STDP) is a crucial adaptive rule. However, while analytical tools exist for spiking networks with fixed connections, they fail when STDP is introduced, creating a long-standing theoretical impasse. In this work, we demonstrate how mean-field theory can successfully bridge this gap. We derive the first McKean-Vlasov mean-field limit for a network of stochastic spiking units with discrete-state STDP synapses, providing a rigorous, low-dimensional description of a system previously considered analytically intractable due to strong heterogeneity and adaptive couplings. While motivated by neuroscience-introducing plasticity into a stochastic Wilson-Cowan model-our framework establishes a general theoretical tool for studying the collective dynamics of large systems of interacting spiking (as opposed to rate-based) units with adaptation. This result provides a new methodological avenue in statistical physics for analyzing a wide class of complex systems with plastic interactions.
- Open Access
- 12 June 2026
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 93 (1)
Spiking neural models for decision-making tasks with learning
In cognition, response times and choices in decision-making tasks are commonly modeled using Drift Diffusion Models (DDMs), which describe the accumulation of evidence for a decision as a stochastic process, specifically a Brownian motion, with the drift rate reflecting the strength of the evidence. In the same vein, the Poisson counter model describes the accumulation of evidence as discrete events whose counts over time are modeled as Poisson processes. This model has a spiking neurons interpretation as these processes are used to model neuronal activities. However, these models lack a learning mechanism and are limited to tasks where participants have prior knowledge of the categories. To bridge the gap between cognitive and biological models, we propose a biologically plausible Spiking Neural Network (SNN) model for decision-making that incorporates a learning mechanism and whose neurons activities are modeled by a multivariate Hawkes process. First, we show a coupling result between the DDM and the Poisson counter model, establishing that these two models provide similar categorizations and reaction times and that the DDM can be approximated by spiking Poisson neurons. To go further, we show that a particular DDM with correlated noise can be derived from a Hawkes network of spiking neurons governed by a local learning rule. In addition, we designed an online categorization task to evaluate the model predictions. This work provides a significant step toward integrating biologically relevant neural mechanisms into cognitive models, fostering a deeper understanding of the relationship between neural activity and behavior.
- 12 June 2026
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 93 (1)
Open AccessSpiking neural models for decision-making tasks with learning
In cognition, response times and choices in decision-making tasks are commonly modeled using Drift Diffusion Models (DDMs), which describe the accumulation of evidence for a decision as a stochastic process, specifically a Brownian motion, with the drift rate reflecting the strength of the evidence. In the same vein, the Poisson counter model describes the accumulation of evidence as discrete events whose counts over time are modeled as Poisson processes. This model has a spiking neurons interpretation as these processes are used to model neuronal activities. However, these models lack a learning mechanism and are limited to tasks where participants have prior knowledge of the categories. To bridge the gap between cognitive and biological models, we propose a biologically plausible Spiking Neural Network (SNN) model for decision-making that incorporates a learning mechanism and whose neurons activities are modeled by a multivariate Hawkes process. First, we show a coupling result between the DDM and the Poisson counter model, establishing that these two models provide similar categorizations and reaction times and that the DDM can be approximated by spiking Poisson neurons. To go further, we show that a particular DDM with correlated noise can be derived from a Hawkes network of spiking neurons governed by a local learning rule. In addition, we designed an online categorization task to evaluate the model predictions. This work provides a significant step toward integrating biologically relevant neural mechanisms into cognitive models, fostering a deeper understanding of the relationship between neural activity and behavior.
- 18 September 2025
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 91 (4) , 1-51
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.- 18 September 2025
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 91 (4) , 1-51
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.- Open Access
On the density of singular SDEs with fractional noise and applications to McKean-Vlasov equations
We investigate properties of the (conditional) law of the solution to SDEs driven by fractional Brownian noise with a singular, possibly distributional, drift. Our results on the law are twofold: i) we quantify the spatial regularity of the law, while keeping track of integrability in time, and ii) we prove that it has a density with Gaussian tails. Then the former result is used to establish novel results on existence and uniqueness of solutions to McKean-Vlasov equations of convolutional type.
Open AccessOn the density of singular SDEs with fractional noise and applications to McKean-Vlasov equations
We investigate properties of the (conditional) law of the solution to SDEs driven by fractional Brownian noise with a singular, possibly distributional, drift. Our results on the law are twofold: i) we quantify the spatial regularity of the law, while keeping track of integrability in time, and ii) we prove that it has a density with Gaussian tails. Then the former result is used to establish novel results on existence and uniqueness of solutions to McKean-Vlasov equations of convolutional type.
- Open Access
Spiking Neural Models for Decision-Making Tasks with Learning
In cognition, response times and choices in decision-making tasks are commonly modeled using Drift Diffusion Models (DDMs), which describe the accumulation of evidence for a decision as a stochastic process, specifically a Brownian motion, with the drift rate reflecting the strength of the evidence. In the same vein, the Poisson counter model describes the accumulation of evidence as discrete events whose counts over time are modeled as Poisson processes, and has a spiking neurons interpretation as these processes are used to model neuronal activities. However, these models lack a learning mechanism and are limited to tasks where participants have prior knowledge of the categories. To bridge the gap between cognitive and biological models, we propose a biologically plausible Spiking Neural Network (SNN) model for decision-making that incorporates a learning mechanism and whose neurons activities are modeled by a multivariate Hawkes process. First, we show a coupling result between the DDM and the Poisson counter model, establishing that these two models provide similar categorizations and reaction times and that the DDM can be approximated by spiking Poisson neurons. To go further, we show that a particular DDM with correlated noise can be derived from a Hawkes network of spiking neurons governed by a local learning rule. In addition, we designed an online categorization task to evaluate the model predictions. This work provides a significant step toward integrating biologically relevant neural mechanisms into cognitive models, fostering a deeper understanding of the relationship between neural activity and behavior.
Open AccessSpiking Neural Models for Decision-Making Tasks with Learning
In cognition, response times and choices in decision-making tasks are commonly modeled using Drift Diffusion Models (DDMs), which describe the accumulation of evidence for a decision as a stochastic process, specifically a Brownian motion, with the drift rate reflecting the strength of the evidence. In the same vein, the Poisson counter model describes the accumulation of evidence as discrete events whose counts over time are modeled as Poisson processes, and has a spiking neurons interpretation as these processes are used to model neuronal activities. However, these models lack a learning mechanism and are limited to tasks where participants have prior knowledge of the categories. To bridge the gap between cognitive and biological models, we propose a biologically plausible Spiking Neural Network (SNN) model for decision-making that incorporates a learning mechanism and whose neurons activities are modeled by a multivariate Hawkes process. First, we show a coupling result between the DDM and the Poisson counter model, establishing that these two models provide similar categorizations and reaction times and that the DDM can be approximated by spiking Poisson neurons. To go further, we show that a particular DDM with correlated noise can be derived from a Hawkes network of spiking neurons governed by a local learning rule. In addition, we designed an online categorization task to evaluate the model predictions. This work provides a significant step toward integrating biologically relevant neural mechanisms into cognitive models, fostering a deeper understanding of the relationship between neural activity and behavior.
- Open Access
Spiking Neural Models for Decision-Making Tasks with Learning
In cognition, response times and choices in decision-making tasks are commonly modeled using Drift Diffusion Models (DDMs), which describe the accumulation of evidence for a decision as a stochastic process, specifically a Brownian motion, with the drift rate reflecting the strength of the evidence. In the same vein, the Poisson counter model describes the accumulation of evidence as discrete events whose counts over time are modeled as Poisson processes, and has a spiking neurons interpretation as these processes are used to model neuronal activities. However, these models lack a learning mechanism and are limited to tasks where participants have prior knowledge of the categories. To bridge the gap between cognitive and biological models, we propose a biologically plausible Spiking Neural Network (SNN) model for decision-making that incorporates a learning mechanism and whose neurons activities are modeled by a multivariate Hawkes process. First, we show a coupling result between the DDM and the Poisson counter model, establishing that these two models provide similar categorizations and reaction times and that the DDM can be approximated by spiking Poisson neurons. To go further, we show that a particular DDM with correlated noise can be derived from a Hawkes network of spiking neurons governed by a local learning rule. In addition, we designed an online categorization task to evaluate the model predictions. This work provides a significant step toward integrating biologically relevant neural mechanisms into cognitive models, fostering a deeper understanding of the relationship between neural activity and behavior.
Open AccessSpiking Neural Models for Decision-Making Tasks with Learning
In cognition, response times and choices in decision-making tasks are commonly modeled using Drift Diffusion Models (DDMs), which describe the accumulation of evidence for a decision as a stochastic process, specifically a Brownian motion, with the drift rate reflecting the strength of the evidence. In the same vein, the Poisson counter model describes the accumulation of evidence as discrete events whose counts over time are modeled as Poisson processes, and has a spiking neurons interpretation as these processes are used to model neuronal activities. However, these models lack a learning mechanism and are limited to tasks where participants have prior knowledge of the categories. To bridge the gap between cognitive and biological models, we propose a biologically plausible Spiking Neural Network (SNN) model for decision-making that incorporates a learning mechanism and whose neurons activities are modeled by a multivariate Hawkes process. First, we show a coupling result between the DDM and the Poisson counter model, establishing that these two models provide similar categorizations and reaction times and that the DDM can be approximated by spiking Poisson neurons. To go further, we show that a particular DDM with correlated noise can be derived from a Hawkes network of spiking neurons governed by a local learning rule. In addition, we designed an online categorization task to evaluate the model predictions. This work provides a significant step toward integrating biologically relevant neural mechanisms into cognitive models, fostering a deeper understanding of the relationship between neural activity and behavior.
- 18 April 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 63 (2) , 1286-1313
Brownian Particles Controlled by Their Occupation Measure
In this article, we study a finite horizon linear-quadratic stochastic control problem for Brownian particles where the cost functions depend on the state and the occupation measure of the particles. To address this problem, we develop an Itô formula for the flow of occupation measure which enables us to derive the associated HJB equation. Then, thanks to a Feynman–Kac formula and the Boué–Dupuis formula [Boué and Dupuis, Ann. Probab., 26 (1998), pp. 1641–1659], we construct an optimal strategy and an optimal trajectory. Finally, we illustrate our result when the cost function is the volume of the “sausage” associated to the particles.
- 18 April 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 63 (2) , 1286-1313
Brownian Particles Controlled by Their Occupation Measure
In this article, we study a finite horizon linear-quadratic stochastic control problem for Brownian particles where the cost functions depend on the state and the occupation measure of the particles. To address this problem, we develop an Itô formula for the flow of occupation measure which enables us to derive the associated HJB equation. Then, thanks to a Feynman–Kac formula and the Boué–Dupuis formula [Boué and Dupuis, Ann. Probab., 26 (1998), pp. 1641–1659], we construct an optimal strategy and an optimal trajectory. Finally, we illustrate our result when the cost function is the volume of the “sausage” associated to the particles.
- Open Access
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 work of \cite{guionnet:95,ben-arous-guionnet:95,guionnet:97} and \cite{dembo_universality_2021} 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. Unlike all previous work, except \cite{dembo_universality_2021}, 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.Open AccessUniversality 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 work of \cite{guionnet:95,ben-arous-guionnet:95,guionnet:97} and \cite{dembo_universality_2021} 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. Unlike all previous work, except \cite{dembo_universality_2021}, 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. - Open Access
Ergodicity of some stochastic Fokker-Planck equations with additive common noise
In this paper we consider stochastic Fokker-Planck Partial Differential Equations (PDEs), obtained as the mean-field limit of weakly interacting particle systems subjected to both independent (or idiosyncratic) and common Brownian noises. We provide sufficient conditions under which the deterministic counterpart of the Fokker-Planck equation, which corresponds to particle systems that are just subjected to independent noises, has several invariant measures, but for which the stochastic version admits a unique invariant measure under the presence of the additive common noise. The very difficulty comes from the fact that the common noise is just of finite dimension while the state variable, which should be seen as the conditional marginal law of the system given the common noise, lives in a space of infinite dimension. In this context, our result holds true if, in addition to standard confining properties, the mean field interaction term forces the system to be attracted by its conditional mean given the common noise and the intensity of the idiosyncratic noise is small.
Open AccessErgodicity of some stochastic Fokker-Planck equations with additive common noise
In this paper we consider stochastic Fokker-Planck Partial Differential Equations (PDEs), obtained as the mean-field limit of weakly interacting particle systems subjected to both independent (or idiosyncratic) and common Brownian noises. We provide sufficient conditions under which the deterministic counterpart of the Fokker-Planck equation, which corresponds to particle systems that are just subjected to independent noises, has several invariant measures, but for which the stochastic version admits a unique invariant measure under the presence of the additive common noise. The very difficulty comes from the fact that the common noise is just of finite dimension while the state variable, which should be seen as the conditional marginal law of the system given the common noise, lives in a space of infinite dimension. In this context, our result holds true if, in addition to standard confining properties, the mean field interaction term forces the system to be attracted by its conditional mean given the common noise and the intensity of the idiosyncratic noise is small.
- Open Access
Ergodicity of some stochastic Fokker-Planck equations with additive common noise
In this paper we consider stochastic Fokker-Planck Partial Differential Equations (PDEs), obtained as the mean-field limit of weakly interacting particle systems subjected to both independent (or idiosyncratic) and common Brownian noises. We provide sufficient conditions under which the deterministic counterpart of the Fokker-Planck equation, which corresponds to particle systems that are just subjected to independent noises, has several invariant measures, but for which the stochastic version admits a unique invariant measure under the presence of the additive common noise. The very difficulty comes from the fact that the common noise is just of finite dimension while the state variable, which should be seen as the conditional marginal law of the system given the common noise, lives in a space of infinite dimension. In this context, our result holds true if, in addition to standard confining properties, the mean field interaction term forces the system to be attracted by its conditional mean given the common noise and the intensity of the idiosyncratic noise is small.
Open AccessErgodicity of some stochastic Fokker-Planck equations with additive common noise
In this paper we consider stochastic Fokker-Planck Partial Differential Equations (PDEs), obtained as the mean-field limit of weakly interacting particle systems subjected to both independent (or idiosyncratic) and common Brownian noises. We provide sufficient conditions under which the deterministic counterpart of the Fokker-Planck equation, which corresponds to particle systems that are just subjected to independent noises, has several invariant measures, but for which the stochastic version admits a unique invariant measure under the presence of the additive common noise. The very difficulty comes from the fact that the common noise is just of finite dimension while the state variable, which should be seen as the conditional marginal law of the system given the common noise, lives in a space of infinite dimension. In this context, our result holds true if, in addition to standard confining properties, the mean field interaction term forces the system to be attracted by its conditional mean given the common noise and the intensity of the idiosyncratic noise is small.