Estimates log-likelihood of interacting particle systems using virtual particles.
problem Inconsistent estimation of finite-particle log-likelihood in large particle systems.
method Stochastic gradient estimate using continuous trajectory and virtual particle systems.
result Convergence to stationary points of limiting mean-field system's log-likelihood.
Coercivity condition ensures learning of interacting particle systems.
problem Ensuring identifiability of interaction functions in learning systems of interacting particles.
method Equivalence of coercivity condition to strictly positive definiteness of an integral kernel.
result For ergodic systems, the integral kernel is strictly positive definite, satisfying the coercivity condition.
New method for online learning in interacting particle systems.
problem Parameter estimation in stochastic interacting particle systems.
method Stochastic approximation of gradient of asymptotic log likelihood using continuous observations.
result Convergence to stationary points of asymptotic log-likelihood under suitable assumptions.
Study identifies unique minimizers for interaction kernels in particle systems.
problem Identifying unique interaction kernels in mean-field equations of interacting particles.
method Data-adaptive L2 spaces, RKHS analysis, regularization. result Characterization of identifiability in both finite and infinite particle systems.
New algorithm trains latent diffusion models using interacting particles.
problem Training latent diffusion models efficiently and accurately.
method Reformulate training as minimizing a free energy functional, then approximate with interacting particles.
result The new algorithm outperforms previous methods in experiments.
Gaussian process framework learns interaction kernels in multi-species particle systems.
problem Learning interaction kernels in multi-species interacting particle systems from trajectory data.
method Nonparametric Bayesian approach with Gaussian processes.
result Established rigorous statistical guarantees for recoverability and optimality of interaction kernels.
Develops a new algorithm for estimating model parameters using interacting particle systems.
problem Estimating parameters of latent variable models.
method Interacting Particle Langevin Algorithm (IPLA) based on Langevin diffusion.
result Nonasymptotic optimisation error bounds for the estimator.
Framework for joint inference of network topology and interaction types in heterogeneous systems.
problem Joint inference of network topology, multi-type interaction kernels, and latent type assignments in heterogeneous interacting particle systems.
method Three-stage approach: shared structure recovery, discrete interaction type identification, and matrix factorization.
result The method yields accurate reconstruction of underlying dynamics and is robust to noise.
Algorithm learns interaction kernels for particle systems from data.
problem Understanding and modeling interactions in systems of interacting particles.
method Nonparametric algorithm using least squares with regularization, probabilistic error functional, and reproducing kernel Hilbert space convergence.
result The algorithm converges optimally and accurately learns interaction kernels.
Study generalizes non-interaction theorems for relativistic systems.
problem Understanding interactions in relativistic and non-relativistic systems.
method Generalizes non-interaction theorems for Lorentz violating systems and Galilei invariant systems.
result Extends analysis to very special relativity and anisotropic systems.
Bayesian inference for neural networks improves uncertainty quantification.
problem Improving predictive uncertainty in neural networks.
method Ensemble Kalman filter extensions and interacting particle systems.
result Effective methods for quantifying predictive uncertainty in neural networks.
We propose an interacting particle system to model the evolution of a system of banks with mutual exposures. In this model, a bank defaults when its normalized asset value hits a lower threshold, and its default causes instantaneous losses to other banks, possibly triggering a cascade of defaults. The strength of this …
Model financial default cascades on sparse graphs via hitting times.
problem Capturing systemic risk in large, sparsely-connected financial networks.
method Dynamic particle systems with hitting times and convergence theory.
result Characterization of default time distribution in tree-like networks.
New methods for Bayesian inference using mean shift particle systems.
problem Approximating expectations with unnormalized densities in Bayesian inference.
method Mean shift interacting particle systems that minimize maximum mean discrepancy (MMD).
result Mean shift interacting particle systems converge quickly and capture complex distributions.
Study infers interaction kernels from multiple particle trajectories.
problem Inferring interaction kernels from multiple particle trajectories in stochastic systems.
method Nonparametric inference approach based on regularized maximum likelihood estimator.
result Consistent estimator with near-optimal learning rate independent of state space dimension.
Estimates network structure and interaction rules from multiple agent trajectories.
problem Modeling multi-agent systems on networks from data.
method Jointly infers network topology and interaction kernels using non-convex optimization.
result ORALS estimator is consistent and asymptotically normal under coercivity conditions.
Inferring the laws of interaction between particles and agents in complex dynamical systems from observational data is a fundamental challenge in a wide variety of disciplines. We propose a non-parametric statistical learning approach to estimate the governing laws of distance-based interactions, with no reference or a…
We study systems of Brownian particles on the real line, which interact by splitting the local times of collisions among themselves in an asymmetric manner. We prove the strong existence and uniqueness of such processes and identify them with the collections of ordered processes in a Brownian particle system, in which …
Spaces of polynomials are shown to be Euclidean balls.
problem Understanding the geometry of Lorentzian and real stable polynomials.
method Refined connection between symmetric exclusion process and polynomial geometry.
result Spaces of Lorentzian and real stable polynomials are homeomorphic to closed Euclidean balls.
New approach reduces particle simulation complexity to linear time and space.
problem Challenges in learning dynamics from particle interactions, especially N-body problems.
method Transforms fully-connected interaction graphs into hierarchical ones, reducing complexity.
result Linear time and space complexity for large-scale simulations, retaining high accuracy.
We propose in this work RBM-SVGD, a stochastic version of Stein Variational Gradient Descent (SVGD) method for efficiently sampling from a given probability measure and thus useful for Bayesian inference. The method is to apply the Random Batch Method (RBM) for interacting particle systems proposed by Jin et al to the …
New method learns particle system potentials from unlabeled data.
problem Learning potentials of interacting particle systems from unlabeled data with trajectory information missing.
method Introduces a self-test loss function based on stochastic evolution equation.
result Method outperforms baseline methods in robust estimation of large, high-dimensional systems.
The paper proposes a GP-based method for discovering second-order particle dynamics models.
problem Discovering a general second-order particle-based model for agent interactions.
method Gaussian Process-based approach integrating two independent GP priors on latent interaction kernels.
result The method learns effective nonlinear dynamics representations from small data sets.
This work finds mixed equilibria in zero-sum games using interacting particle dynamics.
problem Finding mixed equilibrium points in continuous minmax games.
method A method based on entropic regularisation of two-layer zero-sum games with interacting particle dynamics.
result The sequence of empirical measures of the particle system satisfies a large deviation principle as the number of particles grows to infinity, implying convergence of the empirical measure and the Nikaidô-Isoda error.
Randomized feature models learn interaction kernels from agent paths.
problem Learning interaction kernels from noisy agent paths.
method Randomized feature algorithm and sparse regression.
result Pruned features reduce overfitting and lower simulation cost.
The paper learns particle swarming models from data using Gaussian processes.
problem Understanding the link between individual interaction rules and swarming behavior.
method Proposes a learning approach using Gaussian processes to model latent radial interaction functions and scalar parameters in non-collective friction forces.
result Establishes that a coercivity condition is sufficient for recoverability and provides a finite-sample analysis showing optimal convergence rates.
Building on the line of work [DIRT15a], [DIRT15b], [NS17a], [DT17], [HLS18], [HS18] we continue the study of particle systems with singular interaction through hitting times. In contrast to the previous research, we (i) consider very general driving processes and interaction functions, (ii) allow for inhomogeneous conn…
Bayesian model learns multiscale interactions in complex systems.
problem Understanding dynamic interplay between processes at different time scales.
method Bayesian learning framework with Particle Gibbs with Ancestor Sampling (PGAS) algorithm.
result Demonstrated the effectiveness of the proposed approach through simulations.
GER learns particle dynamics from unpaired snapshots using physics-informed GANs.
problem Learning particle dynamics from unpaired snapshots with physics constraints.
method Physics-informed generative model to fit particle ensemble distributions.
result Inferred dynamics of particle ensembles governed by SODEs up to 100 dimensions.
New algorithm tames non-linear growth in stochastic optimization.
problem Computational challenges in E-step of EM framework.
method Employing interacting particle systems and taming techniques to create tIPLA.
result Non-asymptotic convergence error estimates in Wasserstein-2 distance for tIPLA.
Electrostatics method samples complex distributions deterministically.
problem Sampling and inference of complex, high-dimensional distributions.
method Electrostatics-based particle system with Newton mechanics principles.
result Method achieves comparable performance to other methods in benchmark tasks.
Paper studies systemic robustness in financial networks using particle systems.
problem Budget control and default risk in regional financial networks.
method Mean-field particle system approach, McKean-Vlasov equations, asymptotic analysis.
result Systemic robustness measured by the proportion of surviving entities in large particle systems.
MPM-ParVI uses particle sampling for variational inference.
problem Variational inference for complex probabilistic models.
method Material Point Method (MPM) for particle-based simulation.
result Deterministic sampling and inference for intractable densities.
SPH-ParVI uses fluid dynamics to sample unknown densities efficiently.
problem Sampling partially known densities or using gradients in probabilistic models.
method Smoothed Particle Hydrodynamics (SPH) for modeling fluid dynamics to approximate target densities.
result SPH-ParVI provides fast, flexible, scalable, and deterministic sampling for Bayesian inference and generative models.
We consider systems of diffusion processes ("particles") interacting through their ranks (also referred to as "rank-based models" in the mathematical finance literature). We show that, as the number of particles becomes large, the process of fluctuations of the empirical cumulative distribution functions converges to t…
The homogeneous canonical formalism of Rund is applied to the second-order Lagrangian model of the self-interacting particle of Bopp. The quasi-classical free spinning particle of Mathisson appears then as a constrained subsystem of the previous system. Differential-geometric mechanisms offered in this work are formula…
Proposes methods to include distributional information in MV-SDEs for better modeling of interacting particle systems.
problem Modeling the behavior of an infinite number of interacting particles with distributional information.
method Semi-parametric methods and estimators for MV-SDEs.
result Explicitly including distributional dependence improves performance in modeling temporal data with interaction.
The collective phenomena of a liquid market is characterized in terms of a particle system scenario. This physical analogy enables us to disentangle intrinsic features from purely stochastic ones. The latter are the result of environmental changes due to a `heat bath' acting on the many-asset system, quantitatively des…
A new stochastic algorithm approximates optimal distributions without requiring propagation of chaos.
problem Optimizing functionals over probability distributions using finite particle systems.
method Virtual particle stochastic approximation, viewed as a form of stochastic gradient descent in the Wasserstein space.
result The algorithm's output converges to the optimal distribution and produces i.i.d. samples.
We characterize the collective phenomena of a liquid market. By interpreting the behavior of a no-arbitrage N asset market in terms of a particle system scenario, (thermo)dynamical-like properties can be extracted from the asset kinetics. In this scheme the mechanisms of the particle interaction can be widely investiga…
Bayesian inference reconstructs external potentials in DFT for many-particle systems.
problem Reconstructing external potentials in classical density-functional theory (DFT) for many-particle systems.
method Combines Bayesian inference with classical DFT to probabilistically reconstruct external potentials.
result Accurately infers external potentials and density profiles with uncertainty quantification.
We study an interacting particle system in Rd motivated by Stein variational gradient descent [Q. Liu and D. Wang, NIPS 2016], a deterministic algorithm for sampling from a given probability density with unknown normalization. We prove that in the large particle limit the empirical measure of the particle s…
Transformers approximate mean-field dynamics of indistinguishable particles.
problem Approximating the dynamics of indistinguishable particles in complex systems.
method Using transformers to model the mean-field dynamics of interacting particle systems.
result Theoretical bounds on the distance between true and transformer-obtained mean-field dynamics.
This work develops a particle system to approximate Fisher-Rao gradient flows in mean-field optimization.
problem Optimizing probability measures in neural network contexts.
method Constructing an interacting particle system approximating Fisher-Rao gradient flows.
result Propagation of chaos for the Fisher-Rao gradient flow in entropic mean-field optimization.
Particles representing tokens cluster in Transformers, influenced by initial tokens and matrix spectrum.
problem Understanding the geometry of learned representations in Transformers.
method Viewing Transformers as particle systems, applying dynamical systems and partial differential equations.
result Particles cluster towards limiting objects, confirming context-awareness and the emergence of leaders.
Particle- and agent-based systems are a ubiquitous modeling tool in many disciplines. We consider the fundamental problem of inferring interaction kernels from observations of agent-based dynamical systems given observations of trajectories, in particular for collective dynamical systems exhibiting emergent behaviors w…
Method learns cell interaction rules from individual trajectories.
problem Inferring interaction rules from heterogeneous cellular data.
method WSINDy for second order IPSs, learning individual cell models.
result Efficiently identifies different species and best-fit models for each.
In this paper, we propose an efficient Monte Carlo implementation of non-linear FBSDEs as a system of interacting particles inspired by the ideas of branching diffusion method. It will be particularly useful to investigate large and complex systems, and hence it is a good complement of our previous work presenting an a…