research
∙
05/19/2023
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees
Projection-free online learning has drawn increasing interest due to its...
share
research
∙
02/13/2021
Revisiting Smoothed Online Learning
In this paper, we revisit the problem of smoothed online learning, in wh...
research
∙
02/06/2020
Minimizing Dynamic Regret and Adaptive Regret Simultaneously
Regret minimization is treated as the golden rule in the traditional stu...
research
∙
09/05/2019
More Adaptive Algorithms for Tracking the Best Expert
In this paper, we consider the problem of prediction with expert advice ...
research
∙
05/30/2019
Multi-Objective Generalized Linear Bandits
In this paper, we study the multi-objective bandits (MOB) problem, where...
research
∙
05/15/2019
Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization
In this paper, we study adaptive online convex optimization, and aim to ...
research
∙
05/08/2019
SAdam: A Variant of Adam for Strongly Convex Functions
The Adam algorithm has become extremely popular for large-scale machine ...
research
∙
10/25/2018