research
∙
11/22/2022
Projection-free Adaptive Regret with Membership Oracles
In the framework of online convex optimization, most iterative algorithm...
share
research
∙
07/01/2022
Efficient Adaptive Regret Minimization
In online convex optimization the player aims to minimize her regret aga...
research
∙
05/30/2022
Non-convex online learning via algorithmic equivalence
We study an algorithmic equivalence technique between nonconvex gradient...
research
∙
03/02/2022
Adaptive Gradient Methods with Local Guarantees
Adaptive gradient methods are the method of choice for optimization in m...
research
∙
06/28/2021
The Convergence Rate of SGD's Final Iterate: Analysis on Dimension Dependence
Stochastic Gradient Descent (SGD) is among the simplest and most popular...
research
∙
05/28/2021
Curse of Dimensionality in Unconstrained Private Convex ERM
We consider the lower bounds of differentially private empirical risk mi...
research
∙
02/10/2021
Towards Certifying ℓ_∞ Robustness using Neural Networks with ℓ_∞-dist Neurons
It is well-known that standard neural networks, even with a high classif...
research
∙
01/27/2021
A Note on the Representation Power of GHHs
In this note we prove a sharp lower bound on the necessary number of nes...
research
∙
12/24/2020
A Tight Lower Bound for Uniformly Stable Algorithms
Leveraging algorithmic stability to derive sharp generalization bounds i...
research
∙
12/07/2020
A Note on John Simplex with Positive Dilation
We prove a Johns theorem for simplices in R^d with positive dilation fac...
research
∙
06/20/2019