Deep Submodular Functions
Not on the map. Why?
Abstract (arXiv)
We start with an overview of a class of submodular functions called SCMMs (sums of concave composed with non-negative modular functions plus a final arbitrary modular). We then define a new class of submodular functions we call em deep submodular functions or DSFs. We show that DSFs are a flexible parametric family of submodular functions that share many of the properties and advantages of deep neural networks (DNNs). DSFs can be motivated by considering a hierarchy of descriptive concepts over ground elements and where one wishes to allow submodular interaction throughout this hierarchy. Results in this paper show that DSFs constitute a strictly larger class of submodular functions than SCMMs. We show that, for any integer k>0, there are k-layer DSFs that cannot be represented by a k'-layer DSF for any k'<k. This implies that, like DNNs, there is a utility to depth, but unlike DNNs, the family of DSFs strictly increase with depth. Despite this, we show (using a "backpropagation" like method) that DSFs, even with arbitrarily large k, do not comprise all submodular functions. In offering the above results, we also define the notion of an antitone superdifferential of a concave function and show how this relates to submodular functions (in general), DSFs (in particular), negative second-order partial derivatives, continuous submodularity, and concave extensions. To further motivate our analysis, we provide various special case results from matroid theory, comparing DSFs with forms of matroid rank, in particular the laminar matroid. Lastly, we discuss strategies to learn DSFs, and define the classes of deep supermodular functions, deep difference of submodular functions, and deep multivariate submodular functions, and discuss where these can be useful in applications.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Jan 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 0; 2024: 5; 2025: 0; 2026: 2.
11 papers.
- 2022Submodularity In Machine Learning and Artificial Intelligencecited by 37
- 2024An Experimental Design Framework for Label-Efficient Supervised Finetuning of Large Language Modelscited by 22
- 2022Learning Neural Set Functions Under the Optimal Subset Oraclecited by 10
- 2022Neural Estimation of Submodular Functions with Applications to Differentiable Subset Selectioncited by 6
- 2024PostDoc: Generating Poster from a Long Multimodal Document Using Deep Submodular Optimizationcited by 5
- 2024Deep Submodular Peripteral Networkscited by 1
- 2024Learning Set Functions with Implicit Differentiationcited by 1
- 2021DISCO : efficient unsupervised decoding for discrete natural language problems via convex relaxationcited by 0
- 2024Extended Deep Submodular Functionscited by 0
- 2026Active Value Querying to Minimize Additive Error in Subadditive Set Function Learningcited by 0
- 2026Advancing Optimal Subset Oracle via Learning Relaxation of Neural Set Functionscited by 0
- 2026Advancing Optimal Subset Oracle via Learning Relaxation of Neural Set Functions13 Jul 2026
- 2026Active Value Querying to Minimize Additive Error in Subadditive Set Function Learning26 Feb 2026
- 2024Learning Set Functions with Implicit Differentiation15 Dec 2024
- 2024Extended Deep Submodular Functions18 Sep 2024
- 2024PostDoc: Generating Poster from a Long Multimodal Document Using Deep Submodular Optimization30 May 2024
- 2024Deep Submodular Peripteral Networks13 Mar 2024
- 2024An Experimental Design Framework for Label-Efficient Supervised Finetuning of Large Language Models12 Jan 2024
- 2022Neural Estimation of Submodular Functions with Applications to Differentiable Subset Selection20 Oct 2022
- 2022Learning Neural Set Functions Under the Optimal Subset Oracle3 Mar 2022
- 2022Submodularity In Machine Learning and Artificial Intelligence31 Jan 2022
- 2021DISCO : efficient unsupervised decoding for discrete natural language problems via convex relaxation7 Jul 2021