Nonstationary online convex optimization with multiple predictions

DOI10.1016/j.ins.2023.119862MaRDI QIDQ6151925

Jian-wei Liu, Qingxin Meng

Publication date: 12 February 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

meta-learningoptimistic online learningdynamic regretimplicit mirror descentnon-stationary online convex optimization

Mathematics Subject Classification ID

Statistics (62-XX) Mathematical programming (90Cxx)

Cites Work

• Exponentiated gradient versus gradient descent for linear predictors
• Scale-free online learning
• 10.1162/153244301753683726
• Non-Stationary Stochastic Optimization
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Online Learning and Online Convex Optimization
• Proximité et dualité dans un espace hilbertien
• Relative loss bounds for on-line density estimation with the exponential family of distributions

This page was built for publication: Nonstationary online convex optimization with multiple predictions