Discounted Adaptive Online Learning: Towards Better Regularization
<|reference_start|>Discounted Adaptive Online Learning: Towards Better Regularization: We study online learning in adversarial nonstationary environments. Since the future can be very different from the past, a critical challenge is to gracefully forget the history while new data comes in. To formalize this intuition, we revisit the discounted regret in online convex optimization, and propose an adaptive (i.e., instance optimal), FTRL-based algorithm that improves the widespread non-adaptive baseline -- gradient descent with a constant learning rate. From a practical perspective, this refines the classical idea of regularization in lifelong learning: we show that designing good regularizers can be guided by the principled theory of adaptive online optimization.   Complementing this result, we also consider the (Gibbs and Cand\`es, 2021)-style online conformal prediction problem, where the goal is to sequentially predict the uncertainty sets of a black-box machine learning model. We show that the FTRL nature of our algorithm can simplify the conventional gradient-descent-based analysis, leading to instance-dependent performance guarantees.<|reference_end|>
@article{zhang2024discounted,
    title={Discounted Adaptive Online Learning: Towards Better Regularization},
    author={Zhiyu Zhang, David Bombara, Heng Yang},
    journal={arXiv preprint arXiv:2402.02720},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.02720},
    primaryClass={cs.LG stat.ML}
}