In this survey paper, we give an overview of our recent works on the study of the -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…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “Riemannian Langevin equation”
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.
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.
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…
Langevin MCMC samples efficiently from Riemannian manifolds with geometric Euler-Murayama analysis.
problem Efficient sampling from Gibbs distributions on Riemannian manifolds.
method Geometric Langevin MCMC, discretization error bound, contraction guarantee for Langevin Diffusion.
result Langevin MCMC iterates converge to the target distribution after a number of steps proportional to the inverse square of the desired accuracy.
Rapid mixing of Langevin dynamics on Riemannian manifolds
problem Mixing time of Langevin dynamics on Riemannian manifolds
method Relation between Langevin processes in domain and image
result Achievable polynomial mixing times
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.
The Riemannian Langevin Algorithm samples from manifolds efficiently.
problem Sampling from distributions on manifolds with log-Sobolev inequality.
method Riemannian Langevin Algorithm, log-Sobolev inequality, self-concordance extension, stochastic smoothness bounding.
result The Riemannian Langevin Algorithm converges rapidly to the target density.
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.
Improved error bounds for Langevin MCMC with scaling.
problem Improving convergence rates of Langevin MCMC.
method Introducing scaling terms in underdamped Langevin equation and analyzing conditions for improved error bounds.
result Appropriate scaling improves error bounds in terms of condition number.
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.
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.
Learning non-stationary Langevin dynamics from stochastic observations of latent trajectoriesstat.ML
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.
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.
The paper analyzes the InfoNCE loss under different temperature schedules using Langevin dynamics.
problem Understanding the dynamics of InfoNCE loss under fixed versus annealed temperature schedules.
method Modeling embedding evolution under Langevin dynamics on a compact Riemannian manifold, with theoretical guarantees for convergence.
result Slow logarithmic inverse-temperature schedules ensure convergence to globally optimal representations, while faster schedules risk suboptimal minima.
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.
Uncertainty quantification of neural network models of evolving processes via Langevin samplingcs.LG
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.
Brownian marketsq-fin.ST
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…
Optimal preconditioning improves Langevin sampling efficiency.
problem Improving sampling efficiency in high-dimensional target distributions.
method Optimal preconditioning using Fisher information, applied to MALA.
result Adaptive MCMC scheme significantly outperforms other methods.
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.
SGLB boosts machine learning with Langevin diffusion for multimodal loss functions.
problem Dealing with multimodal loss functions in machine learning.
method Stochastic Gradient Langevin Boosting (SGLB) based on Langevin diffusion equation.
result SGLB guarantees global convergence for multimodal loss functions.
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.
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…
Geometry-informed irreversible perturbations for accelerated convergence of Langevin dynamicsstat.ME
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.
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.
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.
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…
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.
A new algorithm solves semidefinite programs using Langevin diffusion.
problem Optimizing semidefinite programs with diagonal constraints.
method Langevin diffusion on a product manifold of spheres.
result Langevin algorithm achieves ε accuracy in Ω(ε^-5) iterations.
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…
Geometric Ergodicity in Modified Variations of Riemannian Manifold and Lagrangian Monte Carlostat.ME
This work investigates a mixture of LMC and RMHMC with MMALA for geometric ergodicity.
problem Lack of geometric ergodicity study in Riemannian manifold and Lagrangian Monte Carlo methods.
method Investigates a mixture of LMC and RMHMC with MMALA to achieve geometric ergodicity.
result Demonstrates geometric ergodicity in the mixture of LMC and RMHMC with MMALA.
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 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.
Paper tackles Bayesian image restoration in low-photon Poisson imaging problems.
problem Bayesian inference in challenging low-photon Poisson imaging problems.
method Plug-and-play (PnP) Langevin sampling strategies with accelerated methods and mirror sampling.
result Effective PnP Langevin sampling methods for low-photon Poisson imaging problems.
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.
Pavlov Learning Machinescond-mat.dis-nn
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.
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.
Geometric Renyi Differential Privacy: Ricci Curvature Characterized by Heat Diffusion Mechanismsstat.ML
Paper develops novel privacy mechanism for Riemannian manifold data using geometric analysis and heat diffusion.
problem Privacy-preserving estimation of generalized Frechet mean on Riemannian manifolds.
method Characterizes Renyi divergence via Harnack inequalities, introduces mechanisms based on heat diffusion and Langevin process.
result Proposes mechanisms for nonnegative and general Riemannian manifolds with detailed utility analyses.
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…
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.
A standard form of master equations for general non-Markovian jump processes: the Laplace-space embedding framework and asymptotic solutioncond-mat.stat-mech
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.
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.
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.