Sampling is a fundamental and arguably very important task with numerous applications in Machine Learning. One approach to sample from a high dimensional distribution $e^{-f}$ for some function $f$ is the Langevin Algorithm (LA). Recently, there has been a lot of progress in showing fast convergence of LA even in cases where $f$ is non-convex, notably [53], [39] in which the former paper focuses on functions $f$ defined in $\mathbb{R}^n$ and the latter paper focuses on functions with symmetries (like matrix completion type objectives) with manifold structure. Our work generalizes the results of [53] where $f$ is defined on a manifold $M$ rather than $\mathbb{R}^n$. From technical point of view, we show that KL decreases in a geometric rate whenever the distribution $e^{-f}$ satisfies a log-Sobolev inequality on $M$.
When Langevin Monte Carlo Meets Randomization: New Sampling Algorithms with Non-asymptotic Error Bounds beyond Log-Concavity and Gradient Lipschitzness
School of Mathematics and Statistics, HNP-LAMA, Central South University(数学与统计学院,HNP-LAMA,中南大学)
Propagation of Chaos for Mean-Field Langevin Dynamics and its Application to Model Ensemble
Nanyang Technological University(南洋理工大学);National University of Singapore(新加坡国立大学);Kyushu Institute of Technology(九州理工学院);The University of Tokyo(东京大学);RIKEN Center for Advanced Intelligence Project(理化学研究所先进人工智能项目中心)
Isoperimetry is All We Need: Langevin Posterior Sampling for RL with Sublinear Regret
Chalmers University of Technology(查尔姆斯理工大学);University of Gothenburg(哥德堡大学);University of Oslo(奥斯陆大学);Univ. Lille, Inria, CNRS, Centrale Lille, UMR 9189 – CRIStAL(里尔大学、法国国家信息与自动化研究所、法国国家科学研究中心、里尔中央理工大学、UMR 9189 – CRIStAL)
Langevin-Informed Transfer Learning: Replacing Target Samples by Black-Box Feedback
Istituto Italiano di Tecnologia(意大利理工学院);University of Novi Sad(诺维萨德大学);CMAP-Ecole Polytechnique(巴黎综合理工学院应用数学中心);Télécom Sud-Paris(巴黎南电信学院);Université Paris Nanterre(巴黎南泰尔大学);University College London(伦敦大学学院)
Athena/Archimedes Research Centre(雅典娜/阿基米德研究中心);The University of Edinburgh(爱丁堡大学);Univ. Grenoble Alpes(格勒诺布尔大学);CNRS(法国国家科学研究中心);Inria(法国国家信息与自动化研究所);Grenoble INP(格勒诺布尔工业大学);LIG(格勒诺布尔信息与信号处理实验室)
Penalized Nonreversible Langevin for Constrained Sampling
Department of Mathematics, Florida State University, Tallahassee, Florida, United States of America(美利坚合众国佛罗里达州塔拉哈西市佛罗里达州立大学数学系);FinTech Thrust, Hong Kong University of Science and Technology (Guangzhou), Guangzhou, Guangdong, People’s Republic of China(中华人民共和国广东省广州市香港科技大学(广州)金融科技方向)
Improved Analysis for Hessian-free High-resolution Monte Carlo Sampling
School of Mathematics and Statistics, Donghua University(东华大学数学与统计学院);Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州));School of Mathematical Sciences, Fudan University(复旦大学数学科学学院);Department of Mathematics, Florida State University(佛罗里达州立大学数学系)
Sampling from the Mean-Field Stationary Distribution
Institute for Advanced Study(高等研究院);University of Toronto(多伦多大学);Vector Institute(矢量研究所);Princeton University(普林斯顿大学);Georgia Institute of Technology(佐治亚理工学院)