Research

Visit Google Scholar for a full list of publications

Recent papers

• When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?, [arXiv], Yuansi Chen, Khashayar Gatmiry
• A Simple Proof of the Mixing of Metropolis-Adjusted Langevin Algorithm under Smoothness and Isoperimetry, [arXiv], Yuansi Chen, Khashayar Gatmiry
• Hit-and-run mixing via localization schemes, [arXiv], Yuansi Chen, Ronen Eldan
• Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains, [arXiv], Yuansi Chen, Ronen Eldan
• Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling, [JMLR][arXiv], Keru Wu, Scott Schmidler, Yuansi Chen. Journal of Machine Learning Research (JMLR) 2022

Papers with code

• Log-concave sampling: Metropolis-Hastings algorithms are fast, [JMLR][arXiv][Code on Github], Yuansi Chen, Raaz Dwivedi, Martin Wainwright, Bin Yu. Journal of Machine Learning Research (JMLR) 2019
• Fast MCMC Algorithms on Polytopes, [JMLR][arXiv][C++ Implementation on Github], Yuansi Chen, Raaz Dwivedi, Martin Wainwright, Bin Yu. Journal of Machine Learning Research (JMLR) 2018
• Fast and Robust Archetypal Analysis for Representation Learning, [CVPR][arXiv][Code&Demo], Yuansi Chen, Julien Mairal and Zaid Harchaoui. IEEE Computer Vision and Pattern Recognition (CVPR) 2014