Yuansi Chen

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 20

Top Topics

Domain Adaptation

Dimensionality Reduction

Sampling Algorithm

Top Venues

J. Mach. Learn. Res.

Publications

Yuansi Chen, Khashayar Gatmiry
A Simple Proof of the Mixing of Metropolis-Adjusted Langevin Algorithm under Smoothness and Isoperimetry. CoRR (2023)
Keru Wu, Yuansi Chen, Wooseok Ha, Bin Yu
Prominent Roles of Conditionally Invariant Components in Domain Adaptation: Theory and Algorithms. CoRR (2023)
Yuansi Chen, Khashayar Gatmiry
When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm? CoRR (2023)
Yuansi Chen, Ronen Eldan
Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains (extended abstract). FOCS (2022)
Keru Wu, Scott C. Schmidler, Yuansi Chen
Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling. J. Mach. Learn. Res. 23 (2022)
Yuansi Chen, Ronen Eldan
Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains. CoRR (2022)
Yuansi Chen, Ronen Eldan
Hit-and-run mixing via localization schemes. CoRR (2022)
Yuansi Chen, Peter Bühlmann
Domain adaptation under structural causal models. J. Mach. Learn. Res. 22 (2021)
Keru Wu, Scott C. Schmidler, Yuansi Chen
Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling. CoRR (2021)
Yuansi Chen, Peter Bühlmann
Domain adaptation under structural causal models. CoRR (2020)
Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu
Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients. J. Mach. Learn. Res. 21 (2020)
Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu
Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients. CoRR (2019)
Raaz Dwivedi, Yuansi Chen, Martin J. Wainwright, Bin Yu
Log-concave sampling: Metropolis-Hastings algorithms are fast. J. Mach. Learn. Res. 20 (2019)
Yuansi Chen, Chi Jin, Bin Yu
Stability and Convergence Trade-off of Iterative Optimization Algorithms. CoRR (2018)
Yi-An Ma, Yuansi Chen, Chi Jin, Nicolas Flammarion, Michael I. Jordan
Sampling Can Be Faster Than Optimization. CoRR (2018)
Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu
Fast MCMC Sampling Algorithms on Polytopes. J. Mach. Learn. Res. 19 (2018)
Raaz Dwivedi, Yuansi Chen, Martin J. Wainwright, Bin Yu
Log-concave sampling: Metropolis-Hastings algorithms are fast! COLT (2018)
Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu
Vaidya walk: A sampling algorithm based on the volumetric barrier. Allerton (2017)
Yuansi Chen, Cengiz Pehlevan, Dmitri B. Chklovskii
Self-calibrating neural networks for dimensionality reduction. ACSSC (2016)
Yuansi Chen, Cengiz Pehlevan, Dmitri B. Chklovskii
Self-calibrating Neural Networks for Dimensionality Reduction. CoRR (2016)
Yuansi Chen, Julien Mairal, Zaïd Harchaoui
Fast and Robust Archetypal Analysis for Representation Learning. CoRR (2014)
Yuansi Chen, Julien Mairal, Zaïd Harchaoui
Fast and Robust Archetypal Analysis for Representation Learning. CVPR (2014)