Amanjit Kainth

Differentiable Greedy Networks

2018 · arXiv (Cornell University)

Optimal selection of a subset of items from a given set is a hard problem that requires combinatorial optimization. In this paper, we propose a subset selection algorithm that is trainable with gradient-based methods yet …