Minimizing Dynamic Regret and Adaptive Regret Simultaneously

6 February 2020

Papers citing "Minimizing Dynamic Regret and Adaptive Regret Simultaneously"

11 / 11 papers shown

Title
Efficient Methods for Non-stationary Online Learning Peng Zhao Yan-Feng Xie Lijun Zhang Zhi-Hua Zhou 44 19 0 16 Sep 2023
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees Yibo Wang Wenhao Yang Wei Jiang Shiyin Lu Bing Wang Haihong Tang Yuanyu Wan Lijun Zhang 22 6 0 19 May 2023
On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization R. Vaze 11 4 0 24 Jan 2023
Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods Davoud Ataee Tarzanagh Parvin Nazari Bojian Hou Li Shen Laura Balzano 44 10 0 06 Jul 2022
Adapting to Online Label Shift with Provable Guarantees Yong Bai Yu-Jie Zhang Peng Zhao Masashi Sugiyama Zhi-Hua Zhou OOD 21 25 0 05 Jul 2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor Lijun Zhang Wei Jiang Jinfeng Yi Tianbao Yang 20 6 0 02 May 2022
Adaptive Gradient Methods with Local Guarantees Zhou Lu Wenhan Xia Sanjeev Arora Elad Hazan ODL 17 9 0 02 Mar 2022
Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for Mixable/Exp-Concave Losses Kaan Gokcesu Hakan Gokcesu 8 1 0 28 Sep 2021
A Simple Approach for Non-stationary Linear Bandits Peng Zhao Lijun Zhang Yuan Jiang Zhi-Hua Zhou 23 81 0 09 Mar 2021
Non-stationary Online Learning with Memory and Non-stochastic Control Peng Zhao Yu-Hu Yan Yu-Xiang Wang Zhi-Hua Zhou 33 47 0 07 Feb 2021
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions Lijun Zhang G. Wang Wei-Wei Tu Zhi-Hua Zhou ODL 15 18 0 26 Jun 2019