Truncated Log-concave Sampling for Convex Bodies with Reflective Hamiltonian Monte Carlo

被引:6
|
作者
Chalkis, Apostolos [1 ]
Fisikopoulos, Vissarion [1 ]
Papachristou, Marios [2 ]
Tsigaridas, Elias [3 ]
机构
[1] Natl Kapodistrian Univ Athens, Dept Telemat & Telecommun, Panepistimiopolis, Athens 15784, Greece
[2] 302 Gates Hall,107 Hoy Rd, Ithaca, NY USA
[3] Case courrier 247, Pl Jussieu, F-75252 Paris 05, France
来源
关键词
Statistical software; truncated sampling; geometric random walks; experiments; mixing time; HIT-AND-RUN; LANGEVIN; MODELS; VOLUME; MCMC;
D O I
10.1145/3589505
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We introduce Reflective Hamiltonian Monte Carlo (ReHMC), an HMC-based algorithm to sample from a log-concave distribution restricted to a convex body. The random walk is based on incorporating reflections to the Hamiltonian dynamics such that the support of the target density is the convex body. We develop an efficient open source implementation of ReHMC and perform an experimental study on various high-dimensional datasets. The experiments suggest that ReHMC outperforms Hit-and-Run and Coordinate-Hit-and-Run regarding the time it needs to produce an independent sample, introducing practical truncated sampling in thousands of dimensions.
引用
收藏
页数:25
相关论文
共 50 条
  • [41] A convex/log-concave correlation inequality for Gaussian measure and an application to abstract Wiener spaces
    Hargé, G
    PROBABILITY THEORY AND RELATED FIELDS, 2004, 130 (03) : 415 - 440
  • [42] Nested Sampling with Constrained Hamiltonian Monte Carlo
    Betancourt, Michael
    BAYESIAN INFERENCE AND MAXIMUM ENTROPY METHODS IN SCIENCE AND ENGINEERING, 2010, 1305 : 165 - 172
  • [43] A convex/log-concave correlation inequality for Gaussian measure and an application to abstract Wiener spaces
    Gilles Hargé
    Probability Theory and Related Fields, 2004, 130 : 415 - 440
  • [44] On Using Hamiltonian Monte Carlo Sampling for RL
    Madhushani, Udari
    Dey, Biswadip
    Leonard, Naomi Ehrich
    Chakraborty, Amit
    2022 IEEE 61ST CONFERENCE ON DECISION AND CONTROL (CDC), 2022, : 6640 - 6645
  • [45] Faster high-accuracy log-concave sampling via algorithmic warm starts
    Altschuler, Jason M.
    Chewi, Sinho
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 2169 - 2176
  • [46] Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling
    Wu, Keru
    Schmidler, Scott
    Chen, Yuansi
    JOURNAL OF MACHINE LEARNING RESEARCH, 2022, 23 : 1 - 63
  • [47] Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts
    Altschuler, Jason M.
    Chewi, Sinho
    JOURNAL OF THE ACM, 2024, 71 (03)
  • [48] Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling
    Altschuler, Jason M.
    Talwar, Kunal
    THIRTY SIXTH ANNUAL CONFERENCE ON LEARNING THEORY, VOL 195, 2023, 195
  • [49] Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling
    Wu, Keru
    Schmidler, Scott
    Chen, Yuansi
    Journal of Machine Learning Research, 2022, 23
  • [50] Towards Unifying Hamiltonian Monte Carlo and Slice Sampling
    Zhang, Yizhe
    Wang, Xiangyu
    Chen, Changyou
    Henao, Ricardo
    Fan, Kai
    Carin, Lawrence
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016), 2016, 29