| Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses R Bassily, V Feldman, C Guzmán, K Talwar NeurIPS, 2020 | 255 | 2020 |
| Statistical query algorithms for mean vector estimation and stochastic convex optimization V Feldman, C Guzmán, S Vempala Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 129* | 2017 |
| On lower complexity bounds for large-scale smooth convex optimization C Guzmán, A Nemirovski Journal of Complexity 31 (1), 1-14, 2015 | 125 | 2015 |
| The complexity of nonconvex-strongly-concave minimax optimization S Zhang, J Yang, C Guzmán, N Kiyavash, N He UAI 2021, 2021 | 95 | 2021 |
| Non-euclidean differentially private stochastic convex optimization R Bassily, C Guzmán, A Nandi COLT 2021 134, 474-499, 2021 | 91 | 2021 |
| Differentially private stochastic optimization: New results in convex and non-convex settings R Bassily, C Guzmán, M Menart Advances in Neural Information Processing Systems 34, 9317-9329, 2021 | 69 | 2021 |
| Lower Bounds for Parallel and Randomized Convex Optimization J Diakonikolas, C Guzmán Journal of Machine Learning Research 21 (5), 1-31, 2020 | 65 | 2020 |
| Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory G Braun, C Guzmán, S Pokutta IEEE Transactions on Information Theory (DOI:10.1109/TIT.2017.2701343), 2017 | 46 | 2017 |
| Faster rates of convergence to stationary points in differentially private optimization R Arora, R Bassily, T González, CA Guzmán, M Menart, E Ullah International Conference on Machine Learning, 1060-1092, 2023 | 39 | 2023 |
| Optimal Affine-Invariant Smooth Minimization Algorithms A d'Aspremont, C Guzmán, M Jaggi SIAM Journal on Optimization 28 (3), 2384-2405, 2018 | 38* | 2018 |
| Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions X Cai, C Song, CA Guzmán, J Diakonikolas Advances in Neural Information Processing Systems, 2022 | 36* | 2022 |
| Differentially private generalized linear models revisited R Arora, R Bassily, C Guzmán, M Menart, E Ullah Advances in Neural Information Processing Systems 35, 22505-22517, 2022 | 34 | 2022 |
| Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness S Sachs, H Hadiji, T van Erven, C Guzmán Advances in Neural Information Processing Systems (NeurIPS), 2022 | 30 | 2022 |
| New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry M Dostert, C Guzmán, F Vallentin Discrete & Computational Geometry (DOI: 10.1007/s00454-017-9882-y), 2017 | 30 | 2017 |
| Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems D Boob, C Guzmán Mathematical Programming 204 (1), 255-297, 2024 | 26 | 2024 |
| Complementary composite minimization, small gradients in general norms, and applications J Diakonikolas, C Guzmán Mathematical Programming, 2024 | 21* | 2024 |
| A sequential Stackelberg game for dynamic inspection problems C Guzman, J Riffo, C Telha, M Van Vyve European Journal of Operational Research 302 (2), 727-739, 2022 | 20 | 2022 |
| Network pricing: How to induce optimal flows under strategic link operators J Correa, C Guzmán, T Lianeas, E Nikolova, M Schröder Operations research 70 (1), 472-489, 2022 | 20* | 2022 |
| Network congestion control with Markovian multipath routing R Cominetti, C Guzmán Mathematical Programming 147 (1-2), 231-251, 2014 | 19 | 2014 |
| An optimal algorithm for strict circular seriation S Armstrong, C Guzmán, CA Sing-Long SIAM Journal on Mathematics of Data Science (SIMODS) https://doi.org/10.1137 …, 2021 | 13 | 2021 |
Raef BassilyAssociate Professor, Computer Science & Engineering, The Ohio State UniversityVerified email at osu.edu
