Ma Yi-An, Niladri S. Chatterji, Xiang Cheng, Nicolas, Flammarion, P. Bartlett, Michael I. Jordan
{"title":"Is there an analog of Nesterov acceleration for gradient-based MCMC?","authors":"Ma Yi-An, Niladri S. Chatterji, Xiang Cheng, Nicolas, Flammarion, P. Bartlett, Michael I. Jordan","doi":"10.3150/20-BEJ1297","DOIUrl":null,"url":null,"abstract":"We formulate gradient-based Markov chain Monte Carlo (MCMC) sampling as optimization on the space of probability measures, with Kullback–Leibler (KL) divergence as the objective functional. We show that an underdamped form of the Langevin algorithm performs accelerated gradient descent in this metric. To characterize the convergence of the algorithm, we construct a Lyapunov functional and exploit hypocoercivity of the underdamped Langevin algorithm. As an application, we show that accelerated rates can be obtained for a class of nonconvex functions with the Langevin algorithm.","PeriodicalId":55387,"journal":{"name":"Bernoulli","volume":"27 1","pages":"1942-1992"},"PeriodicalIF":1.5000,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bernoulli","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3150/20-BEJ1297","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 44
Abstract
We formulate gradient-based Markov chain Monte Carlo (MCMC) sampling as optimization on the space of probability measures, with Kullback–Leibler (KL) divergence as the objective functional. We show that an underdamped form of the Langevin algorithm performs accelerated gradient descent in this metric. To characterize the convergence of the algorithm, we construct a Lyapunov functional and exploit hypocoercivity of the underdamped Langevin algorithm. As an application, we show that accelerated rates can be obtained for a class of nonconvex functions with the Langevin algorithm.
期刊介绍:
BERNOULLI is the journal of the Bernoulli Society for Mathematical Statistics and Probability, issued four times per year. The journal provides a comprehensive account of important developments in the fields of statistics and probability, offering an international forum for both theoretical and applied work.
BERNOULLI will publish:
Papers containing original and significant research contributions: with background, mathematical derivation and discussion of the results in suitable detail and, where appropriate, with discussion of interesting applications in relation to the methodology proposed.
Papers of the following two types will also be considered for publication, provided they are judged to enhance the dissemination of research:
Review papers which provide an integrated critical survey of some area of probability and statistics and discuss important recent developments.
Scholarly written papers on some historical significant aspect of statistics and probability.