Improved KLMC for sampling under various conditions.
problem Stable simulation of kinetic Langevin dynamics under different parameters.
method Revisited synchronous Wasserstein coupling analysis with stochastic exponential Euler discretization.
result Exponential integrator can simulate kinetic Langevin dynamics in the overdamped regime with proper time acceleration.
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.
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.
New sampling method on Lie groups converges quickly.
problem Sampling on non-Euclidean Lie groups.
method Kinetic Langevin dynamics with noise added.
result Exponential convergence rate proved under W2 distance. New algorithms improve sampling from constrained distributions.
problem Generating samples from distributions under constraints.
method Kinetic Langevin dynamics and splitting schemes.
result Improved complexity bounds over existing methods.
Unbiased method for Bayesian posterior means using kinetic Langevin dynamics.
problem Estimating Bayesian posterior means efficiently and accurately.
method Combines advanced splitting methods with enhanced gradient approximations in a multilevel Monte Carlo approach.
result The method achieves unbiased estimates with finite variance and central limit theorem properties.
Paper proposes new Langevin samplers for sampling from log-concave distributions with superlinear gradient growth.
problem Sampling from log-concave distributions with superlinear gradient growth.
method Proposes two novel discretizations of kinetic Langevin SDEs, showing contractivity and log-Sobolev inequality.
result Establishes non-asymptotic bounds in 2-Wasserstein distance between sampled distributions and target measures.
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.
Physics analogies explain machine learning overfitting control.
problem Understanding and controlling overfitting in machine learning.
method Analogies from physics and biology applied to algorithmic stability and GAN models.
result Physics formulas provide insights into reducing overfitting in machine learning.
New algorithm samples Bayesian neural networks for improved calibration.
problem Improving calibration of Bayesian neural networks.
method Symmetric Minibatch Splitting-UBU (SMS-UBU) algorithm.
result SMS-UBU provides better calibration performance than standard methods.
Recent technological development has enabled researchers to study social phenomena scientifically in detail and financial markets has particularly attracted physicists since the Brownian motion has played the key role as in physics. In our previous report (arXiv:1703.06739; to appear in Phys. Rev. Lett.), we have prese…
New methods improve efficiency of sampling algorithms for complex systems.
problem Efficiently sampling from complex, high-dimensional probability distributions.
method Randomized Runge-Kutta-Nyström methods tailored for Hamiltonian flows.
result Quantitative 5/2-order L2-accuracy in approximating Hamiltonian flows. Linear stochastic models and discretized kinetic theory are two complementary analytical techniques used for the investigation of complex systems of economic interactions. The former employ Langevin equations, with an emphasis on stock trade; the latter is based on systems of ordinary differential equations and is bett…
A microscopic model is established for financial Brownian motion from the direct observation of the dynamics of high-frequency traders (HFTs) in a foreign exchange market. Furthermore, a theoretical framework parallel to molecular kinetic theory is developed for the systematic description of the financial market from m…
The paper develops methods for sampling from log-concave distributions with constraints.
problem Sampling from log-concave distributions with constraints.
method Randomized midpoint discretization of Langevin diffusions with various projections.
result New convergence guarantees for constrained Langevin algorithms.
KIPLMC methods improve statistical inference in latent variable models.
problem Statistical inference in latent variable models.
method Joint diffusion process in parameter and latent variable spaces, with two explicit discretizations.
result KIPLMC methods achieve accelerated convergence rates in Wasserstein-2 distance.
The paper extends Vlasov kinetic theory to time-dependent dynamics using cosymplectic and cocontact manifolds.
problem Extending Vlasov kinetic theory to time-dependent dynamics.
method Introducing geometric kinetic theories within cosymplectic and cocontact manifolds.
result Alternative realizations of cosymplectic and cocontact kinetic theories linked via Poisson/momentum maps.
New method improves sampling efficiency in complex stochastic systems.
problem Sampling efficiency in nonconvex stochastic gradient cases.
method Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo.
result Quantitative Gaussian concentration bounds and convergence rates established.
RC flow learns molecular kinetics in low dimensions.
problem Discovering interpretable low-dimensional models of molecular kinetics.
method Normalizing flow for coordinate transformation and Brownian dynamics for kinetics approximation.
result Tractable and trainable model of reduced kinetics in continuous time and space.
This research accelerates sampling methods using Nesterov's Acceleration.
problem Improving sampling efficiency in MCMC methods.
method Developed a Hessian-Free High-Resolution ODE reformulation of NAG-SC, injected noise, and discretized the diffusion process.
result Quantified acceleration beyond underdamped Langevin in W2 distance for log-strongly-concave targets. Accelerates sampling from Gibbs distributions using ARWP method.
problem Sampling from Gibbs distributions efficiently.
method ARWP method, combining Nesterov acceleration and regularized Wasserstein proximal.
result ARWP exhibits higher contraction rate and faster tail exploration.
LSS learns molecular trajectories from MD data.
problem Limited integration time steps in MD simulations.
method Three deep learning networks for slow collective variables, dynamics, and configuration reconstruction.
result Generates ultra-long synthetic folding trajectories.
Paper develops a framework to discover bioprocessing regulatory mechanisms using symbolic and statistical learning.
problem Challenges in modeling complex intracellular regulation, stochastic system behavior, and limited experimental data.
method Symbolic and statistical learning framework based on stochastic differential equations and Bayesian learning.
result Improved sample efficiency and robust model selection compared to state-of-the-art approaches.
Study explores how wealth dynamics change with preferential interactions in kinetic exchange models.
problem Investigate how preferential interactions affect wealth dynamics and distributions in kinetic exchange models.
method Conducted Monte Carlo simulations to explore two types of preferential interactions: one with random selection and another with wealth difference constraint.
result Emergence of quasi-oligarchic societies and segregation into economic classes observed in preferential interactions.
New method improves sampling from non-convex distributions using HFHR dynamics.
problem Sampling from non-log-concave densities with non-convex potential functions.
method Hessian-free high-resolution dynamics (HFHR) with reflection/synchronous coupling.
result HFHR dynamics converges faster than kinetic Langevin dynamics (KLD) for non-convex potentials.
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.
New methods use transport maps to improve Langevin dynamics for sampling.
problem Sampling high-dimensional, non-Gaussian distributions efficiently.
method Apply transport maps to accelerate Langevin dynamics convergence.
result Discretized processes converge to target distribution with non-asymptotic bounds.
The use of kinetic modelling based on partial differential equations for the dynamics of stock price formation in financial markets is briefly reviewed. The importance of behavioral aspects in market booms and crashes and the role of agents' heterogeneity in emerging power laws for price distributions is emphasized and…
Paper analyzes and accelerates Langevin Monte Carlo methods using large deviations theory.
problem High-dimensional sampling problems in machine learning.
method Unified approach using large deviations theory to study and accelerate Langevin dynamics variants.
result Efficiency of Langevin dynamics variants demonstrated through numerical experiments.
Unified bounds for random subset generalization error and improved SGD Langevin dynamics.
problem Generalization error bounds for random subsets and stochastic gradient Langevin dynamics.
method Unified framework based on Hellström and Durisi's work, extending bounds for Langevin dynamics.
result Unified and refined bounds for generalization error in stochastic gradient Langevin dynamics.
Study shows uniform-time chaos propagation in mean field Langevin dynamics.
problem Understanding the convergence of marginal distributions in mean field dynamics.
method Assumed functional convexity of energy, used Lp-convergence and Wasserstein metrics. result Uniform-in-time propagation of chaos proved in both L2-Wasserstein and relative entropy. 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.
Extends Langevin dynamics for constrained domains.
problem Optimization of constrained probability measures.
method Mirror mean-field Langevin dynamics (MMFLD).
result Linear convergence guarantees and propagation of chaos results.
Novel geometry-informed irreversible perturbation accelerates Langevin dynamics convergence.
problem Accelerating convergence of Langevin dynamics for Bayesian computation.
method Geometry-informed irreversible perturbation of Riemannian manifold Langevin dynamics.
result Improves estimation performance over irreversible perturbations that ignore geometry.
Langevin Dynamics speeds up mixing time with manifold hypothesis and multi-scale approach.
problem Langevin Dynamics struggles in high dimensions and nonconvex landscapes.
method Utilizes manifold hypothesis to reduce mixing time and employs multi-scale approach to improve image generation quality.
result Mixing time depends on intrinsic dimension rather than ambient dimension, significantly reducing computational complexity.
We present a unified framework to analyze the global convergence of Langevin dynamics based algorithms for nonconvex finite-sum optimization with n component functions. At the core of our analysis is a direct analysis of the ergodicity of the numerical approximations to Langevin dynamics, which leads to faster conver…
Adaptive Langevin dynamics reduces bias in Bayesian inference with mini-batching.
problem Bias in posterior sampling due to mini-batching in Bayesian inference.
method Adaptive Langevin dynamics with dynamical friction to correct noise.
result Quantified bias in posterior distribution due to mini-batching.
Study nonrigid dynamics of unitary groups on Lie groups via kinetic energy metrics.
problem Understanding the dynamics of unitary groups on Lie groups using kinetic energy metrics.
method Least action principle applied to geodesics of the kinetic energy metric on G. result Kinetic energy metric on G is not complete and not invariant. Langevin dynamics fails to produce accurate samples even with small score function errors.
problem Robustness of Langevin dynamics to score function errors.
method Analysis of Langevin dynamics and score function errors.
result Langevin dynamics produces a distribution far from the target distribution in TV distance even with small L2 errors in the score function. A fast method learns plasma collision kernels from simulations, improving kinetic models.
problem Improving kinetic models for plasma dynamics beyond the weakly coupled regime.
method Data-driven collisional operator, fast spectral separation method.
result Accurately captures plasma dynamics in moderately coupled regime.
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.
Analysis of Vlasov plasma dynamics using matched pair Lie-Poisson formulation.
problem Understanding the dynamics of Vlasov plasma and its kinetic moments.
method Hamiltonian (Lie-Poisson) analysis and matched pair decomposition.
result Observation of mutual interactions between subdynamics in Vlasov plasma.
Adaptive algorithm improves convergence rate of Langevin dynamics.
problem Improving convergence rate of Langevin dynamics.
method Adaptive non-reversible stochastic gradient Langevin dynamics algorithm.
result Improved convergence rate of the algorithm.
Paper improves convergence rate of Langevin Dynamics algorithms.
problem Sampling problems and non-convex optimization in machine learning.
method Stochastic Variance Reduced Gradient Langevin Dynamics and Stochastic Recursive Gradient Langevin Dynamics with improved convergence rates.
result Proves convergence to objective distribution under weaker conditions.
Study on convergence of Langevin dynamics for zero-sum games in probability distributions.
problem Analyzing convergence of Langevin dynamics for zero-sum games in probability distributions.
method Proved exponential and biased convergence guarantees for mean-field and finite-particle min-max Langevin dynamics.
result Explicit iteration complexity for finite-particle algorithms to approximate equilibrium distributions.
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.
In this article, we briefly review the different aspects and applications of kinetic exchange models in economics and sociology. Our main aim is to show in what manner the kinetic exchange models for closed economic systems were inspired by the kinetic theory of gas molecules. The simple yet powerful framework of kinet…
Stochastic fluctuations of molecule numbers are ubiquitous in biological systems. Important examples include gene expression and enzymatic processes in living cells. Such systems are typically modelled as chemical reaction networks whose dynamics are governed by the Chemical Master Equation. Despite its simple structur…