TOPICS
Search

Submodular Function


A submodular function on a finite set E is a real-valued function r on its subsets satisfying

 r(A)+r(B)>=r(A union B)+r(A intersection B)

for every A,B subset= E. This inequality expresses diminishing marginal gains: the change from adding an element outside a set is at least as large for a subset as for the containing set (Bach 2013, p. 154). A normalized function has r(emptyset)=0, and a nondecreasing function satisfies r(A)<=r(B) when A subset= B. Matroid rank is an integer-valued example. Polymatroids use normalized nondecreasing submodular functions as capacity bounds.


See also

Matroid Rank, Polymatroid, Subset

Explore with Wolfram|Alpha

References

Bach, F. "Learning with Submodular Functions: A Convex Optimization Perspective." Found. Trends Mach. Learn. 6, 145-373, 2013. https://doi.org/10.1561/2200000039.

Cite this as:

Weisstein, Eric W. "Submodular Function." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SubmodularFunction.html

Subject classifications