Learning to Act Greedily: Polymatroid Semi-Bandits

Branislav Kveton, Zheng Wen, Azin Ashkan +1

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…