research
∙
06/01/2022
Continuous Prediction with Experts' Advice
Prediction with experts' advice is one of the most fundamental problems ...
share
research
∙
03/15/2022
Efficient and Optimal Fixed-Time Regret with Two Experts
Prediction with expert advice is a foundational problem in online learni...
research
∙
10/22/2020
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses
In online convex optimization (OCO), Lipschitz continuity of the functio...
research
∙
06/03/2020
Online mirror descent and dual averaging: keeping pace in the dynamic case
Online mirror descent (OMD) and dual averaging (DA) are two fundamental ...
research
∙
02/20/2020
Optimal anytime regret with two experts
The multiplicative weights method is an algorithm for the problem of pre...
research
∙
09/02/2019
Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent
We consider stochastic gradient descent algorithms for minimizing a non-...
research
∙
12/13/2018
Tight Analyses for Non-Smooth Stochastic Gradient Descent
Consider the problem of minimizing functions that are Lipschitz and stro...
research
∙
06/17/2018
