18 citations · 28 across the 3 of their papers we have counts for
4 papers
Best-Case Lower Bounds in Online Learning
Cristóbal Guzmán, Nishant A. Mehta, Ali Mortazavi
Much of the work in online learning focuses on the study of sublinear upper bounds on the regret. In this work, we initiate the study of best-case lower bounds in online convex opt…
An Optimal Algorithm for Strict Circular Seriation
Santiago Armstrong, Cristóbal Guzmán, Carlos A. Sing-Long
We study the problem of circular seriation, where we are given a matrix of pairwise dissimilarities between objects, and the goal is to find a {\em circular order} of the objec…
The Complexity of Nonconvex-Strongly-Concave Minimax Optimization
Siqi Zhang, Junchi Yang, Cristóbal Guzmán +2
This paper studies the complexity for finding approximate stationary points of nonconvex-strongly-concave (NC-SC) smooth minimax problems, in both general and averaged smooth finit…
Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses
Raef Bassily, Vitaly Feldman, Cristóbal Guzmán +1
Uniform stability is a notion of algorithmic stability that bounds the worst case change in the model output by the algorithm when a single data point in the dataset is replaced. A…