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. 2006.07503
  4. Cited By
Temporal Variability in Implicit Online Learning
v1v2 (latest)

Temporal Variability in Implicit Online Learning

Neural Information Processing Systems (NeurIPS), 2020
12 June 2020
Nicolò Campolongo
Francesco Orabona
ArXiv (abs)PDFHTML

Papers citing "Temporal Variability in Implicit Online Learning"

18 / 18 papers shown
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
Provably Efficient Reinforcement Learning with Multinomial Logit Function ApproximationNeural Information Processing Systems (NeurIPS), 2024
Long-Fei Li
Yu Zhang
Peng Zhao
Zhi Zhou
655
10
0
17 Jan 2025
Proximal Point Method for Online Saddle Point Problem
Proximal Point Method for Online Saddle Point Problem
Qing-xin Meng
Jian-wei Liu
380
3
0
05 Jul 2024
Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
Nearly Minimax Optimal Regret for Multinomial Logistic BanditNeural Information Processing Systems (NeurIPS), 2024
Joongkyu Lee
Min-hwan Oh
445
13
0
16 May 2024
Online Saddle Point Problem and Online Convex-Concave Optimization
Online Saddle Point Problem and Online Convex-Concave Optimization
Qing-xin Meng
Jianwei Liu
286
0
0
12 Dec 2023
Implicit Interpretation of Importance Weight Aware Updates
Implicit Interpretation of Importance Weight Aware Updates
Keyi Chen
Francesco Orabona
169
0
0
22 Jul 2023
Generalized Implicit Follow-The-Regularized-Leader
Generalized Implicit Follow-The-Regularized-LeaderInternational Conference on Machine Learning (ICML), 2023
Keyi Chen
Francesco Orabona
FedML
240
3
0
31 May 2023
Adapting to Online Label Shift with Provable Guarantees
Adapting to Online Label Shift with Provable GuaranteesNeural Information Processing Systems (NeurIPS), 2022
Yong Bai
Yu Zhang
Peng Zhao
Masashi Sugiyama
Zhi Zhou
OOD
436
42
0
05 Jul 2022
Efficient algorithms for implementing incremental proximal-point methods
Efficient algorithms for implementing incremental proximal-point methodsMathematical Programming Computation (MPC), 2022
A. Shtoff
301
2
0
03 May 2022
Adaptive Composite Online Optimization: Predictions in Static and
  Dynamic Environments
Adaptive Composite Online Optimization: Predictions in Static and Dynamic EnvironmentsIEEE Transactions on Automatic Control (TAC), 2022
Pedro Zattoni Scroccaro
Arman Sharifi Kolarijani
Peyman Mohajerin Esfahani
348
12
0
01 May 2022
Implicit Parameter-free Online Learning with Truncated Linear Models
Implicit Parameter-free Online Learning with Truncated Linear ModelsInternational Conference on Algorithmic Learning Theory (ALT), 2022
Keyi Chen
Ashok Cutkosky
Francesco Orabona
226
12
0
19 Mar 2022
Parameter-free Mirror Descent
Parameter-free Mirror DescentAnnual Conference Computational Learning Theory (COLT), 2022
Andrew Jacobsen
Ashok Cutkosky
566
46
0
26 Feb 2022
Understanding AdamW through Proximal Methods and Scale-Freeness
Understanding AdamW through Proximal Methods and Scale-Freeness
Zhenxun Zhuang
Mingrui Liu
Ashok Cutkosky
Francesco Orabona
343
113
0
31 Jan 2022
Isotuning With Applications To Scale-Free Online Learning
Isotuning With Applications To Scale-Free Online Learning
Laurent Orseau
Marcus Hutter
369
6
0
29 Dec 2021
Improving Dynamic Regret in Distributed Online Mirror Descent Using
  Primal and Dual Information
Improving Dynamic Regret in Distributed Online Mirror Descent Using Primal and Dual InformationConference on Learning for Dynamics & Control (L4DC), 2021
Nima Eshraghi
Ben Liang
390
11
0
07 Dec 2021
Online Continual Adaptation with Active Self-Training
Online Continual Adaptation with Active Self-TrainingInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2021
Shiji Zhou
Han Zhao
Shanghang Zhang
Lianzhe Wang
Heng Chang
Zhi Wang
Wenwu Zhu
CLL
195
14
0
11 Jun 2021
A closer look at temporal variability in dynamic online learning
A closer look at temporal variability in dynamic online learning
Nicolò Campolongo
Francesco Orabona
148
15
0
15 Feb 2021
Meta-strategy for Learning Tuning Parameters with Guarantees
Meta-strategy for Learning Tuning Parameters with GuaranteesEntropy (Entropy), 2021
Dimitri Meunier
Pierre Alquier
298
9
0
04 Feb 2021
Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via
  Root-Entropic Regularization
Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via Root-Entropic RegularizationAnnals of Statistics (Ann. Stat.), 2020
Blair Bilodeau
Jeffrey Negrea
Daniel M. Roy
347
11
0
13 Jul 2020
1
Page 1 of 1