Lower bounds on individual sequence regret

DOI10.1007/S10994-015-5531-YzbMath1357.68170OpenAlexW2275626685MaRDI QIDQ285930

Eyal Gofer, Yishay Mansour

Publication date: 19 May 2016

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-015-5531-y

zbMATH Keywords

online learningregret minimizationonline linear optimizationregret lower boundsregularized follow-the-leader

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Introductory lectures on convex optimization. A basic course.
• Extracting certainty from uncertainty: regret bounded by variation in costs
• Efficient algorithms for online decision problems
• Online trading algorithms and robust option pricing
• Lower Bounds on Individual Sequence Regret
• Regret to the Best vs. Regret to the Average
• Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking
• Prediction, Learning, and Games
• Learning Theory
• Convex Analysis

This page was built for publication: Lower bounds on individual sequence regret