Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Submodular set function

Optimization Algorithm

A submodular set function assigns a value to every subset of some ground set so that adding a new element to a smaller set increases the value at least as much as adding that same element to any larger set already containing it, a diminishing-returns property. This structure appears naturally across many domains: it models user preferences in game theory, describes flow capacity in electrical networks, and underlies a wide family of approximation algorithms because the diminishing-returns property lets a simple greedy strategy provide a provable performance guarantee when maximizing the function subject to a budget. Submodular functions have since become central to machine learning and artificial intelligence, where they are used for automatic and multi-document summarization, feature selection, active learning, sensor placement and image-collection summarization. The diminishing-returns behavior lets algorithm designers model cost structures with bulk discounts and represent diversity or information coverage, making submodular optimization a standard tool for problems where more of the same input yields progressively smaller benefit.

Facts
Classification
Design Technique
Greedy 1
Design Technique
Heuristic or Approximation 1
Connections

Uses Design Technique

Sources
1. Submodular set function (Wikipedia)
Lead section
Quote, Lead section
In mathematics, a submodular set function (also known as a submodular function) is a set function that, informally, describes the relationship between a set of inputs and an output, where adding more of one input has a decreasing additional benefit (diminishing returns).
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.