Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond

v1v2 (latest)

Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond

6 September 2019

Andrew G. Lamperski

ArXiv (abs)PDF HTML

Papers citing "Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond"

10 / 10 papers shown

Title
Bayesian Ensembling: Insights from Online Optimization and Empirical Bayes Daniel Waxman Fernando Llorente Petar M. Djurić 83 0 0 21 May 2025
Online Linear Regression in Dynamic Environments via Discounting Andrew Jacobsen Ashok Cutkosky 108 6 0 29 May 2024
Second Order Path Variationals in Non-Stationary Online Learning Dheeraj Baby Yu Wang 115 5 0 04 May 2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond Dheeraj Baby Yu Wang 95 28 0 21 Jan 2022
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization Peng Zhao Yu Zhang Lijun Zhang Zhi Zhou 122 50 0 29 Dec 2021
Optimal Dynamic Regret in Exp-Concave Online Learning Dheeraj Baby Yu Wang 111 46 0 23 Apr 2021
An Optimal Reduction of TV-Denoising to Adaptive Online Learning Dheeraj Baby Xuandong Zhao Yu Wang 94 12 0 23 Jan 2021
Dynamic Regret of Convex and Smooth Functions Peng Zhao Yu Zhang Lijun Zhang Zhi Zhou 104 105 0 07 Jul 2020
Unconstrained Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems Ting-Jui Chang Shahin Shahrampour ODL 55 4 0 06 Jun 2020
Learning and Planning for Time-Varying MDPs Using Maximum Likelihood Estimation Melkior Ornik Ufuk Topcu OOD 41 15 0 29 Nov 2019