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. 2102.06622
  4. Cited By
MetaGrad: Adaptation using Multiple Learning Rates in Online Learning
v1v2 (latest)

MetaGrad: Adaptation using Multiple Learning Rates in Online Learning

Journal of machine learning research (JMLR), 2021
12 February 2021
T. Erven
Wouter M. Koolen
Dirk van der Hoeven
    ODL
ArXiv (abs)PDFHTMLGithub

Papers citing "MetaGrad: Adaptation using Multiple Learning Rates in Online Learning"

14 / 14 papers shown
Robust forecast aggregation via additional queries
Robust forecast aggregation via additional queries
Rafael Frongillo
Mary Monroe
Eric Neyman
Bo Waggoner
42
0
0
04 Dec 2025
Non-stationary Bandit Convex Optimization: A Comprehensive Study
Non-stationary Bandit Convex Optimization: A Comprehensive Study
Xiaoqi Liu
Dorian Baudry
Julian Zimmert
Patrick Rebeschini
Arya Akhavan
278
3
0
03 Jun 2025
Improved Impossible Tuning and Lipschitz-Adaptive Universal Online Learning with Gradient Variations
Improved Impossible Tuning and Lipschitz-Adaptive Universal Online Learning with Gradient Variations
Kei Takemura
Ryuta Matsuno
Keita Sakuma
260
0
0
27 May 2025
Non-Stationary Learning of Neural Networks with Automatic Soft Parameter
  Reset
Non-Stationary Learning of Neural Networks with Automatic Soft Parameter ResetNeural Information Processing Systems (NeurIPS), 2024
Alexandre Galashov
Michalis K. Titsias
Andras Gyorgy
Clare Lyle
Razvan Pascanu
Yee Whye Teh
Maneesh Sahani
341
11
0
06 Nov 2024
Tracking solutions of time-varying variational inequalities
Tracking solutions of time-varying variational inequalities
Hédi Hadiji
Sarah Sachs
Cristóbal Guzmán
279
1
0
20 Jun 2024
High-Probability Risk Bounds via Sequential Predictors
High-Probability Risk Bounds via Sequential Predictors
Dirk van der Hoeven
Nikita Zhivotovskiy
Nicolò Cesa-Bianchi
OffRL
273
7
0
15 Aug 2023
Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting
Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit SettingInternational Conference on Machine Learning (ICML), 2023
Yuanyu Wan
Chang Yao
Min-Gyoo Song
Mingli Song
Lijun Zhang
613
9
0
20 May 2023
Non-stationary Projection-free Online Learning with Dynamic and Adaptive
  Regret Guarantees
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret GuaranteesAAAI Conference on Artificial Intelligence (AAAI), 2023
Yibo Wang
Wenhao Yang
Wei Jiang
Shiyin Lu
Bing Wang
Haihong Tang
Yuanyu Wan
Lijun Zhang
371
17
0
19 May 2023
Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
Sarah Sachs
Hédi Hadiji
T. Erven
Cristóbal Guzmán
345
8
0
06 Mar 2023
Grad-GradaGrad? A Non-Monotone Adaptive Stochastic Gradient Method
Grad-GradaGrad? A Non-Monotone Adaptive Stochastic Gradient Method
Aaron Defazio
Baoyu Zhou
Lin Xiao
ODL
283
7
0
14 Jun 2022
A Regret-Variance Trade-Off in Online Learning
A Regret-Variance Trade-Off in Online LearningNeural Information Processing Systems (NeurIPS), 2022
Dirk van der Hoeven
Nikita Zhivotovskiy
Nicolò Cesa-Bianchi
310
8
0
06 Jun 2022
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with
  Feedback Graphs
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback GraphsNeural Information Processing Systems (NeurIPS), 2022
Chloé Rouyer
Dirk van der Hoeven
Nicolò Cesa-Bianchi
Yevgeny Seldin
254
18
0
01 Jun 2022
Distributed Online Learning for Joint Regret with Communication
  Constraints
Distributed Online Learning for Joint Regret with Communication ConstraintsInternational Conference on Algorithmic Learning Theory (ALT), 2021
Dirk van der Hoeven
Hédi Hadiji
T. Erven
269
7
0
15 Feb 2021
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 FunctionsNeural Information Processing Systems (NeurIPS), 2019
Lijun Zhang
G. Wang
Wei-Wei Tu
Zhi Zhou
ODL
344
22
0
26 Jun 2019
1
Page 1 of 1