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 条
  • [31] On sampling from a log-concave density using kinetic Langevin diffusions
    Dalalyan, Arnak S.
    Riou-Durand, Lionel
    BERNOULLI, 2020, 26 (03) : 1956 - 1988
  • [32] Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants
    Childs, Andrew M.
    Li, Tongyang
    Liu, Jin-Peng
    Wang, Chunhao
    Zhang, Ruizhe
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
  • [33] Sampling from Log-Concave Distributions with Infinity-Distance Guarantees
    Mangoubi, Oren
    Vishnoi, Nisheeth K.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [34] Efficient Sampling from Time-Varying Log-Concave Distributions
    Narayanan, Hariharan
    Rakhlin, Alexander
    JOURNAL OF MACHINE LEARNING RESEARCH, 2017, 18
  • [35] Automated generation of initial points for adaptive rejection sampling of log-concave distributions
    James, Jonathan
    STATISTICS AND COMPUTING, 2024, 34 (03)
  • [36] SAMPLING FROM LOG-CONCAVE DISTRIBUTIONS (vol 3, pg 812, 1994)
    Frieze, Alan
    Kannan, Ravi
    Polson, Nick
    ANNALS OF APPLIED PROBABILITY, 1994, 4 (04): : 1255 - 1255
  • [37] The query complexity of sampling from strongly log-concave distributions in one dimension
    Chewi, Sinho
    Gerber, Patrik
    Lu, Chen
    Le Gouic, Thibaut
    Rigollet, Philippe
    CONFERENCE ON LEARNING THEORY, VOL 178, 2022, 178
  • [38] Exact Hamiltonian Monte Carlo for Truncated Multivariate Gaussians
    Pakman, Ari
    Paninski, Liam
    JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2014, 23 (02) : 518 - 542
  • [40] Complex dynamic properties of Cournot duopoly games with convex and log-concave demand function
    Askar, S. S.
    OPERATIONS RESEARCH LETTERS, 2014, 42 (01) : 85 - 90