| Accelerating asymptotically exact MCMC for computationally intensive models via local approximations PR Conrad, YM Marzouk, NS Pillai, A Smith Journal of the American Statistical Association 111 (516), 1591-1607, 2016 | 146 | 2016 |
| Rapid mixing of Hamiltonian Monte Carlo on strongly log-concave distributions O Mangoubi, A Smith arXiv preprint arXiv:1708.07114, 2017 | 114 | 2017 |
| MCMC for imbalanced categorical data JE Johndrow, A Smith, N Pillai, DB Dunson Journal of the American Statistical Association, 2019 | 104* | 2019 |
| The use of a single pseudo-sample in approximate Bayesian computation L Bornn, NS Pillai, A Smith, D Woodard Statistics and Computing 27 (3), 583-590, 2017 | 70* | 2017 |
| Ergodicity of approximate MCMC chains with applications to large data sets NS Pillai, A Smith arXiv preprint arXiv:1405.0182, 2014 | 59 | 2014 |
| Parallel local approximation MCMC for expensive models PR Conrad, AD Davis, YM Marzouk, NS Pillai, A Smith SIAM/ASA Journal on Uncertainty Quantification 6 (1), 339-373, 2018 | 46 | 2018 |
| Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities? O Mangoubi, NS Pillai, A Smith arXiv preprint arXiv:1808.03230, 2018 | 40 | 2018 |
| Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions 2: Numerical integrators O Mangoubi, A Smith The 22nd international conference on artificial intelligence and statistics …, 2019 | 39 | 2019 |
| Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: Continuous dynamics O Mangoubi, A Smith The Annals of Applied Probability 31 (5), 2019-2045, 2021 | 34 | 2021 |
| Rapid mixing of geodesic walks on manifolds with positive curvature O Mangoubi, A Smith The Annals of Applied Probability 28 (4), 2501-2543, 2018 | 34 | 2018 |
| A Gibbs sampler on the -simplex A Smith | 32 | 2014 |
| Kac’s walk on -sphere mixes in steps NS Pillai, A Smith | 29 | 2017 |
| No free lunch for approximate MCMC JE Johndrow, NS Pillai, A Smith arXiv preprint arXiv:2010.12514, 2020 | 27 | 2020 |
| On the mixing time of Kac’s walk and other high-dimensional Gibbs samplers with constraints NS Pillai, A Smith The Annals of Probability 46 (4), 2345-2399, 2018 | 19 | 2018 |
| Fast and memory-optimal dimension reduction using Kac’s walk V Jain, NS Pillai, A Sah, M Sawhney, A Smith The Annals of Applied Probability 32 (5), 4038-4064, 2022 | 17* | 2022 |
| Mixing times for a constrained Ising process on the torus at low density NS Pillai, A Smith | 16 | 2017 |
| Explicit Yamabe flow of an asymmetric cigar A Burchard, RJ McCann, A Smith | 16 | 2008 |
| Reconstruction of line-embeddings of graphons J Janssen, A Smith Electronic Journal of Statistics 16 (1), 331-407, 2022 | 14 | 2022 |
| Mixing times and hitting times for general Markov processes RM Anderson, H Duanmu, A Smith Israel Journal of Mathematics 259 (2), 759-834, 2024 | 13 | 2024 |
| Rapid convergence of informed importance tempering Q Zhou, A Smith International Conference on Artificial Intelligence and Statistics, 10939-10965, 2022 | 12 | 2022 |
Natesh S. PillaiHarvard UniversityVerified email at fas.harvard.edu
