In this article we develop geometric versions of the classical Langevin equation on regular submanifolds in euclidean space in an easy, natural way and combine them with a bunch of applications. The equations are formulated as Stratonovich stochastic differential equations on manifolds. The first version of the geometr…
Novel method learns memory kernels in Langevin equations.
problem Estimating memory kernels in Langevin equations.
method Regularized Prony method for correlation functions, followed by regression over Sobolev norm-based loss function with RKHS regularization.
result Method outperforms other regression estimators in exponentially weighted L^2 space.
Study on Langevin dynamics convergence rates and their application to GAN training.
problem Understanding the long-term behavior of Langevin dynamics equations.
method Analytical and numerical methods to study convergence rates of underdamped mean-field Langevin dynamics.
result Exponential convergence rate results for the Langevin dynamics under various conditions.
The paper analyzes convergence of Langevin dynamics with time-dependent metrics.
problem Analyzing convergence of Langevin dynamics with time-dependent metrics.
method Formulated a modified gradient flow of the Kullback-Leibler divergence, selected a time-dependent relative Fisher information functional, and developed a time-dependent Hessian matrix condition.
result Proved convergence conditions for various Langevin dynamics.
Financial market dynamics is rigorously studied via the exact generalized Langevin equation. Assuming market Brownian self-similarity, the market return rate memory and autocorrelation functions are derived, which exhibit an oscillatory-decaying behavior with a long-time tail, similar to empirical observations. Individ…
A scalable framework uses Langevin sampling to approximate neural network models of evolving processes.
problem Uncertainty quantification in neural network models of dynamic systems.
method Flexible data model based on NODE, joint learning of data model and posterior parameters, Langevin sampling.
result Demonstrated performance on chemical reaction and material physics data, compared favorably to variational inference.
Framework infers Langevin dynamics from stochastic observations of latent systems.
problem Inferring non-stationary Langevin dynamics from indirect stochastic observations.
method Non-parametric framework explicitly modeling stochastic observation process and non-stationary latent dynamics.
result Correct inference of non-stationary dynamics requires accounting for non-equilibrium states and observation duration.
Study on Langevin dynamics for recovering planted signals in spiked matrix models.
problem Recovering a planted signal in spiked matrix models.
method Path-wise characterization of overlap using integro-differential equations and explicit formula derivation.
result Sharp phase transition in limiting overlap: positive in one regime, zero in another due to injected noise.
Bayesian inference for expensive likelihoods using Langevin Monte Carlo with NF.
problem Sampling from complex posterior distributions with expensive likelihoods.
method Deterministic Langevin equation with NF gradient, Metropolis-Hastings updates.
result Competitive performance compared to state-of-the-art methods.
Construct intrinsic Langevin dynamics for rigid inclusions on curved surfaces.
problem Stochastic dynamics of rigid inclusions on curved surfaces.
method Cartan's method of moving frames, Hamiltonian equations, intrinsic Langevin equations, Fokker-Planck equation.
result Extracted overdamped equations for accurate simulations of diffusion processes.
Proposes a new method for constrained generative modeling using Langevin dynamics.
problem Challenges in satisfying underlying constraints with score-based generative models.
method Uses kinetic Langevin dynamics with specular reflection to model constraints.
result Demonstrates efficient numerical samplers with optimal convergence rates.
Recent works have derived non-asymptotic upper bounds for convergence of underdamped Langevin MCMC. We revisit these bound and consider introducing scaling terms in the underlying underdamped Langevin equation. In particular, we provide conditions under which an appropriate scaling allows to improve the error bounds in…
A new method for sampling from complex distributions using Langevin samplers.
problem Sampling from unnormalized Boltzmann densities.
method Probability flow ODE derived from linear stochastic interpolants, employing Langevin samplers.
result Efficient simulation of the flow with non-asymptotic convergence rate.
This paper introduces Stochastic Gradient Langevin Boosting (SGLB) - a powerful and efficient machine learning framework that may deal with a wide range of loss functions and has provable generalization guarantees. The method is based on a special form of the Langevin diffusion equation specifically designed for gradie…
A new method uses higher-order Langevin dynamics with critical damping for better generative modeling.
problem Improving generative models using Langevin dynamics with auxiliary variables.
method Introducing higher-order Langevin dynamics with critical damping, providing closed-form solutions.
result Improved generative models with better performance as measured by FID metric.
New sampling method for heavy-tailed distributions using Langevin Algorithm.
problem Sampling from heavy-tailed distributions efficiently.
method Transformed Unadjusted Langevin Algorithm on specific transformations.
result Polynomial-order oracle complexities for certain heavy-tailed densities.
The paper analyzes the mean field Langevin dynamics and its convergence rate.
problem The convergence property of the mean field Langevin dynamics in the context of neural networks.
method The analysis uses a proximal Gibbs distribution and techniques from convex optimization.
result A concise convergence rate analysis of the mean field Langevin dynamics in both continuous and discrete time settings.
Unified analytical tool for non-Markovian jump processes.
problem Analyzing history-dependent jump processes with non-Markovian behavior.
method Developed a standard form of master equations using Laplace-space embedding and asymptotic solution.
result Unified analytical toolset for general non-Markovian processes, leading to the GLE approximation.
A fundamental problem in Bayesian inference and statistical machine learning is to efficiently sample from multimodal distributions. Due to metastability, multimodal distributions are difficult to sample using standard Markov chain Monte Carlo methods. We propose a new sampling algorithm based on a birth-death mechanis…
New algorithms improve sampling from complex distributions.
problem Sampling from complex probability distributions efficiently.
method Regime-switching Langevin dynamics and Monte Carlo algorithms.
result Convergence guarantees and iteration complexities provided.
Efficiently simulates Langevin dynamics on manifold using diffusion maps and finite volume schemes.
problem Simulating Langevin dynamics on high-dimensional manifolds with limited data.
method Diffusion maps, Fokker-Planck equation, finite volume scheme, explicit time discretization.
result Data-driven finite volume scheme approximates Langevin dynamics on manifold with good properties.
Algorithm generates private continuous-time data for sensitive domains.
problem Private generation of continuous-time data for sensitive domains.
method Mean-field Langevin dynamics and noisy particle gradient descent.
result Strong privacy guarantees for one-time data contributions.
Traditionally, neural networks are parameterized using optimization procedures such as stochastic gradient descent, RMSProp and ADAM. These procedures tend to drive the parameters of the network toward a local minimum. In this article, we employ alternative "sampling" algorithms (referred to here as "thermodynamic para…
Poisson Midpoint Method improves Langevin Dynamics for diffusion models.
problem Slow convergence of LMC in diffusion models requiring many small steps.
method Poisson Midpoint Method approximates LMC with larger steps, proving quadratic speed up.
result Poisson Midpoint Method maintains quality of DDPM with fewer calls.
In this work we present a new approach on studying dynamical systems. Combining the two ways of expressing the uncertainty, using probabilistic theory and credibility theory, we have research the generalized fractional hybrid equations. We have introduced the concepts of generalized fractional Wiener process, generaliz…
The study analyzes prediction errors in systems with memory kernels, providing bounds and stability results.
problem Prediction errors in stochastic dynamical systems with memory kernels.
method Analysis of generalized Langevin equations (GLEs) with Volterra equations, integrating synchronized noise coupling and weighted norms.
result Prediction discrepancies decay at a rate determined by the memory kernel's decay, quantitatively bounded by kernel estimation errors.
Gradient-descent-based algorithms and their stochastic versions have widespread applications in machine learning and statistical inference. In this work we perform an analytic study of the performances of one of them, the Langevin algorithm, in the context of noisy high-dimensional inference. We employ the Langevin alg…
Model infers latent variables in sparse coding models using Langevin dynamics.
problem Sampling posterior distribution in sparse coding models.
method Langevin dynamics for inference and simultaneous learning of parameters.
result Langevin dynamics efficiently sample from 'L0 sparse' posterior distribution.
In this paper we established the condition for a curve to satisfy stochas- tic fractional HP (Hamilton-Pontryagin) equations. These equations are described using It^o integral. We have also considered the case of stochastic fractional Hamiltonian equa- tions, for a hyperregular Lagrange function. From the stochastic fr…
Generative model uses Schrödinger bridges for stable sampling.
problem Sampling from unknown distributions with limited training samples.
method Combines Schrödinger bridges and Langevin dynamics.
result Effective stability and generation of samples within convex hull.
The paper analyzes variance reduction in stochastic gradient Langevin dynamics.
problem Reducing the variance of stochastic gradient estimators in Langevin dynamics.
method Central limit theorem and Poisson equation analysis for variance characterization.
result Anti-symmetric perturbations can reduce the variance of non-reversible Langevin dynamics.
In this survey paper, we give an overview of our recent works on the study of the W-entropy for the heat equation associated with the Witten Laplacian on super-Ricci flows and the Langevin deformation on Wasserstein space over Riemannian manifolds. Inspired by Perelman's seminal work on the entropy formula for the Ri…
New algorithm improves convergence for non-convex problems with boundaries.
problem Optimizing non-convex problems with constraints.
method Reflected Gradient Langevin Dynamics with probabilistic representation.
result Promising convergence rates, faster than existing methods.
This work proves a strong convergence result for a geometric EM scheme on Riemannian manifolds.
problem Convergence of numerical schemes for manifold-valued SDEs.
method Geometric Euler-Maruyama scheme for Riemannian manifolds.
result Strong convergence of order 1/2 for the geometric EM scheme on Riemannian manifolds.
The paper analyzes sampling and estimation on manifolds using Langevin diffusion.
problem Sampling and estimation on compact Riemannian manifolds.
method Discretization of Langevin diffusion with error bounds derived.
result First-order error bounds for bias and variance in estimators.
New rates for GLD and SGLD in infinite-dimensional spaces without dimensionality issues.
problem Gradient Langevin dynamics and SGLD convergence rates in high-dimensional spaces.
method Analysis of GLD and SGLD in infinite-dimensional Hilbert spaces, using stochastic differential equations and Markov chains.
result Derivation of dimension-free convergence rates for GLD and SGLD.
Paper models Pavlov's classical conditioning using stochastic processes and Langevin equations.
problem Lack of modeling for Pavlov's classical conditioning.
method Modeling neural and synaptic dynamics via Langevin equations.
result Pavlov's mechanism spontaneously leads to synaptic weights similar to Hebb's.
This paper optimizes Bayesian estimation for log-concave models using Langevin Monte-Carlo.
problem Optimizing Bayesian estimators for log-concave models with Langevin Monte-Carlo.
method Quantitative statistical bounds and numerical approximation of Gibbs measures.
result Established optimal numerical strategy and its cost for Bayesian posterior mean approximation.
Study on kinetic Langevin diffusions and their couplings, showing subtle TV bounds and new non-Markovian couplings.
problem Understanding and quantifying the TV distance between solutions of kinetic Langevin diffusions with different initial values.
method Established new non-Markovian couplings for kinetic Langevin diffusions, derived from optimal coalescence trajectories, and analyzed their TV bounds.
result No Markovian coupling can capture the asymptotic decay rate of the TV distance between solutions of kinetic Langevin diffusions with different initial values.
Study extends wealth tax neutrality framework to heterogeneous investors.
problem Analyzing wealth tax neutrality in populations with varying return-generating ability.
method Extended Fokker-Planck framework to heterogeneous investors, deriving extended Fokker-Planck equation.
result Proportional wealth tax no longer neutral due to varying return-generating ability, leading to different real incidence and wealth distribution changes.
We present a time-dependent Langevin description of dynamics of stock prices. Based on a simple sliding-window algorithm, the fluctuation of stock prices is discussed in the view of a time-dependent linear restoring force which is the linear approximation of the drift parameter in Langevin equation estimated from the f…
The paper presents two schemes for sampling matrices from specific distributions on a manifold.
problem Sampling matrices from Gibbs distributions on the manifold of positive semi-definite matrices with fixed rank.
method Two explicit schemes based on Euler-Maruyama discretization of the Riemannian Langevin equation with Brownian motion on the manifold.
result Numerical validation of the schemes using specific energy functions and metrics.
For sampling from a log-concave density, we study implicit integrators resulting from θ-method discretization of the overdamped Langevin diffusion stochastic differential equation. Theoretical and algorithmic properties of the resulting sampling methods for θ∈[0,1] and a range of step sizes are established. Ou…
BLADE uses Bayesian methods to discover complex systems from scarce data.
problem Efficiently discovering governing equations of complex dynamical systems from limited data.
method Combines replica-exchange stochastic gradient Langevin Monte Carlo with active learning.
result Reduces measurement requirements by 60% for Lotka-Volterra and 40% for Burgers' equation.
Bayesian nonparametric models get better posterior estimates via SPDE methods.
problem Estimating posterior distributions in nonparametric Bayesian models.
method Extending diffusion methods to SPDEs on Hilbert spaces for posterior contraction and Laplace approximation.
result Derivation of posterior contraction rates and finite-sample Bernstein von Mises results.
New model explains market dynamics with phase transitions and non-linear interactions.
problem Understanding complex multi-asset market dynamics with phase transitions.
method Developed a Multi-Asset Non-Equilibrium Skew (MANES) model based on Langevin dynamics and McKean-Vlasov equation.
result The model accurately predicts market returns and phase transitions in both benign and distressed markets.
Study on convergence of SDEs using entropy methods.
problem Analyzing convergence of stochastic differential equations.
method Applied Lyapunov method to Fokker-Planck equation with weighted relative Fisher information.
result Exponential convergence of probability density function to invariant distribution in L1 distance. A new method called MCLMC avoids dissipation in sampling from canonical distributions.
problem Sampling from canonical distributions without dissipation.
method Microcanonical Langevin Monte Carlo (MCLMC) as a dissipation-free system of SDE.
result MCLMC converges faster than HMC for lattice φ^4 models.