A complementary upper bound of $O(\kappa)$ steps, up to logarithmic factors, for a fixed-parameter OBABO tuning is proved, Hence, among fixed-parameter OBABO tunings, the optimal condition-number dependence of cold-start total variation mixing over this class is linear, up to logarithmic factors.
Abstract
The OBABO and BAOAB schemes and the other standard Strang splittings of kinetic (underdamped) Langevin dynamics are widely used Markov chain Monte Carlo algorithms. Under a suitable friction scaling, the underlying diffusion relaxes on a ballistic time scale, suggesting that these discretizations, suitably tuned, sample targets with condition number $\kappa$ in $O(\sqrt{\kappa})$ iterations. We prove that no fixed choice of step size and friction, based only on the curvature bounds and the dimension, achieves this acceleration: total variation mixing time lower bounds for OBABO show that ballistic cold-start mixing fails uniformly over the smooth strongly convex class, and the lower bounds extend, with the same orders, to BAOAB and the other four Strang splittings. The proof transfers non-acceleration from optimization to sampling. Eliminating velocity gives an exact noisy heavy-ball recursion, and by the non-acceleration theorem of Goujaud, Taylor and Dieuleveut, for every tuning either some Gaussian target has a mode with relaxation time at least of order $\kappa$, or an attracting cycle exists on a smooth potential; dilating such a potential as $U_R(x)=R^2U(x/R)$ preserves its curvature bounds and produces metastability for a number of steps exponential in $R^2$, from an initial state at Wasserstein distance $O(R)$ from equilibrium. Using contraction estimates of Leimkuhler, Paulin and Whalley and a Wasserstein-to-total-variation regularization estimate, we prove a complementary upper bound of $O(\kappa)$ steps, up to logarithmic factors, for a fixed-parameter OBABO tuning. Hence, among fixed-parameter OBABO tunings, the optimal condition-number dependence of cold-start total variation mixing over this class is linear, up to logarithmic factors. A direct Gaussian calculation also rules out fixed-parameter acceleration for the left-endpoint exponential integrator.
This work studies global convergence guarantees of third-order Langevin dynamics for non-convex optimization via simulated annealing with fixed friction and decreasing noise via simulated annealing with fixed friction and decreasing noise.
An explicit quantitative contraction rate is established for HFHR dynamics under a position Poincar\'e inequality, weighted Hessian and Laplacian bounds, and a compact Sobolev embedding, where the potential function is not necessarily convex.
Wu-Jun Lv, Xiao-Yu Wang, Ying-Li Wang et al.· 0 citations
To quantitatively characterize the long-time dynamics of the periodic damped stochastic Korteweg--de Vries (sKdV) equation driven by additive noise, we investigate the uniform-in-time error estimates for a Lie--Trotter operator splitting approximation. This splitting combines the exact deterministic KdV flow with the e...
Stochastic Gradient Langevin Dynamics (SGLD) reduces the cost of Langevin-based sampling by replacing full-dataset drift evaluations with mini-batch approximations, but the resulting subsampling error may offset this computational saving. We study this trade-off for stochastic differential equations with finite-sum dri...
Mateusz B. Majka, Tigran Nagapetyan, Łukasz Szpruch et al.· 0 citations
A stochastic first-order version of the Mirror Langevin Algorithm (sFO-MLA) is studied and finite-time Wasserstein guarantees for sFO-MLA are established that explicitly separate mixing, Euler--Maruyama discretization, and stochastic-gradient errors.
Rui-Ting Tong, Antik Chakraborty, R. Pasupathy· 0 citations
Modern effective field theories of dissipative hydrodynamics, built on the Schwinger-Keldysh (SK) formalism, include thermal noise that is not Gaussian. The resultant higher-order noise vertices are constrained by symmetries, but otherwise treated as free parameters. We show explicitly that symmetry constraints alone d...
A. Amoretti, Daniel K. Brattan· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.