Pliable rejection sampling

April 24, 2026 ยท Grace Period ยท ๐Ÿ› ICML 2016

โณ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Akram Erraqabi, Michal Valko, Alexandra Carpentier, Odalric-Ambrym Maillard arXiv ID 2604.22385 Category stat.ML: Machine Learning (Stat) Cross-listed cs.LG Citations 0 Venue ICML 2016
Abstract
Rejection sampling is a technique for sampling from difficult distributions. However, its use is limited due to a high rejection rate. Common adaptive rejection sampling methods either work only for very specific distributions or without performance guarantees. In this paper, we present pliable rejection sampling (PRS), a new approach to rejection sampling, where we learn the sampling proposal using a kernel estimator. Since our method builds on rejection sampling, the samples obtained are with high probability i.i.d. and distributed according to f. Moreover, PRS comes with a guarantee on the number of accepted samples.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning (Stat)

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

Layer Normalization

Jimmy Lei Ba, Jamie Ryan Kiros, Geoffrey E. Hinton

stat.ML ๐Ÿ› arXiv ๐Ÿ“š 12.0K cites 9 years ago