Dynamic regret of adaptive gradient methods for strongly convex problems

DOI10.1080/02331934.2022.2112958arXiv2209.01608OpenAlexW4292722250MaRDI QIDQ6192078

Esmaile Khorram, P. Nazari

Publication date: 11 March 2024

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.01608

zbMATH Keywords

online optimizationadaptive gradient methodsdynamic regret

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Calculus of variations and optimal control; optimization (49-XX)

Cites Work

• Unnamed Item
• Logarithmic regret algorithms for online convex optimization
• Adaptive and self-confident on-line learning algorithms
• Non-Stationary Stochastic Optimization
• Online Distributed Convex Optimization on Dynamic Networks

This page was built for publication: Dynamic regret of adaptive gradient methods for strongly convex problems