On Convergence of the Alternating Directions SGHMC Algorithm

Soumyadip Ghosh, Yingdong Lu, Tomasz Nowicki
5/21/2024
math.STcs.LGmath.PR

No confident code implementation found for this paper.

Abstract

We study convergence rates of Hamiltonian Monte Carlo (HMC) algorithms with leapfrog integration under mild conditions on stochastic gradient oracle for the target distribution (SGHMC). Our method extends standard HMC by allowing the use of general auxiliary distributions, which is achieved by a novel procedure of Alternating Directions. The convergence analysis is based on the investigations of the Dirichlet forms associated with the underlying Markov chain driving the algorithms. For this purpose, we provide a detailed analysis on the error of the leapfrog integrator for Hamiltonian motions with both the kinetic and potential energy functions in general form. We characterize the explicit dependence of the convergence rates on key parameters such as the problem dimension, functional properties of both the target and auxiliary distributions, and the quality of the oracle.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ghosh2024convergence,
  title  = {On Convergence of the Alternating Directions SGHMC Algorithm},
  author = {Soumyadip Ghosh and Yingdong Lu and Tomasz Nowicki},
  year   = {2024},
  eprint = {2405.13140},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.13140v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.13140.svg)](https://codeofpaper.com/paper/2405.13140)

Discussion