A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Online convex optimization in the bandit setting: gradient descent without a gradient
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Prediction, Learning, and Games
Prediction, Learning, and Games
The weighted majority algorithm
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A faster strongly polynomial time algorithm for submodular function minimization
Mathematical Programming: Series A and B
A simple combinatorial algorithm for submodular function minimization
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Submodularity and its applications in optimized information gathering
ACM Transactions on Intelligent Systems and Technology (TIST)
| Hi-index | 0.00 |
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 partial feedback settings.