Scholars@Duke

• Background
• 

  Education, Training, & Certifications

  • Ph.D., University of California - Berkeley 2019
  • B.S., Ecole Polytechnique (France) 2013
• Recognition
• 

  In the News

  • FEB 16, 2023

    Trinity College of Arts and Sciences

    Two Trinity Faculty Named 2023 Sloan Research Fellows

  • MAR 1, 2021

    Statistics Postdoc Tames Decades-Old Geometry Problem
• Expertise
• 

  Subject Headings

  • Muser Mentor
• Research
• 

  Selected Grants

  • CAREER: Towards Tight Guarantees of Approximate Markov Chain Sampling Algorithms in High Dimensional Statistical Inference awarded by  National Science Foundation 2023 - 2028
• Publications & Artistic Works
• 

  Selected Publications

  • Academic Articles

    • Wu, Keru, Scott Schmidler, and Yuansi Chen. “Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling.” Vol. 23 (September 27, 2021): 1–63.
       Link to Item
    • Chen, Yuansi. “An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture,” November 27, 2020.
       Link to Item
    • Chen, Yuansi, and Peter Bühlmann. “Domain adaptation under structural causal models,” October 29, 2020.
       Link to Item
    • Ma, Yi-An, Yuansi Chen, Chi Jin, Nicolas Flammarion, and Michael I. Jordan. “Sampling can be faster than optimization.” Proceedings of the National Academy of Sciences of the United States of America 116, no. 42 (October 2019): 20881–85. https://doi.org/10.1073/pnas.1820003116.
       Full Text
    • Chen, Yuansi, Raaz Dwivedi, Martin J. Wainwright, and Bin Yu. “Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients,” May 29, 2019.
       Link to Item
    • Abbasi-Asl, Reza, Yuansi Chen, Adam Bloniarz, Michael Oliver, Ben D. B. Willmore, Jack L. Gallant, and Bin Yu. “The DeepTune framework for modeling and characterizing neurons in visual cortex area V4,” November 9, 2018. https://doi.org/10.1101/465534.
       Full Text
    • Chen, Yuansi, Chi Jin, and Bin Yu. “Stability and Convergence Trade-off of Iterative Optimization Algorithms,” April 4, 2018.
       Link to Item
    • Dwivedi, Raaz, Yuansi Chen, Martin J. Wainwright, and Bin Yu. “Log-concave sampling: Metropolis-Hastings algorithms are fast.” Journal of Machine Learning Research, 2019, January 8, 2018.
       Link to Item
    • Chen, Yuansi, Raaz Dwivedi, Martin J. Wainwright, and Bin Yu. “Fast MCMC sampling algorithms on polytopes.” The Journal of Machine Learning Research 19 (October 23, 2017): 2146–2231.
       Link to Item

  • Preprints

    • Chen, Yuansi, and Khashayar Gatmiry. “When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?,” April 10, 2023.
       Link to Item
    • Chen, Yuansi, and Khashayar Gatmiry. “A Simple Proof of the Mixing of Metropolis-Adjusted Langevin Algorithm under Smoothness and Isoperimetry,” April 8, 2023.
       Link to Item
    • Chen, Yuansi, and Ronen Eldan. “Hit-and-run mixing via localization schemes,” December 1, 2022.
       Link to Item
    • Chen, Yuansi, and Ronen Eldan. “Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains,” March 8, 2022.
       Link to Item
• Teaching & Mentoring
• 

  Recent Courses

  • STA 391: Independent Study 2023
  • STA 732: Statistical Inference 2023
  • STA 391: Independent Study 2022
  • STA 521L: Predictive Modeling and Statistical Learning 2022
  • STA 693: Research Independent Study 2022
  • STA 732: Statistical Inference 2022
  • STA 995: Internship 2022
  • STA 521L: Predictive Modeling and Statistical Learning 2021
  • STA 693: Research Independent Study 2021
  • STA 995: Internship 2021

Some information on this profile has been compiled automatically from Duke databases and external sources. (Our About page explains how this works.) If you see a problem with the information, please write to Scholars@Duke and let us know. We will reply promptly.