<会議発表論文>
Online Prediction under Submodular Constraints
作成者 | |
---|---|
本文言語 | |
出版者 | |
発行日 | |
会議情報 | |
出版タイプ | |
アクセス権 | |
関連DOI | |
関連DOI | |
関連情報 | |
概要 | We consider an online prediction problem of combinatorial concepts where each combinatorial concept is represented as a vertex of a polyhedron described by a submodular function (base polyhedron). In ...general, there are exponentially many vertices in the base polyhedron. We propose polynomial time algorithms with regret bounds. In particular, for cardinality-based submodular functions, we give O(n^2)-time algorithms.続きを見る |
詳細
レコードID | |
---|---|
関連ISBN | |
主題 | |
登録日 | 2018.06.07 |
更新日 | 2018.11.28 |