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 |
| Volume | 7568 LNAI |
| DOIs | |
| Publication status | Published - Oct 30 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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Online prediction under submodular constraints. / Suehiro, Daiki; hatano, kohei; Kijima, Shuji; Takimoto, Eiji; Nagano, Kiyohito.
Algorithmic Learning Theory - 23rd International Conference, ALT 2012, Proceedings. Vol. 7568 LNAI 2012. p. 260-274 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7568 LNAI).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
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/10/30
Y1 - 2012/10/30
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
VL - 7568 LNAI
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
ER -