ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2209.01608
  4. Cited By
Dynamic Regret of Adaptive Gradient Methods for Strongly Convex Problems

Dynamic Regret of Adaptive Gradient Methods for Strongly Convex Problems

4 September 2022
Parvin Nazari
E. Khorram
    ODL
ArXiv (abs)PDFHTMLGithub

Papers citing "Dynamic Regret of Adaptive Gradient Methods for Strongly Convex Problems"

3 / 3 papers shown
Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
Subhamon Supantha
Abhishek Sinha
170
1
0
02 Oct 2025
Online (Non-)Convex Learning via Tempered Optimism
Online (Non-)Convex Learning via Tempered Optimism
Maxime Haddouche
Olivier Wintenberger
Benjamin Guedj
OnRL
431
1
0
18 Jan 2023
DADAM: A Consensus-based Distributed Adaptive Gradient Method for Online
  Optimization
DADAM: A Consensus-based Distributed Adaptive Gradient Method for Online Optimization
Parvin Nazari
Davoud Ataee Tarzanagh
George Michailidis
ODL
595
93
0
25 Jan 2019
1
Page 1 of 1