Recursive Maximum Likelihood Estimation for Interacting Particle Systems using Virtual Particles

• URL: http://arxiv.org/abs/2605.00786v1
• Date: Fri, 01 May 2026 17:05:08 GMT
• Title: Recursive Maximum Likelihood Estimation for Interacting Particle Systems using Virtual Particles
• Abstract summary: We optimise the stationary log-likelihood of the limiting mean-field system.<n>We show that the resulting algorithms drive the gradient of a finite surrogate objective to zero.<n>We illustrate the method on several numerical examples.
• Score: 6.894787079804484
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study recursive maximum likelihood estimation for stochastic interacting particle systems based on continuous observation of a single particle. In this regime, consistent estimation of the finite-particle log-likelihood is not possible, even in the limit as the number of particles $N\rightarrow\infty$ and the time horizon $t\rightarrow\infty$. We thus seek to optimise the stationary log-likelihood of the limiting mean-field system. We achieve this via a form of stochastic gradient estimate in continuous time, with stochastic gradient estimates computed using the continuous trajectory of the single observed particle, alongside a virtual interacting particle system and a virtual tangent interacting particle system, which are integrated with the online parameter estimate. For fixed numbers of real and virtual particles, we show that the resulting algorithms drive the gradient of a finite-particle surrogate objective to zero as $t\to\infty$. We then prove that, in the iterated limit $t\to\infty$ followed by $N,M\to\infty$, these surrogate gradients converge uniformly to the gradient of the stationary log-likelihood of the limiting mean-field system, yielding convergence to its stationary points. We illustrate the method on several numerical examples, including a model with quadratic confinement and interaction potentials, a model of interacting FitzHugh--Nagumo neurons, and a stochastic Kuramoto model.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Efficient Online Learning in Interacting Particle Systems [6.894787079804484]
  We introduce a new method for online parameter estimation in interacting particle systems.<n>We rigorously establish convergence of our method to the stationary points of the log-likelihood of the interacting particle system.<n>Our numerical results corroborate our theoretical results, and also suggest that our estimator is effective even in cases where the assumptions required for our theoretical analysis do not hold.
  arXiv  Detail & Related papers  (2026-02-24T13:19:07Z)
• Quenched large deviations for Monte Carlo integration with Coulomb gases [5.502903075972815]
  We show that a random approximation of the potential preserves the fast large deviation principle that guarantees the proposed integration algorithm to outperform independent or Markov quadratures.<n>For the Coulomb interaction kernel, we need the approximation to be based on another Gibbs measure, and we prove in passing a control on the uniform convergence of the approximation of the potential.
  arXiv  Detail & Related papers  (2025-08-02T14:52:06Z)
• Propagation of Chaos in One-hidden-layer Neural Networks beyond Logarithmic Time [46.15741640288809]
  We study the approximation gap between the dynamics of a-width neural network and its infinite-width counterpart.<n>We demonstrate how to tightly bound this approximation gap through a differential equation governed by the mean-field dynamics.
  arXiv  Detail & Related papers  (2025-04-17T17:24:38Z)
• Interacting Particle Langevin Algorithm for Maximum Marginal Likelihood Estimation [2.365116842280503]
  We develop a class of interacting particle systems for implementing a maximum marginal likelihood estimation procedure.<n>In particular, we prove that the parameter marginal of the stationary measure of this diffusion has the form of a Gibbs measure.<n>Using a particular rescaling, we then prove geometric ergodicity of this system and bound the discretisation error.<n>in a manner that is uniform in time and does not increase with the number of particles.
  arXiv  Detail & Related papers  (2023-03-23T16:50:08Z)
• Monte Carlo Neural PDE Solver for Learning PDEs via Probabilistic Representation [59.45669299295436]
  We propose a Monte Carlo PDE solver for training unsupervised neural solvers.<n>We use the PDEs' probabilistic representation, which regards macroscopic phenomena as ensembles of random particles.<n>Our experiments on convection-diffusion, Allen-Cahn, and Navier-Stokes equations demonstrate significant improvements in accuracy and efficiency.
  arXiv  Detail & Related papers  (2023-02-10T08:05:19Z)
• Efficient displacement convex optimization with particle gradient descent [57.88860627977882]
  Particle gradient descent is widely used to optimize functions of probability measures. This paper considers particle gradient descent with a finite number of particles and establishes its theoretical guarantees to optimize functions that are emphdisplacement convex in measures.
  arXiv  Detail & Related papers  (2023-02-09T16:35:59Z)
• Particle-Based Score Estimation for State Space Model Learning in Autonomous Driving [62.053071723903834]
  Multi-object state estimation is a fundamental problem for robotic applications. We consider learning maximum-likelihood parameters using particle methods. We apply our method to real data collected from autonomous vehicles.
  arXiv  Detail & Related papers  (2022-12-14T01:21:05Z)
• Utilising the CLT Structure in Stochastic Gradient based Sampling : Improved Analysis and Faster Algorithms [14.174806471635403]
  We consider approximations of sampling algorithms, such as Gradient Langevin Dynamics (SGLD) and the Random Batch Method (RBM) for Interacting Particle Dynamcs (IPD) We observe that the noise introduced by the approximation is nearly Gaussian due to the Central Limit Theorem (CLT) while the driving Brownian motion is exactly Gaussian. We harness this structure to absorb the approximation error inside the diffusion process, and obtain improved convergence guarantees for these algorithms.
  arXiv  Detail & Related papers  (2022-06-08T10:17:40Z)
• Accessing the topological Mott insulator in cold atom quantum simulators with realistic Rydberg dressing [58.720142291102135]
  We investigate a realistic scenario for the quantum simulation of such systems using cold Rydberg-dressed atoms in optical lattices. We perform a detailed analysis of the phase diagram at half- and incommensurate fillings, in the mean-field approximation. We furthermore study the stability of the phases with respect to temperature within the mean-field approximation.
  arXiv  Detail & Related papers  (2022-03-28T14:55:28Z)
• Learning interaction kernels in stochastic systems of interacting particles from multiple trajectories [13.3638879601361]
  We consider systems of interacting particles or agents, with dynamics determined by an interaction kernel. We introduce a nonparametric inference approach to this inverse problem, based on a regularized maximum likelihood estimator. We show that a coercivity condition enables us to control the condition number of this problem and prove the consistency of our estimator.
  arXiv  Detail & Related papers  (2020-07-30T01:28:06Z)
• Quantitative Propagation of Chaos for SGD in Wide Neural Networks [39.35545193410871]
  In this paper, we investigate the limiting behavior of a continuous-time counterpart of the Gradient Descent (SGD) We show 'propagation of chaos' for the particle system defined by this continuous-time dynamics under different scenarios. We identify two under which different mean-field limits are obtained, one of them corresponding to an implicitly regularized version of the minimization problem at hand.
  arXiv  Detail & Related papers  (2020-07-13T12:55:21Z)
• The role of boundary conditions in quantum computations of scattering observables [58.720142291102135]
  Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution. As with present-day calculations, quantum computation strategies still require the restriction to a finite system size. We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
  arXiv  Detail & Related papers  (2020-07-01T17:43:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.