research
∙
06/07/2022
Better Best of Both Worlds Bounds for Bandits with Switching Costs
We study best-of-both-worlds algorithms for bandits with switching cost,...
share
research
∙
02/27/2022
Thinking Outside the Ball: Optimal Learning with Gradient Descent for Generalized Linear Stochastic Convex Optimization
We consider linear prediction with a convex Lipschitz loss, or more gene...
research
∙
06/29/2021
Never Go Full Batch (in Stochastic Convex Optimization)
We study the generalization performance of full-batch optimization algor...
research
∙
02/01/2021
SGD Generalizes Better Than GD (And Regularization Doesn't Help)
We give a new separation result between the generalization performance o...
research
∙
02/24/2020