ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2112.14368
  4. Cited By
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for
  Online Convex Optimization

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization

29 December 2021
Peng Zhao
Yu-Jie Zhang
Lijun Zhang
Zhi-Hua Zhou
ArXivPDFHTML

Papers citing "Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization"

5 / 5 papers shown
Title
Online Linear Regression in Dynamic Environments via Discounting
Online Linear Regression in Dynamic Environments via Discounting
Andrew Jacobsen
Ashok Cutkosky
28
4
0
29 May 2024
Efficient Methods for Non-stationary Online Learning
Efficient Methods for Non-stationary Online Learning
Peng Zhao
Yan-Feng Xie
Lijun Zhang
Zhi-Hua Zhou
30
19
0
16 Sep 2023
Dynamic Regret of Online Markov Decision Processes
Dynamic Regret of Online Markov Decision Processes
Peng Zhao
Longfei Li
Zhi-Hua Zhou
OffRL
16
17
0
26 Aug 2022
Adapting to Online Label Shift with Provable Guarantees
Adapting to Online Label Shift with Provable Guarantees
Yong Bai
Yu-Jie Zhang
Peng Zhao
Masashi Sugiyama
Zhi-Hua Zhou
OOD
13
24
0
05 Jul 2022
Optimal Dynamic Regret in Exp-Concave Online Learning
Optimal Dynamic Regret in Exp-Concave Online Learning
Dheeraj Baby
Yu-Xiang Wang
35
43
0
23 Apr 2021
1