Online prediction problems with variation

DOI10.1007/978-3-319-08783-2_5MaRDI QIDQ2920444zbMATH OpenOpenAlexFDO

Authors Chia-Jung Lee, Shi-Chun Tsai, Ming-Chuan Yang

Publication date 26 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08783-2_5

zbMATH Keywords

bandit settingcombinational prediction gameprediction with expert advice problemsemi-bandit settingvariation

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial games (91A46)

Recommendations

• Extracting certainty from uncertainty: regret bounded by variation in costs
• Combinatorial bandits
• How to better use expert advice
• Regret in online combinatorial optimization
• Prediction with Expert Advice under Discounted Loss

Cited in

(7)

• A study of two on-line prediction algorithms
• A loss bound model for on-line stochastic prediction algorithms
• Extracting certainty from uncertainty: regret bounded by variation in costs
• Online forecast combinations of distributions: worst case bounds
• Online variance minimization
• Combinatorial bandits
• Prediction of locally stationary data using expert advice

This page was built for publication: Online prediction problems with variation

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