Abstract
We consider online prediction problems of combinatorial concepts. Examples of such concepts include s-t paths, permutations, truth assignments, set covers, and so on. The goal of the online prediction algorithm is to compete with the best fixed combinatorial concept in hindsight. A generic approach to this problem is to design an online prediction algorithm using the corresponding offline (approximation) algorithm as an oracle. The current state-of-the art method, however, is not efficient enough. In this paper we propose a more efficient online prediction algorithm when the offline approximation algorithm has a guarantee of the integrality gap. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Fujita, T., Hatano, K., & Takimoto, E. (2013). Combinatorial online prediction via metarounding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8139 LNAI, pp. 68–82). https://doi.org/10.1007/978-3-642-40935-6_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
