Neural Estimation of Submodular Functions with Applications to Differentiable Subset Selection
Abir De, Soumen Chakrabarti
Abstract
Submodular functions and variants, through their ability to characterize diversity and coverage, have emerged as a key tool for data selection and summarization. Many recent approaches to learn submodular functions suffer from limited expressiveness. In this work, we propose FLEXSUBNET, a family of flexible neural models for both monotone and non-monotone submodular functions. To fit a latent submodular function from (set, value) observations, FLEXSUBNET applies a concave function on modular functions in a recursive manner. We do not draw the concave function from a restricted family, but rather learn from data using a highly expressive neural network that implements a differentiable quadrature procedure. Such an expressive neural model for concave functions may be of independent interest. Next, we extend this setup to provide a novel characterization of monotone -submodular functions, a recently introduced notion of approximate submodular functions. We then use this characterization to design a novel neural model for such functions. Finally, we consider learning submodular set functions under distant supervision in the form of (perimeter-set, high-value-subset) pairs. This yields a novel subset selection method based on an order-invariant, yet greedy sampler built around the above neural set functions. Our experiments on synthetic and real data show that FLEXSUBNET outperforms several baselines.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ce2e1609-162f-46e2-9143-26300e19c310Cited by top-tier papers5
- Incentive-Aware Federated Learning with Training-Time Model RewardsZhaoxuan Wu, Mohammad Mohammadi Amiri, Ramesh Raskar, Bryan Kian Hsiang LowICLR 2024 · 9 citations
- Monotone and Separable Set Functions: Characterizations and Neural ModelsSoutrik Sarangi, Yonatan Sverdlov, Nadav Dym, Abir DeNeurIPS 2025 · 2 citations
- Deep Submodular Peripteral NetworksGantavya Bhatt, Arnav Das, Jeff A. BilmesNeurIPS 2024 · 1 citation
- A Closed-Form Solution for Fast and Reliable Adaptive TestingYan Zhuang, Chenye Ke, Zirui Liu, Qi Liu et al.NeurIPS 2025
- Learning Set Functions with Implicit DifferentiationGözde Özcan, Chengzhi Shi, Stratis IoannidisAAAI 2025
Builds on11
- Differentiable Learning Under TriageNastaran Okati, Abir De, Manuel Gomez-RodriguezNeurIPS 2021 · 99 citations
- Interpretable Neural Subgraph Matching for Graph RetrievalIndradyumna Roy, Venkata Sai Baba Reddy Velugoti, Soumen Chakrabarti, Abir DeAAAI 2022 · 51 citations
- Optimal approximation for unconstrained non-submodular minimizationMarwa El Halabi, Stefanie JegelkaICML 2020 · 27 citations
- Training Data Subset Selection for Regression with Controlled Generalization ErrorDurga Sivasubramanian, Rishabh K. Iyer, Ganesh Ramakrishnan, Abir DeICML 2021 · 25 citations
- Adversarial Permutation Guided Node Representations for Link PredictionIndradyumna Roy, Abir De, Soumen ChakrabartiAAAI 2021 · 17 citations
Related papers
- Difference-of-submodular Bregman DivergenceMasanari Kimura, Takahiro Kawashima, Tasuku Soma, Hideitsu HinoICLR 2025
- Bicriteria Approximation Algorithms for the Submodular Cover ProblemWenjing Chen, Victoria G. CrawfordNeurIPS 2023 · 10 citations
- Using Partial Monotonicity in Submodular MaximizationLoay Mualem, Moran FeldmanNeurIPS 2022 · 13 citations
- Instance Specific Approximations for Unconstrained Submodular Maximization with Modular CostsTong Cheng, Xueyan TangKDD 2026
- Fair Submodular CoverWenjing Chen, Shuo Xing, Samson Zhou, Victoria G. CrawfordICLR 2025
