Abstract
We consider an online decision problem over a discrete space in which the loss function is submodular. We give algorithms which are computationally efficient and are Hannan-consistent in both the full information and bandit settings.
| Original language | English (US) |
|---|---|
| Title of host publication | Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference |
| Pages | 700-708 |
| Number of pages | 9 |
| State | Published - Dec 1 2009 |
| Externally published | Yes |
| Event | 23rd Annual Conference on Neural Information Processing Systems, NIPS 2009 - Vancouver, BC, Canada Duration: Dec 7 2009 → Dec 10 2009 |
Other
| Other | 23rd Annual Conference on Neural Information Processing Systems, NIPS 2009 |
|---|---|
| Country/Territory | Canada |
| City | Vancouver, BC |
| Period | 12/7/09 → 12/10/09 |
All Science Journal Classification (ASJC) codes
- Information Systems