| Log-concave sampling: Metropolis-Hastings algorithms are fast! R Dwivedi, Y Chen, MJ Wainwright, B Yu The Journal of Machine Learning Research 20 (183), 1-42, 2019 | 276 | 2019 |
| Sampling can be faster than optimization YA Ma, Y Chen, C Jin, N Flammarion, MI Jordan Proceedings of the National Academy of Sciences 116 (42), 20881-20885, 2019 | 207 | 2019 |
| An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture Y Chen Geometric and Functional Analysis 31, 34-61, 2021 | 136 | 2021 |
| Fast and robust archetypal analysis for representation learning Y Chen, J Mairal, Z Harchaoui Proceedings of the IEEE Conference on Computer Vision and Pattern …, 2014 | 111 | 2014 |
| Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients Y Chen, R Dwivedi, MJ Wainwright, B Yu Journal of Machine Learning Research 21 (92), 1-71, 2020 | 101 | 2020 |
| Fast MCMC sampling algorithms on polytopes Y Chen, R Dwivedi, MJ Wainwright, B Yu Journal of Machine Learning Research 19 (55), 1-86, 2018 | 86 | 2018 |
| Localization schemes: A framework for proving mixing bounds for Markov chains Y Chen, R Eldan 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 71 | 2022 |
| Minimax mixing time of the Metropolis-adjusted Langevin algorithm for log-concave sampling K Wu, S Schmidler, Y Chen Journal of Machine Learning Research 23 (270), 1-63, 2022 | 50 | 2022 |
| Stability and convergence trade-off of iterative optimization algorithms Y Chen, C Jin, B Yu arXiv preprint arXiv:1804.01619, 2018 | 47 | 2018 |
| Domain adaptation under structural causal models Y Chen, P Bühlmann Journal of Machine Learning Research 22 (261), 1-80, 2021 | 42 | 2021 |
| The DeepTune framework for modeling and characterizing neurons in visual cortex area V4 R Abbasi-Asl, Y Chen, A Bloniarz, M Oliver, BDB Willmore, JL Gallant, ... bioRxiv, 465534, 2018 | 42* | 2018 |
| Vaidya walk: A sampling algorithm based on the volumetric barrier Y Chen, R Dwivedi, MJ Wainwright, B Yu 2017 55th Annual Allerton Conference on Communication, Control, and …, 2017 | 20 | 2017 |
| When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm? Y Chen, K Gatmiry arXiv preprint arXiv:2304.04724, 2023 | 8 | 2023 |
| Hit-and-run mixing via localization schemes Y Chen, R Eldan arXiv preprint arXiv:2212.00297, 2022 | 2 | 2022 |
| A Simple Proof of the Mixing of Metropolis-Adjusted Langevin Algorithm under Smoothness and Isoperimetry Y Chen, K Gatmiry arXiv preprint arXiv:2304.04095, 2023 | 1 | 2023 |
| Prominent Roles of Conditionally Invariant Components in Domain Adaptation: Theory and Algorithms K Wu, Y Chen, W Ha, B Yu arXiv preprint arXiv:2309.10301, 2023 | | 2023 |
| A Look at Robustness and Stability of 𝓁 1-versus 𝓁 0-Regularization Y Chen, A Taeb, P Bühlmann Statistical Science 35 (4), 614-622, 2020 | | 2020 |
| Log-concave sampling: Metropolis-Hastings algorithms are fast! R Dwivedi, Y Chen, MJ Wainwright, B Yu Conference on Learning Theory, 793-797, 2018 | | 2018 |
| Artificial neurons meet real neurons: pattern selectivity in V4 R Abbasi-Asl, Y Chen, A Bloniarz, JL Gallant, B Yu | | |
Bin YUProfessor of Statistics and EECS, UC BerkeleyVerified email at stat.berkeley.edu
