| Rapid mixing of Hamiltonian Monte Carlo on strongly log-concave distributions O Mangoubi, A Smith arXiv preprint arXiv:1708.07114, 2017 | 103 | 2017 |
| Dimensionally tight bounds for second-order Hamiltonian Monte Carlo O Mangoubi, N Vishnoi Advances in neural information processing systems 31, 2018 | 65 | 2018 |
| Nonconvex sampling with the Metropolis-adjusted Langevin algorithm O Mangoubi, NK Vishnoi Conference on Learning Theory, 2259-2293, 2019 | 32 | 2019 |
| 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 | 32 | 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 | 29 | 2019 |
| Rapid mixing of geodesic walks on manifolds with positive curvature O Mangoubi, A Smith The Annals of Applied Probability 28 (4), 2501-2543, 2018 | 23 | 2018 |
| Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization O Mangoubi, NK Vishnoi Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 20 | 2021 |
| Faster polytope rounding, sampling, and volume computation via a sub-linear ball walk O Mangoubi, NK Vishnoi 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 19 | 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 | 15 | 2021 |
| Magnetization transfer magic-angle-spinning z-spectroscopy of excised tissues R Avni, O Mangoubi, R Bhattacharyya, H Degani, L Frydman Journal of Magnetic Resonance 199 (1), 1-9, 2009 | 15 | 2009 |
| Sync-switch: Hybrid parameter synchronization for distributed deep learning S Li, O Mangoubi, L Xu, T Guo 2021 IEEE 41st International Conference on Distributed Computing Systems …, 2021 | 12 | 2021 |
| Convex optimization with unbounded nonconvex oracles using simulated annealing O Mangoubi, NK Vishnoi Conference On Learning Theory, 1086-1124, 2018 | 12 | 2018 |
| Towards optimal convex combination rules for gossiping O Mangoubi, S Mou, J Liu, AS Morse 2013 American Control Conference, 1261-1265, 2013 | 9 | 2013 |
| Sampling from log-concave distributions with infinity-distance guarantees O Mangoubi, N Vishnoi Advances in Neural Information Processing Systems 35, 12633-12646, 2022 | 7 | 2022 |
| A second-order equilibrium in nonconvex-nonconcave min-max optimization: Existence and algorithm O Mangoubi, NK Vishnoi arXiv preprint arXiv:2006.12363, 2020 | 6 | 2020 |
| Online sampling from log-concave distributions H Lee, O Mangoubi, N Vishnoi Advances in Neural Information Processing Systems 32, 2019 | 6 | 2019 |
| Re-analyze Gauss: Bounds for private matrix approximation via Dyson Brownian motion O Mangoubi, N Vishnoi Advances in Neural Information Processing Systems 35, 38585-38599, 2022 | 5 | 2022 |
| Simple conditions for metastability of continuous Markov chains O Mangoubi, N Pillai, A Smith Journal of Applied Probability 58 (1), 83-105, 2021 | 4 | 2021 |
| Sampling from log-concave distributions with infinity-distance guarantees and applications to differentially private optimization O Mangoubi, NK Vishnoi arXiv preprint arXiv:2111.04089 31, 2021 | 4 | 2021 |
| Gans with first-order greedy discriminators V Keswani, O Mangoubi, S Sachdeva, NK Vishnoi arXiv preprint arXiv:2006.12376, 2020 | 4* | 2020 |
