 Query lower bounds for log-concave samplingIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 |
 Towards a Complete Analysis of Langevin Monte Carlo: Beyond Poincaré
InequalityAnnual Conference Computational Learning Theory (COLT), 2023 |
 Fisher information lower bounds for samplingInternational Conference on Algorithmic Learning Theory (ALT), 2022 |
 Lower Bounds on Metropolized Sampling Methods for Well-Conditioned
DistributionsNeural Information Processing Systems (NeurIPS), 2021 |
 The query complexity of sampling from strongly log-concave distributions
in one dimensionAnnual Conference Computational Learning Theory (COLT), 2021 |
