Combinatorial online prediction via metarounding

Takahiro Fujita, Kohei Hatano, Eiji Takimoto

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

8 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルAlgorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings
ページ68-82
ページ数15
DOI
出版ステータス出版済み - 2013
イベント24th International Conference on Algorithmic Learning Theory, ALT 2013 - Singapore, シンガポール
継続期間: 10 6 201310 9 2013

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8139 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他24th International Conference on Algorithmic Learning Theory, ALT 2013
国/地域シンガポール
CitySingapore
Period10/6/1310/9/13

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Combinatorial online prediction via metarounding」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル