Learning to Act Greedily: Polymatroid Semi-Bandits

CoRR, Volume abs/1405.7752, 2014.

Cited by: 8|Views15
EI

Abstract:

Many important optimization problems, such as the minimum spanning tree and minimum-cost flow, can be solved optimally by a greedy method. In this work, we study a learning variant of these problems, where the model of the problem is unknown and has to be learned by interacting repeatedly with the environment in the bandit setting. We f...More

Code:

Data:

Your rating :
0

 

Tags
Comments