TY - GEN

T1 - Online prediction under submodular constraints

AU - Suehiro, Daiki

AU - Hatano, Kohei

AU - Kijima, Shuji

AU - Takimoto, Eiji

AU - Nagano, Kiyohito

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867856605&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867856605&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-34106-9_22

DO - 10.1007/978-3-642-34106-9_22

M3 - Conference contribution

AN - SCOPUS:84867856605

SN - 9783642341052

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 260

EP - 274

BT - Algorithmic Learning Theory - 23rd International Conference, ALT 2012, Proceedings

T2 - 23rd International Conference on Algorithmic Learning Theory, ALT 2012

Y2 - 29 October 2012 through 31 October 2012

ER -