Efficient algorithms for combinatorial online prediction

DOI10.1007/978-3-642-40935-6_3MaRDI QIDQ2859204zbMATH OpenOpenAlexFDO

Authors Kohei Hatano, Eiji Takimoto

Publication date 6 November 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-40935-6_3

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• Combinatorial online prediction via metarounding
• Efficient algorithms for online decision problems
• Logarithmic Regret Algorithms for Online Convex Optimization
• Logarithmic regret algorithms for online convex optimization
• An Efficient Algorithm for Learning with Semi-bandit Feedback

Cited in

(10)

• A study of two on-line prediction algorithms
• Efficient algorithms for online decision problems
• Combining model selection procedures for online prediction
• Combinatorial online prediction via metarounding
• Online forecast combinations of distributions: worst case bounds
• Online prediction under submodular constraints
• Efficient prediction algorithms for binary decomposition techniques
• scientific article; zbMATH DE number 7014216 (Why is no real title available?)
• Following the leader and fast rates in online linear prediction: curved constraint sets and other regularities
• scientific article; zbMATH DE number 7740914 (Why is no real title available?)

This page was built for publication: Efficient algorithms for combinatorial online prediction

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