Improving adaptive online learning using refined discretization

MaRDI QIDQ7017063zbMATH OpenFDO

Authors Zhiyu Zhang, Heng Yang, Ashok Cutkosky, Ioannis Ch. Paschalidis

Publication date 6 March 2025

Full work available at URL https://proceedings.mlr.press/v237/zhang24a.html

zbMATH Keywords

adaptive online learningcontinuous-time methodscale-free online learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Cites work

• Adaptive subgradient methods for online learning and stochastic optimization
• Competitive ratio vs regret minimization: achieving the best of both worlds
• Efficient and optimal fixed-time regret with two experts
• Finite-time 4-expert prediction problem
• Minimax option pricing meets Black-Scholes in the limit
• Optimal anytime regret with two experts
• Prediction with expert advice: a PDE perspective
• Scale-free online learning
• The pricing of options and corporate liabilities

This page was built for publication: Improving adaptive online learning using refined discretization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7017063)