Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bicriteria Approximation Algorithms for the Submodular Cover Problem (2309.14558v1)

Published 25 Sep 2023 in cs.DS

Abstract: In this paper, we consider the optimization problem Submodular Cover (SCP), which is to find a minimum cardinality subset of a finite universe $U$ such that the value of a submodular function $f$ is above an input threshold $\tau$. In particular, we consider several variants of SCP including the general case, the case where $f$ is additionally assumed to be monotone, and finally the case where $f$ is a regularized monotone submodular function. Our most significant contributions are that: (i) We propose a scalable algorithm for monotone SCP that achieves nearly the same approximation guarantees as the standard greedy algorithm in significantly faster time; (ii) We are the first to develop an algorithm for general SCP that achieves a solution arbitrarily close to being feasible; and finally (iii) we are the first to develop algorithms for regularized SCP. Our algorithms are then demonstrated to be effective in an extensive experimental section on data summarization and graph cut, two applications of SCP.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. Non-monotone submodular maximization in exponentially fewer iterations. Advances in Neural Information Processing Systems, 31, 2018.
  2. Generalized submodular information measures: Theoretical properties, examples, optimization algorithms, and applications. IEEE Transactions on Information Theory, 68(2):752–781, 2021.
  3. Near-optimal map inference for determinantal point processes. Advances in Neural Information Processing Systems, 25, 2012.
  4. Almost optimal streaming algorithms for coverage problems. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pages 13–23, 2017.
  5. Similar: Submodular information measures based active learning in realistic scenarios. Advances in Neural Information Processing Systems, 34:18685–18697, 2021.
  6. Talisman: targeted active learning for object detection with rare classes and slices using submodular mutual information. In Computer Vision–ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XXXVIII, pages 1–16. Springer, 2022.
  7. Submodular feature selection for partial label learning. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 26–34, 2022.
  8. Data-efficient structured pruning via submodular optimization. Advances in Neural Information Processing Systems, 35:36613–36626, 2022.
  9. Learning mixtures of submodular functions for image collection summarization. Advances in neural information processing systems, 27, 2014.
  10. Diverse client selection for federated learning via submodular maximization. In International Conference on Learning Representations, 2022.
  11. An analysis of approximations for maximizing submodular set functions—i. Mathematical programming, 14(1):265–294, 1978a.
  12. Lazier than lazy greedy. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 29, 2015a.
  13. Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications. In International Conference on Machine Learning, pages 2634–2643. PMLR, 2019.
  14. Submodular maximization with cardinality constraints. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1433–1452. SIAM, 2014.
  15. Optimal marketing strategies over social networks. In Proceedings of the 17th international conference on World Wide Web, pages 189–198, 2008.
  16. Uriel Feige. A threshold of ln n for approximating set cover. Journal of the ACM (JACM), 45(4):634–652, 1998.
  17. Submodular optimization with submodular cover and submodular knapsack constraints. Advances in neural information processing systems, 26, 2013a.
  18. Laurence A Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2(4):385–393, 1982.
  19. Greedy approximations for minimum submodular cover with submodular cost. Computational Optimization and Applications, 45(2):463–474, 2010.
  20. Distributed submodular cover: Succinctly summarizing massive data. In Advances in Neural Information Processing Systems, pages 2881–2889, 2015b.
  21. Fast distributed submodular cover: Public-private data summarization. In Advances in Neural Information Processing Systems, pages 3594–3602, 2016.
  22. Submodular cost submodular cover with an approximate oracle. In International Conference on Machine Learning, pages 1426–1435. PMLR, 2019.
  23. Robust submodular observation selection. Journal of Machine Learning Research, 9(12), 2008.
  24. Distributed submodular cover: Succinctly summarizing massive data. Advances in Neural Information Processing Systems, 28, 2015c.
  25. An efficient streaming algorithm for the submodular cover problem. In Advances in Neural Information Processing Systems, pages 4493–4501, 2016.
  26. Victoria Crawford. Scalable bicriteria algorithms for non-monotone submodular cover. In International Conference on Artificial Intelligence and Statistics, pages 9517–9537. PMLR, 2023.
  27. An optimal streaming algorithm for submodular maximization with a cardinality constraint. Mathematics of Operations Research, 47(4):2667–2690, 2022.
  28. An analysis of approximations for maximizing submodular set functions—i. Mathematical programming, 14(1):265–294, 1978b.
  29. Fast algorithms for maximizing submodular functions. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1497–1514. SIAM, 2014.
  30. Maximizing non-monotone submodular functions. SIAM Journal on Computing, 40(4):1133–1153, 2011.
  31. Submodular optimization with submodular cover and submodular knapsack constraints. In Advances in Neural Information Processing Systems, pages 2436–2444, 2013b.
  32. Submodular maximization by simulated annealing. In Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms, pages 1098–1116. SIAM, 2011.
  33. Regularized submodular maximization at scale. In International Conference on Machine Learning, pages 5356–5366. PMLR, 2021.
  34. Semi-supervised multi-label topic models for document classification and sentence labeling. In Proceedings of the 25th ACM international on conference on information and knowledge management, pages 105–114, 2016.
  35. Snap: A general-purpose network analysis and graph-mining library. ACM Transactions on Intelligent Systems and Technology (TIST), 8(1):1–20, 2016.
  36. A tight linear time (1/2)-approximation for unconstrained submodular maximization. SIAM Journal on Computing, 44(5):1384–1402, 2015.
  37. Object recognition as machine translation: Learning a lexicon for a fixed image vocabulary. In Computer Vision—ECCV 2002: 7th European Conference on Computer Vision Copenhagen, Denmark, May 28–31, 2002 Proceedings, Part IV 7, pages 97–112. Springer, 2002.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now