all AI news
Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo in the nonconvex stochastic gradient case
April 18, 2024, 4:43 a.m. | Martin Chak, Pierre Monmarch\'e
stat.ML updates on arXiv.org arxiv.org
Abstract: Contraction in Wasserstein 1-distance with explicit rates is established for generalized Hamiltonian Monte Carlo with stochastic gradients under possibly nonconvex conditions. The algorithms considered include splitting schemes of kinetic Langevin diffusion. As consequence, quantitative Gaussian concentration bounds are provided for empirical averages. Convergence in Wasserstein 2-distance and total variation are also given, together with numerical bias estimates.
abstract algorithms arxiv case diffusion generalized gradient hamiltonian monte carlo math.pr quantitative stat.co stat.ml stochastic type
More from arxiv.org / stat.ML updates on arXiv.org
Uniform Inference for Subsampled Moment Regression
1 day, 14 hours ago |
arxiv.org
Partial information decomposition as information bottleneck
1 day, 14 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Data Engineer
@ Lemon.io | Remote: Europe, LATAM, Canada, UK, Asia, Oceania
Artificial Intelligence – Bioinformatic Expert
@ University of Texas Medical Branch | Galveston, TX
Lead Developer (AI)
@ Cere Network | San Francisco, US
Research Engineer
@ Allora Labs | Remote
Ecosystem Manager
@ Allora Labs | Remote
Founding AI Engineer, Agents
@ Occam AI | New York