Chewi, Sinho, Gerber, Patrik R., Lu, Chen, Le Gouic, Thibaut, and Rigollet, Philippe. The query complexity of sampling from strongly log-concave distributions in one dimension. Retrieved from https://par.nsf.gov/biblio/10342221. Proceedings of Thirty Fifth Conference on Learning Theory 178.
Chewi, Sinho, Gerber, Patrik R., Lu, Chen, Le Gouic, Thibaut, & Rigollet, Philippe. The query complexity of sampling from strongly log-concave distributions in one dimension. Proceedings of Thirty Fifth Conference on Learning Theory, 178 (). Retrieved from https://par.nsf.gov/biblio/10342221.
Chewi, Sinho, Gerber, Patrik R., Lu, Chen, Le Gouic, Thibaut, and Rigollet, Philippe.
"The query complexity of sampling from strongly log-concave distributions in one dimension". Proceedings of Thirty Fifth Conference on Learning Theory 178 (). Country unknown/Code not available. https://par.nsf.gov/biblio/10342221.
@article{osti_10342221,
place = {Country unknown/Code not available},
title = {The query complexity of sampling from strongly log-concave distributions in one dimension},
url = {https://par.nsf.gov/biblio/10342221},
abstractNote = {},
journal = {Proceedings of Thirty Fifth Conference on Learning Theory},
volume = {178},
author = {Chewi, Sinho and Gerber, Patrik R. and Lu, Chen and Le Gouic, Thibaut and Rigollet, Philippe},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.