{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T04:13:28Z","timestamp":1781324008439,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1563838, CCF-1717349 and CCF-1740551"],"award-info":[{"award-number":["CCF-1563838, CCF-1717349 and CCF-1740551"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188774","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"1115-1121","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation"],"prefix":"10.1145","author":[{"given":"Yin Tat","family":"Lee","sequence":"first","affiliation":[{"name":"University of Washington, USA \/ Microsoft Research, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Santosh S.","family":"Vempala","sequence":"additional","affiliation":[{"name":"Georgia Tech, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103439"},{"key":"e_1_3_2_2_2_1","volume-title":"A Conceptual Introduction to Hamiltonian Monte Carlo. ArXiv e-prints (Jan","author":"Betancourt M.","year":"2017","unstructured":"M. Betancourt . 2017. A Conceptual Introduction to Hamiltonian Monte Carlo. ArXiv e-prints (Jan . 2017 ). arXiv: stat.ME\/1701.02434 M. Betancourt. 2017. A Conceptual Introduction to Hamiltonian Monte Carlo. ArXiv e-prints (Jan. 2017). arXiv: stat.ME\/1701.02434"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746563"},{"key":"e_1_3_2_2_4_1","volume-title":"Proc. of AMS Symposium on Probabilistic Combinatorics and Its Applications. 123\u2013170","author":"Dyer M. E.","unstructured":"M. E. Dyer and A. M. Frieze . 1991. Computing the volume of a convex body: a case where randomness provably helps . In Proc. of AMS Symposium on Probabilistic Combinatorics and Its Applications. 123\u2013170 . M. E. Dyer and A. M. Frieze. 1991. Computing the volume of a convex body: a case where randomness provably helps. In Proc. of AMS Symposium on Probabilistic Combinatorics and Its Applications. 123\u2013170."},{"key":"e_1_3_2_2_5_1","unstructured":"M. E. Dyer A. M. Frieze and R. Kannan. 1989.  M. E. Dyer A. M. Frieze and R. Kannan. 1989."},{"key":"e_1_3_2_2_6_1","volume-title":"STOC. 375\u2013381. Convergence of RHMC STOC\u201918, June 25\u201329","author":"Time A Random Polynomial","year":"2018","unstructured":"A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies . In STOC. 375\u2013381. Convergence of RHMC STOC\u201918, June 25\u201329 , 2018 , Los Angeles, CA , USA A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. In STOC. 375\u2013381. Convergence of RHMC STOC\u201918, June 25\u201329, 2018, Los Angeles, CA, USA"},{"key":"e_1_3_2_2_7_1","unstructured":"Mark Girolami and Ben Calderhead. 2011.  Mark Girolami and Ben Calderhead. 2011."},{"key":"e_1_3_2_2_8_1","volume-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology) 73, 2","author":"Langevin Riemann","year":"2011","unstructured":"Riemann manifold Langevin and Hamiltonian Monte Carlo methods. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 73, 2 ( 2011 ), 123\u2013214. 9868. 2010.00765.x Riemann manifold Langevin and Hamiltonian Monte Carlo methods. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 73, 2 (2011), 123\u2013214. 9868. 2010.00765.x"},{"key":"e_1_3_2_2_9_1","unstructured":"M. Girolami B. Calderhead and S. A. Chin. 2009. Riemannian Manifold Hamiltonian Monte Carlo. ArXiv e-prints (July 2009). arXiv: stat.CO\/0907.1100  M. Girolami B. Calderhead and S. A. Chin. 2009. Riemannian Manifold Hamiltonian Monte Carlo. ArXiv e-prints (July 2009). arXiv: stat.CO\/0907.1100"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199708)11:1%3C1::AID-RSA1%3E3.0.CO;2-X"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536491"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_2_2_13_1","volume-title":"Eldan\u2019s Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for Expansion. CoRR abs\/1612.01507","author":"Lee Yin Tat","year":"2016","unstructured":"Yin Tat Lee and Santosh Srinivas Vempala . 2016. Eldan\u2019s Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for Expansion. CoRR abs\/1612.01507 ( 2016 ). http:\/\/arxiv.org\/abs\/1612.01507 Yin Tat Lee and Santosh Srinivas Vempala. 2016. Eldan\u2019s Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for Expansion. CoRR abs\/1612.01507 (2016). http:\/\/arxiv.org\/abs\/1612.01507"},{"key":"e_1_3_2_2_14_1","volume-title":"Vempala","author":"Lee Yin Tat","year":"2016","unstructured":"Yin Tat Lee and Santosh S . Vempala . 2016 . Geodesic Walks in Polytopes. CoRR abs\/1606.04696 (2016). http:\/\/arxiv.org\/abs\/1606.04696 Yin Tat Lee and Santosh S. Vempala. 2016. Geodesic Walks in Polytopes. CoRR abs\/1606.04696 (2016). http:\/\/arxiv.org\/abs\/1606.04696"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.96"},{"key":"e_1_3_2_2_16_1","first-page":"138","article-title":"How to compute the volume? Jber. d. Dt. Math.-Verein","volume":"1990","author":"Lov\u00e1sz L.","year":"1990","unstructured":"L. Lov\u00e1sz . 1990 . How to compute the volume? Jber. d. Dt. Math.-Verein , Jubil\u00e4umstagung 1990 (1990), 138 \u2013 151 . L. Lov\u00e1sz. 1990. How to compute the volume? Jber. d. Dt. Math.-Verein, Jubil\u00e4umstagung 1990 (1990), 138\u2013151.","journal-title":"Jubil\u00e4umstagung"},{"key":"e_1_3_2_2_17_1","unstructured":"L. Lov\u00e1sz and M. Simonovits. 1990. Mixing rate of Markov chains an isoperimetric inequality and computing the volume. In ROCS. 482\u2013491.  L. Lov\u00e1sz and M. Simonovits. 1990. Mixing rate of Markov chains an isoperimetric inequality and computing the volume. In ROCS. 482\u2013491."},{"key":"e_1_3_2_2_18_1","unstructured":"L. Lov\u00e1sz and M. Simonovits. 1993.  L. Lov\u00e1sz and M. Simonovits. 1993."},{"key":"e_1_3_2_2_19_1","volume-title":"Random Structures and Alg.","author":"Random","unstructured":"Random walks in a convex body and an improved volume algorithm. In Random Structures and Alg. , Vol. 4 . 359\u2013412. Random walks in a convex body and an improved volume algorithm. In Random Structures and Alg., Vol. 4. 359\u2013412."},{"key":"e_1_3_2_2_20_1","unstructured":"L. Lov\u00e1sz and S. Vempala. 2006.  L. Lov\u00e1sz and S. Vempala. 2006."},{"key":"e_1_3_2_2_21_1","unstructured":"Fast Algorithms for Logconcave Functions: sampling Rounding Integration and Optimization. In FOCS. 57\u201368.  Fast Algorithms for Logconcave Functions: sampling Rounding Integration and Optimization. In FOCS. 57\u201368."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970544727X"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.08.004"},{"key":"e_1_3_2_2_24_1","unstructured":"L. Lov\u00e1sz and S. Vempala. 2007.  L. Lov\u00e1sz and S. Vempala. 2007."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v30:3"},{"key":"e_1_3_2_2_26_1","volume-title":"Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributions. arXiv preprint arXiv:1708.07114","author":"Mangoubi Oren","year":"2017","unstructured":"Oren Mangoubi and Aaron Smith . 2017. Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributions. arXiv preprint arXiv:1708.07114 ( 2017 ). Oren Mangoubi and Aaron Smith. 2017. Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributions. arXiv preprint arXiv:1708.07114 (2017)."},{"key":"e_1_3_2_2_27_1","unstructured":"R.M. Neal. 1996.  R.M. Neal. 1996."},{"key":"e_1_3_2_2_28_1","unstructured":"Bayesian Learning for Neural Networks. Springer New York.   Bayesian Learning for Neural Networks. Springer New York."},{"key":"e_1_3_2_2_29_1","unstructured":"Radford M. Neal. 2010.  Radford M. Neal. 2010."},{"key":"e_1_3_2_2_30_1","volume-title":"Handbook of Markov Chain Monte Carlo 54","author":"Using Hamiltonian Dynamics MCMC","year":"2010","unstructured":"MCMC Using Hamiltonian Dynamics . Handbook of Markov Chain Monte Carlo 54 ( 2010 ), 113\u2013162. Abstract 1 Introduction 1.1 Results 1.2 Approach and Contributions 1.3 Practicality 2 Basics of Hamiltonian Monte Carlo 2.1 Hamiltonian Monte Carlo on Riemannian Manifolds 3 Convergence of Riemannian Hamiltonian Monte Carlo 4 Polytope volume computation: Gaussian cooling on manifolds References MCMC Using Hamiltonian Dynamics. Handbook of Markov Chain Monte Carlo 54 (2010), 113\u2013162. Abstract 1 Introduction 1.1 Results 1.2 Approach and Contributions 1.3 Practicality 2 Basics of Hamiltonian Monte Carlo 2.1 Hamiltonian Monte Carlo on Riemannian Manifolds 3 Convergence of Riemannian Hamiltonian Monte Carlo 4 Polytope volume computation: Gaussian cooling on manifolds References"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188774","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188774","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:08Z","timestamp":1750212428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":30,"alternative-id":["10.1145\/3188745.3188774","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188774","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}