Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jason M. Altschuler, Kunal Talwar. Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling. In Gergely Neu, Lorenzo Rosasco, editors, The Thirty Sixth Annual Conference on Learning Theory, 12-15 July 2023, Bangalore, India. Volume 195 of Proceedings of Machine Learning Research, pages 2509-2510, PMLR, 2023. [doi]

This author has not been identified. Look up 'Jason M. Altschuler' in GoogleThis author has not been identified. Look up 'Kunal Talwar' in Google

runs on WebDSL