Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts
Abstract
References
Index Terms
- Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts
Recommendations
Sampling from a Log-Concave Distribution with Projected Langevin Monte Carlo
We extend the Langevin Monte Carlo (LMC) algorithm to compactly supported measures via a projection step, akin to projected stochastic gradient descent (SGD). We show that (projected) LMC allows to sample in polynomial time from a log-concave ...
Automated generation of initial points for adaptive rejection sampling of log-concave distributions
AbstractAdaptive rejection sampling requires that users provide points that span the distribution’s mode. If these points are far from the mode, it significantly increases computational costs. This paper introduces a simple, automated approach for ...
Query Lower Bounds for Log-concave Sampling
Log-concave sampling has witnessed remarkable algorithmic advances in recent years, but the corresponding problem of proving lower bounds for this task has remained elusive, with lower bounds previously known only in dimension one. In this work, we ...
Comments
Information & Contributors
Information
Published In
![cover image Journal of the ACM](/cms/asset/715bf66d-6d66-4411-bc17-fe9722d65148/3613558.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 160Total Downloads
- Downloads (Last 12 months)160
- Downloads (Last 6 weeks)33
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in