Cristóbal Guzmán
21 papers · 2015–2026 · 5 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 10 separate collaboration groups - the largest holds only 38% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Cristóbal Guzmán?
3 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
with Raef Bassily, Michael Menart, Raman Arora
8 papers
· 2020–2024
· NeurIPS, COLT, ALT
Hide ▲
Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates
ALT 2024
Private Algorithms for Stochastic Saddle Points and Variational Inequalities: Beyond Euclidean Geometry
NeurIPS 2024
Public-data Assisted Private Stochastic Optimization: Power and Limitations
NeurIPS 2024
Differentially Private Algorithms for the Stochastic Saddle Point Problem with Optimal Rates for the Strong Gap
COLT 2023
Differentially Private Generalized Linear Models Revisited
NeurIPS 2022
Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings
NeurIPS 2021
Non-Euclidean Differentially Private Stochastic Convex Optimization
COLT 2021
Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses
NeurIPS 2020
7 papers whose co-authors appear nowhere else under this name
Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity
JMLR 2025
Non-Euclidean High-Order Smooth Convex Optimization Extended Abstract
COLT 2025
Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems extended abstract
COLT 2024
Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness
NeurIPS 2022
Best-case lower bounds in online learning
NeurIPS 2021
The complexity of nonconvex-strongly-concave minimax optimization
UAI 2021
Open Problem: The Oracle Complexity of Smooth Convex Optimization in Nonstandard Settings
COLT 2015