Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond.
Dheeraj BabyYu-Xiang WangPublished in: AISTATS (2022)
Keyphrases
- online learning
- regret bounds
- online convex optimization
- e learning
- distance education
- piecewise linear
- globally optimal
- online course
- blended learning
- worst case
- dynamic programming
- higher education
- computer mediated
- online algorithms
- semi infinite programming
- optimal solution
- dynamic environments
- lower bound
- convex optimization
- distance learning
- convex sets
- asymptotically optimal
- online learning environments