Fetching the paper…
Reading the bibliography…
We study the convergence rate of discretized Riemannian Hamiltonian Monte Carlo on sampling from distributions in the form of $e^{-f(x)}$ on a convex body $\mathcal{M}\subset\mathbb{R}^{n}$.
Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions
Robert L Smith · 1984
Earlier work this paper cites.
Random walks in a convex body and an improved volume algorithm
László Lovász and Miklós Simonovits · 1993
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming
Yurii Nesterov and Arkadii Nemirovskii · 1994
Earlier work this paper cites.
A new algorithm for minimizing convex functions over convex sets
Pravin M Vaidya · 1996
Earlier work this paper cites.
Random walks and an O ∗ ( n 5 ) O^{*}(n^{5}) volume algorithm for convex bodies
Ravi Kannan, László Lovász, and Miklós Simonovits · 1997
Earlier work this paper cites.
Hit-and-run mixes fast
László Lovász · 1999
Earlier work this paper cites.
On the Riemannian geometry defined by self-concordant barriers and interior-point methods
Yurii E Nesterov, Michael J Todd, et al · 2002
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Yurii Nesterov · 2003
Earlier work this paper cites.
Geometric random walks: a survey
Santosh Vempala · 2005
Earlier work this paper cites.
Geometric numerical integration
Ernst Hairer, Marlis Hochbruck, Arieh Iserles, and Christian Lubich · 2006
Earlier work this paper cites.
Simulated annealing for convex optimization
Adam Tauman Kalai and Santosh Vempala · 2006
Earlier work this paper cites.
The geometry of logconcave functions and sampling algorithms
László Lovász and Santosh Vempala · 2007
Earlier work this paper cites.
Riemann manifold Langevin and Hamiltonian Monte Carlo methods
Mark Girolami and Ben Calderhead · 2011
Earlier work this paper cites.
Random walks on polytopes and an affine interior point method for linear programming
Ravindran Kannan and Hariharan Narayanan · 2012
Earlier work this paper cites.
Constraining the metabolic genotype–phenotype relationship using a phylogeny of in silico methods
Nathan E Lewis, Harish Nagarajan, and Bernhard O Palsson · 2012
Earlier work this paper cites.
Van Hoang Nguyen · 2013
Earlier work this paper cites.
A community-driven global reconstruction of human metabolism
Ines Thiele, Neil Swainston, Ronan MT Fleming, Andreas Hoppe, Swagatika Sahoo, Maike K Aurich, Hulda Haraldsdottir, Monica L Mo, Ottar Rolfsson, Miranda D Stobbe, et al · 2013
Cited alongside, same era.
Path finding methods for linear programming: Solving linear programs in O ( rank ) O(\sqrt{\text{rank}}) iterations and faster algorithms for maximum flow
Yin Tat Lee and Aaron Sidford · 2014
Cited alongside, same era.
A practical volume algorithm
Ben Cousins and Santosh Vempala · 2016
Cited alongside, same era.
BiGG Models: A platform for integrating, standardizing and sharing genome-scale models
Zachary A King, Justin Lu, Andreas Dräger, Philip Miller, Stephen Federowicz, Joshua A Lerman, Ali Ebrahim, Bernhard O Palsson, and Nathan E Lewis · 2016
Cited alongside, same era.
Probabilistic programming in Python using PyMC3
John Salvatier, Thomas V Wiecki, and Christopher Fonnesbeck · 2016
Cited alongside, same era.
Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients
Yuansi Chen, Raaz Dwivedi, Martin J Wainwright, and Bin Yu · 2020
Later among the works it cites.
Strong self-concordance and sampling
Aditi Laddha, Yin Tat Lee, and Santosh Vempala · 2020
Later among the works it cites.
Logsmooth gradient concentration and tighter runtimes for metropolized Hamiltonian Monte Carlo
Yin Tat Lee, Ruoqi Shen, and Kevin Tian · 2020
Later among the works it cites.
RStan: the R interface to Stan, 2020
Stan Development Team · 2020
Later among the works it cites.
Wasserstein control of mirror Langevin Monte Carlo
Kelvin Shuangjian Zhang, Gabriel Peyré, Jalal Fadili, and Marcelo Pereyra · 2020
Later among the works it cites.
Efficient constrained sampling via the mirror-Langevin algorithm
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent
Arnak Dalalyan · 2017
Cited alongside, same era.
Geodesic walks in polytopes
Yin Tat Lee and Santosh S Vempala · 2017
Cited alongside, same era.
Underdamped Langevin MCMC: a non-asymptotic analysis
Xiang Cheng, Niladri S Chatterji, Peter L Bartlett, and Michael I Jordan · 2018
Cited alongside, same era.
Log-concave sampling: Metropolis-Hastings algorithms are fast!
Raaz Dwivedi, Yuansi Chen, Martin J Wainwright, and Bin Yu · 2018
Cited alongside, same era.
Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
Yin Tat Lee and Santosh S Vempala · 2018
Cited alongside, same era.
Pyro: Deep Universal Probabilistic Programming
Eli Bingham, Jonathan P. Chen, Martin Jankowiak, Fritz Obermeyer, Neeraj Pradhan, Theofanis Karaletsos, Rohit Singh, Paul A. Szerlip, Paul Horsfall, and Noah D. Goodman · 2019
Cited alongside, same era.
Adam D Cobb, Atılım Güneş Baydin, Andrew Markham, and Stephen J Roberts · 2019
Cited alongside, same era.
Kwangjun Ahn and Sinho Chewi · 2021
Later among the works it cites.
Optimal dimension dependence of the Metropolis-adjusted Langevin algorithm
Sinho Chewi, Chen Lu, Kwangjun Ahn, Xiang Cheng, Thibaut Le Gouic, and Philippe Rigollet · 2021
Later among the works it cites.
Mirror Langevin Monte Carlo: the case under isoperimetry
Qijia Jiang · 2021
Later among the works it cites.
Reducing isotropy and volume to KLS: an O ∗ ( n 3 ψ 2 ) O^{*}(n^{3}\psi^{2}) volume algorithm
He Jia, Aditi Laddha, Yin Tat Lee, and Santosh Vempala · 2021
Later among the works it cites.
Analysis of Langevin Monte Carlo from Poincaré to Log-Sobolev
Sinho Chewi, Murat A Erdogdu, Mufan Li, Ruoqi Shen, and Shunshi Zhang · 2022
Closest in time.
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions
Zongchen Chen and Santosh S Vempala · 2022
Closest in time.
Convergence of the Riemannian Langevin Algorithm
Khashayar Gatmiry and Santosh S Vempala · 2022
Closest in time.
Sampling with Riemannian Hamiltonian Monte Carlo in a Constrained Space
Yunbum Kook, YinTat Lee, Ruoqi Shen, and Santosh Vempala · 2022
Closest in time.
The mirror Langevin algorithm converges with vanishing bias
Ruilin Li, Molei Tao, Santosh S Vempala, and Andre Wibisono · 2022
Closest in time.
The manifold joys of sampling
Yin Tat Lee and Santosh S Vempala · 2022
Closest in time.