research
∙
06/25/2023
Near Optimal Heteroscedastic Regression with Symbiotic Learning
We consider the problem of heteroscedastic linear regression, where, giv...
share
research
∙
05/31/2023
Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms
This paper focuses on supervised and unsupervised online label shift, wh...
research
∙
06/18/2022
Optimal Dynamic Regret in LQR Control
We consider the problem of nonstochastic control with a sequence of quad...
research
∙
05/04/2022
Second Order Path Variationals in Non-Stationary Online Learning
We consider the problem of universal dynamic regret minimization under e...
research
∙
01/21/2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond
We study the framework of universal dynamic regret minimization with str...
research
∙
11/22/2021
Dynamic Regret for Strongly Adaptive Methods and Optimality of Online KRR
We consider the framework of non-stationary Online Convex Optimization w...
research
∙
04/23/2021
Optimal Dynamic Regret in Exp-Concave Online Learning
We consider the problem of the Zinkevich (2003)-style dynamic regret min...
research
∙
01/23/2021
An Optimal Reduction of TV-Denoising to Adaptive Online Learning
We consider the problem of estimating a function from n noisy samples wh...
research
∙
09/30/2020
Adaptive Online Estimation of Piecewise Polynomial Trends
We consider the framework of non-stationary stochastic optimization [Bes...
research
∙
06/08/2019
