Lower bounds on individual sequence regret

DOI10.1007/S10994-015-5531-YzbMATH Open1357.68170OpenAlexW2275626685MaRDI QIDQ285930FDOQ285930

Authors: 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

Recommendations

• Lower bounds on individual sequence regret
• Regret bounded by gradual variation for online convex optimization
• Logarithmic Regret Algorithms for Online Convex Optimization
• Logarithmic regret algorithms for online convex optimization
• Regret to the best vs. regret to the average

zbMATH Keywords

online learningonline linear optimizationregret lower boundsregret minimizationregularized follow-the-leader

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Extracting certainty from uncertainty: regret bounded by variation in costs
• Prediction, Learning, and Games
• Learning Theory
• Introductory lectures on convex optimization. A basic course.
• Convex Analysis
• 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

Cited In (2)

• Lower bounds on individual sequence regret
• Sparsity regret bounds for individual sequences in online linear regression

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

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