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
来源
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 2023年 / 49卷 / 02期
关键词
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 条
  • [11] Query Lower Bounds for Log-concave Sampling
    Chewi, Sinho
    Pont, Jaume De Dios
    Li, Jerry
    Lu, Chen
    Narayanan, Shyam
    JOURNAL OF THE ACM, 2024, 71 (04)
  • [12] Online Sampling from Log-Concave Distributions
    Lee, Holden
    Mangoubi, Oren
    Vishnoi, Nisheeth K.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [13] The Randomized Midpoint Method for Log-Concave Sampling
    Shen, Ruoqi
    Lee, Yin Tat
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [14] Query lower bounds for log-concave sampling
    Chewi, Sinho
    Pont, Jaume de Dios
    Li, Jerry
    Lu, Chen
    Narayanan, Shyam
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 2139 - 2148
  • [15] ON LOG-CONCAVE AND LOG-CONVEX INFINITELY DIVISIBLE SEQUENCES AND DENSITIES
    HANSEN, BG
    ANNALS OF PROBABILITY, 1988, 16 (04): : 1832 - 1839
  • [16] Reliable simulation of extremely-truncated log-concave distributions
    di San Miniato, M. Lambardi
    Pagui, E. C. Kenne
    JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 2024, 94 (17) : 3933 - 3956
  • [17] Log-Sobolev inequalities and sampling from log-concave distributions
    Frieze, A
    Kannan, R
    ANNALS OF APPLIED PROBABILITY, 1999, 9 (01): : 14 - 26
  • [18] LOG-CONCAVE FUNCTIONS AND CONVEX INTERACTION TERMS FOR QUANTIZED FIELDS
    TARSKI, J
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1977, 10 (06): : L105 - L109
  • [19] Log-concave sampling: Metropolis-Hastings algorithms are fast
    Dwivedi, Raaz
    Chen, Yuansi
    Wainwright, Martin J.
    Yu, Bin
    JOURNAL OF MACHINE LEARNING RESEARCH, 2019, 20
  • [20] Complexity of zigzag sampling algorithm for strongly log-concave distributions
    Lu, Jianfeng
    Wang, Lihan
    STATISTICS AND COMPUTING, 2022, 32 (03)