arXiv Machine Learning July 15, 2026 By Siddharth Mitra, Vishwak Srinivasan, Xiuyuan Wang, Andre Wibisono

Accelerated Mixing Time of Randomized Hamiltonian Monte Carlo

Read the original on arXiv Machine Learning →

arXiv:2607. 12902v1 Announce Type: cross Abstract: We show the Randomized Hamiltonian Monte Carlo (RHMC) algorithm has accelerated mixing time guarantees for sampling from log-concave probability distributions.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers

Jul 14

Accelerated Mixing Time of Randomized Hamiltonian Monte Carlo

We show the Randomized Hamiltonian Monte Carlo (RHMC) algorithm has accelerated mixing time guarantees for sampling from log-concave probability distributions. RHMC proceeds by repeatedly simulating the continuous-time Hamiltonian dynamics for some random integration times, and resetting the velocity to be an independent Gaussian random variable between each simulation.

arXiv Machine Learning

Sep 10

Smoothed Picard Hamiltonian Monte Carlo

arXiv:2609.06906v1 Announce Type: cross Abstract: We develop a new low-accuracy sampler, called \emph{smoothed Picard Hamiltonian Monte Carlo}, which combines Gaussian smoothing, Picard iteration, an...

By Fan Chen, Sinho Chewi, Jianfeng Lu, Matthew S Zhang

arXiv Machine Learning

Jun 25

A Single Stepsize Suffices for Unprojected Linear TD(0): Simultaneous Robust and Fast Rates via Polyak--Ruppert Averaging

arXiv:2606. 24981v1 Announce Type: new Abstract: We study linear TD(0) under Markovian sampling, where data are generated along a single trajectory.

By Wei-Cheng Lee, Francesco Orabona

arXiv Machine Learning

Sep 10

Constant-Stepsize Stochastic Approximation: Finite-Time Convergence, Gaussian Approximation, and Tail Bounds

arXiv:2602.13960v2 Announce Type: replace Abstract: Constant-stepsize stochastic approximation (SA) is widely used in learning for computational efficiency, yet the distribution of the iterates is ty...

By Zedong Wang, Yuyang Wang, Ijay Narang, Felix Wang, Yuzhou Wang, Siva Theja Maguluri

arXiv Machine Learning

Jul 2

Fast Score-Based Sampling via Log-Concave Reductions

arXiv:2512. 24152v2 Announce Type: replace-cross Abstract: Sampling based on score diffusions has led to striking empirical results, and has attracted considerable attention from various research communities.

By M. J. Wainwright

arXiv Machine Learning

Sep 14

Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise and H\"{o}lder Smoothness

arXiv:2609. 12785v1 Announce Type: new Abstract: Classical convergence guarantees for stochastic gradient methods typically assume Lipschitz-smooth objectives and finite-variance gradient noise, both frequently violated in practice.

By Misbah Uz Zaman, Anirbit Mukherjee

One email a morning, machine-written

Related stories

Accelerated Mixing Time of Randomized Hamiltonian Monte Carlo

Smoothed Picard Hamiltonian Monte Carlo

A Single Stepsize Suffices for Unprojected Linear TD(0): Simultaneous Robust and Fast Rates via Polyak--Ruppert Averaging

Constant-Stepsize Stochastic Approximation: Finite-Time Convergence, Gaussian Approximation, and Tail Bounds

Fast Score-Based Sampling via Log-Concave Reductions

Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise and H\"{o}lder Smoothness