Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms.
Dheeraj BabySaurabh GargTzu-Ching YenSivaraman BalakrishnanZachary Chase LiptonYu-Xiang WangPublished in: CoRR (2023)
Keyphrases
- online learning
- worst case
- online algorithms
- online convex optimization
- dynamic environments
- computationally efficient
- orders of magnitude
- real time
- theoretical analysis
- dynamic programming
- bandit problems
- lower bound
- optimization problems
- multi class
- computational cost
- constraint satisfaction problems
- practical problems
- pairwise
- computationally demanding
- regret bounds