skip to main content


Title: The query complexity of sampling from strongly log-concave distributions in one dimension
Award ID(s):
2022448 1740751 1838071
NSF-PAR ID:
10342221
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
Proceedings of Thirty Fifth Conference on Learning Theory
Volume:
178
Page Range / eLocation ID:
2041--2059
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found