Creator |
|
|
|
|
|
Language |
|
Publisher |
|
Date |
|
Conference |
|
Publication Type |
|
Access Rights |
|
Related DOI |
|
Related DOI |
|
Relation |
|
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.show more
|