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 条
  • [21] Log-concave sampling: Metropolis-Hastings algorithms are fast
    Dwivedi, Raaz
    Chen, Yuansi
    Wainwright, Martin J.
    Yu, Bin
    Journal of Machine Learning Research, 2019, 20
  • [22] Complexity of zigzag sampling algorithm for strongly log-concave distributions
    Jianfeng Lu
    Lihan Wang
    Statistics and Computing, 2022, 32
  • [23] A Rejection Technique for Sampling from Log-Concave Multivariate Distributions
    Leydold, Josef
    ACM Transactions on Modeling and Computer Simulation, 1998, 8 (03): : 254 - 280
  • [24] Implicit Langevin Algorithms for Sampling From Log-concave Densities
    Hodgkinson, Liam
    Salomone, Robert
    Roosta, Fred
    JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22
  • [25] Implicit langevin algorithms for sampling from log-concave densities
    Hodgkinson, Liam
    Salomone, Robert
    Roosta, Fred
    Journal of Machine Learning Research, 2021, 22
  • [26] A NOTE ON INTEGRAL INEQUALITIES OF HADAMARD TYPE FOR LOG-CONVEX AND LOG-CONCAVE FUNCTIONS
    Yang, Gou-Sheng
    Tseng, Kuei-Lin
    Wang, Hung-Ta
    TAIWANESE JOURNAL OF MATHEMATICS, 2012, 16 (02): : 479 - 496
  • [27] Asymptotic shape of the convex hull of isotropic log-concave random vectors
    Giannopoulos, Apostolos
    Hioni, Labrini
    Tsolomitis, Antonis
    ADVANCES IN APPLIED MATHEMATICS, 2016, 75 : 116 - 143
  • [28] GEOMETRY OF THE Lq-CENTROID BODIES OF AN ISOTROPIC LOG-CONCAVE MEASURE
    Giannopoulos, Apostolos
    Stavrakakis, Pantelis
    Tsolomitis, Antonis
    Vritsiou, Beatrice-Helen
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2015, 367 (07) : 4569 - 4593
  • [29] Theoretical guarantees for approximate sampling from smooth and log-concave densities
    Dalalyan, Arnak S.
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 2017, 79 (03) : 651 - 676
  • [30] Efficient Sampling of Non Log-Concave Posterior Distributions With Mixture of Noises
    Palud, Pierre
    Thouvenin, Pierre-Antoine
    Chainais, Pierre
    Bron, Emeric
    Le Petit, Franck
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2023, 71 : 2491 - 2501