Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Algorithmic Learning Theory - 23rd International Conference, ALT 2012, Proceedings |
| Pages | 260-274 |
| Number of pages | 15 |
| DOIs | |
| Publication status | Published - 2012 |
| Event | 23rd International Conference on Algorithmic Learning Theory, ALT 2012 - Lyon, France Duration: Oct 29 2012 → Oct 31 2012 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 7568 LNAI |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 23rd International Conference on Algorithmic Learning Theory, ALT 2012 |
|---|---|
| Country | France |
| City | Lyon |
| Period | 10/29/12 → 10/31/12 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Fingerprint Dive into the research topics of 'Online prediction under submodular constraints'. Together they form a unique fingerprint.
Cite this
Suehiro, D., Hatano, K., Kijima, S., Takimoto, E., & Nagano, K. (2012). Online prediction under submodular constraints. In Algorithmic Learning Theory - 23rd International Conference, ALT 2012, Proceedings (pp. 260-274). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7568 LNAI). https://doi.org/10.1007/978-3-642-34106-9_22