We consider the most influential subset selection (MISS) problem and identify various failure modes of the greedy-based algorithm used by the community, and prove that being "adaptive" helps in a non-obvious way.
Exploring a novel approach to exactly solve an NP-hard combinatorial optimization problem by using imitation learning.