Interactive Submodular Set Cover
Andrew Guillory, Jeff Bilmes

TL;DR
This paper introduces interactive submodular set cover, a generalization of submodular set cover and active learning, providing approximation guarantees, hardness results, and initial experimental insights.
Contribution
It defines the interactive submodular set cover problem, offers a greedy algorithm with approximation guarantees, and establishes matching hardness results.
Findings
Greedy algorithm achieves provable approximation bounds.
Hardness of approximation matches the algorithm's guarantees.
Early experiments show promising practical performance.
Abstract
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submodular set cover. Applications include advertising in social networks with hidden information. We give an approximation guarantee for a novel greedy algorithm and give a hardness of approximation result which matches up to constant factors. We also discuss negative results for simpler approaches and present encouraging early experimental results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Complexity and Algorithms in Graphs · Algorithms and Data Compression
