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. 1906.10851
  4. Cited By
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive
  Regret of Convex Functions

Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions

26 June 2019
Lijun Zhang
G. Wang
Wei-Wei Tu
Zhi-Hua Zhou
    ODL
ArXivPDFHTML

Papers citing "Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions"

3 / 3 papers shown
Title
Optimal Dynamic Regret in LQR Control
Optimal Dynamic Regret in LQR Control
Dheeraj Baby
Yu-Xiang Wang
22
16
0
18 Jun 2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex
  Losses and Beyond
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond
Dheeraj Baby
Yu-Xiang Wang
29
25
0
21 Jan 2022
Optimal Dynamic Regret in Exp-Concave Online Learning
Optimal Dynamic Regret in Exp-Concave Online Learning
Dheeraj Baby
Yu-Xiang Wang
39
43
0
23 Apr 2021
1