Related papers: Sampling from the Mean-Field Stationary Distributi…
We propose a new approach to deriving quantitative mean field approximations for any probability measure $P$ on $\mathbb{R}^n$ with density proportional to $e^{f(x)}$, for $f$ strongly concave. We bound the mean field approximation for the…
The mean-field Langevin dynamics (MFLD) is a nonlinear generalization of the Langevin dynamics that incorporates a distribution-dependent drift, and it naturally arises from the optimization of two-layer neural networks via (noisy) gradient…
For algorithms based on interacting particle systems that admit a mean-field description, convergence analysis is often more accessible at the mean-field level. In order to transfer convergence results obtained at the mean-field level to…
A dynamical model of an ecological community is analyzed within a "mean-field approximation" in which one of the species interacts with the combination of all of the other species in the community. Within this approximation the model may be…
Bayesian sampling is an important task in statistics and machine learning. Over the past decade, many ensemble-type sampling methods have been proposed. In contrast to the classical Markov chain Monte Carlo methods, these new methods deploy…
The usual Langevin approach to describe systems driven by noise fails to describe the long time behavior of systems with multiple attractors. The solution of the associated linear Fokker-Planck equation is always unique, even though it…
We propose a new method called the N-particle underdamped Langevin algorithm for optimizing a special class of non-linear functionals defined over the space of probability measures. Examples of problems with this formulation include…
The sampling of probability distributions specified up to a normalization constant is an important problem in both machine learning and statistical mechanics. While classical stochastic sampling methods such as Markov Chain Monte Carlo…
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact representation, inference in such models is intractable even…
This work studies how to estimate the mean-field density of large-scale systems in a distributed manner. Such problems are motivated by the recent swarm control technique that uses mean-field approximations to represent the collective…
In this work, we formulate an abstract framework to study mean-field systems. In contrast to most approaches in the available literature which primarily rely on the analysis of SDEs, ours is based on optimal transport and semigroup theory.…
Sampling from a high-dimensional distribution is a fundamental task in statistics, engineering, and the sciences. A canonical approach is the Langevin Algorithm, i.e., the Markov chain for the discretized Langevin Diffusion. This is the…
We study the complexity of sampling, rounding, and integrating arbitrary logconcave functions. Our new approach provides the first complexity improvements in nearly two decades for general logconcave functions for all three problems, and…
We propose a mean-field method to calculate approximately the spacing distribution functions $p^{(n)}(s)$ in 1D classical many-particle systems. We compare our method with two other commonly used methods, the independent interval…
The main difficulty that arises in the analysis of most machine learning algorithms is to handle, analytically and numerically, a large number of interacting random variables. In this Ph.D manuscript, we revisit an approach based on the…
Although real-world complex systems typically interact through sparse and heterogeneous networks, analytic solutions of their dynamics are limited to models with all-to-all interactions. Here, we solve the dynamics of a broad range of…
The processes of interplant competition within a field are still poorly understood. However, they explain a large part of the heterogeneity in a field and may have longer-term consequences, especially in mixed stands. Modeling can help to…
Via constructing an asymptotic coupling by reflection, in this paper we establish uniform-in-time estimates on probability distances for mean-field type SDEs, where the drift terms under consideration are dissipative merely in the long…
Deterministic models of vegetation often summarize, at a macroscopic scale, a multitude of intrinsically random events occurring at a microscopic scale. We bridge the gap between these scales by demonstrating convergence to a mean-field…
A recent dynamic mean-field theory for sequence processing in fully connected neural networks of Hopfield-type (During, Coolen and Sherrington, 1998) is extended and analized here for a symmetrically diluted network with finite connectivity…