Log-Concave Sampling on Compact Supports: A Versatile Proximal Framework
<|reference_start|>Log-Concave Sampling on Compact Supports: A Versatile Proximal Framework: In this paper, we explore sampling from strongly log-concave distributions defined on convex and compact supports. We propose a general proximal framework that involves projecting onto the constrained set, which is highly flexible and supports various projection options. Specifically, we consider the cases of Euclidean and Gauge projections, with the latter having the advantage of being performed efficiently using a membership oracle. This framework can be seamlessly integrated with multiple sampling methods. Our analysis focuses on Langevin-type sampling algorithms within the context of constrained sampling. We provide nonasymptotic upper bounds on the W1 and W2 errors, offering a detailed comparison of the performance of these methods in constrained sampling.<|reference_end|>
@article{yu2024log-concave,
    title={Log-Concave Sampling on Compact Supports: A Versatile Proximal Framework},
    author={Lu Yu},
    journal={arXiv preprint arXiv:2405.15379},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.15379},
    primaryClass={stat.ML cs.LG math.PR math.ST stat.TH}
}