Scale-invariant unconstrained online learning

DOI10.1016/J.TCS.2019.11.016zbMath1436.68309OpenAlexW2982799599WikidataQ126813242 ScholiaQ126813242MaRDI QIDQ2290692

Wojciech Kotłowski

Publication date: 29 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.11.016

zbMATH Keywords

online learningscale invarianceregret boundlinear classificationonline convex optimizationunconstrained online learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Uses Software

• AdaGrad

Cites Work

• A generalized online mirror descent with applications to classification and regression
• Logarithmic regret algorithms for online convex optimization
• Scale-Free Algorithms for Online Linear Optimization
• Online Learning and Online Convex Optimization
• Generalized Inverses of Linear Transformations
• A Second-Order Perceptron Algorithm
• Prediction, Learning, and Games
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scale-invariant unconstrained online learning