Matroid Bandits: Fast Combinatorial Optimization with Learning
UAI, pp. 420-429, 2014.
A matroid is a notion of independence in combinatorial optimization which is closely related to computational efficiency. In particular, it is well known that the maximum of a constrained modular function can be found greedily if and only if the constraints are associated with a matroid. In this paper, we bring together the ideas of ban...More
PPT (Upload PPT)