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. © 2012 Springer-Verlag.
CITATION STYLE
Suehiro, D., Hatano, K., Kijima, S., Takimoto, E., & Nagano, K. (2012). Online prediction under submodular constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7568 LNAI, pp. 260–274). https://doi.org/10.1007/978-3-642-34106-9_22
Mendeley helps you to discover research relevant for your work.