Corpus ID: 17598332

# On the Approximation of Submodular Functions

@article{Devanur2013OnTA,
title={On the Approximation of Submodular Functions},
author={Nikhil R. Devanur and S. Dughmi and Roy Schwartz and Ankit Sharma and Mohit Singh},
journal={ArXiv},
year={2013},
volume={abs/1304.4948}
}
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and these subclasses widely vary in their complexity. Our motivation is to understand the relative complexity of these classes of functions. Towards this, we consider the question of how well can one class of submodular functions be approximated by another (simpler… Expand
Maximizing Symmetric Submodular Functions
• Moran Feldman
• Mathematics, Computer Science
• ACM Trans. Algorithms
• 2017
This work considers the problem of maximizing a non-negative symmetric submodular function f:2N → R+ subject to a down-monotone solvable polytope P ⊆ [0, 1]N and describes a deterministic linear-time 1/2-approximation algorithm solution. Expand
Approximate Submodular Functions and Performance Guarantees
• Computer Science
• ArXiv
• 2018
This work considers the problem of maximizing non-negative non-decreasing set functions and introduces a novel concept of $\delta$-approximation of a function, which is used to define the space of submodular functions that lie within an approximation error. Expand
Decomposable Submodular Function Minimization via Maximum Flow
• Computer Science
• ICML
• 2021
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide improved running timesExpand
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
• Computer Science, Mathematics
• NIPS
• 2013
It is shown that the complexity of all three problems connected to machine learning depends on the "curvature" of the submodular function, and lower and upper bounds are provided that refine and improve previous results. Expand
Submodular Point Processes with Applications to Machine learning
• Mathematics, Computer Science
• AISTATS
• 2015
This paper shows that computing the partition function for SPPs, requires exponential complexity in the worst case, and provides algorithms which approximate SPPs up to polynomial factors, and argues how SPPs complement existing LogSPP distributions, and are a natural model for several applications. Expand
Submodular Point Processes
We introduce a class of discrete point processes that we call the Submodular Point Processes (SPPs). These processes are characterized via a submodular (or supermodular) function, and naturally modelExpand
The Complexity of Boolean Surjective General-Valued CSPs
• Mathematics, Computer Science
• TOCT
• 2018
A dichotomy theorem is established and thus a complete complexity classification of Boolean surjective VCSPs with respect to exact solvability is given and a novel tractable class of languages is identified that is trivial in the non-surjective setting. Expand
The Complexity of Boolean Surjective General-Valued CSPs
• Mathematics, Computer Science
• MFCS
• 2017
A dichotomy theorem is established and thus a complete complexity classification of Boolean surjective VCSPs with respect to exact solvability is given and a novel tractable class of languages is identified that is trivial in the non-surjective setting. Expand
Hypergraph Cuts with General Splitting Functions
• Computer Science
• ArXiv
• 2020
This work develops a framework for hypergraph cuts by considering the problem of separating two terminal nodes in a hypergraph in a way that minimizes a sum of penalties at split hyperedges, and identifies a natural class of cardinality-based hyperedge splitting functions that depend only on the number of nodes on each side of the split. Expand
Learning Set Functions with Limited Complementarity
This work proves the first nontrivial learnability result for set functions exhibiting complementarity, generalizing Balcan and Harvey’s result for submodular functions and proves a nearly matching information theoretical lower bound on the number of samples required. Expand

#### References

SHOWING 1-10 OF 27 REFERENCES
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• Mathematics, Computer Science
• 2008 49th Annual IEEE Symposium on Foundations of Computer Science
• 2008
This work introduces several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions, and presents an algorithm for approximately learning sub modular functions with special structure, whose guarantee is close to the lower bound. Expand
Approximating submodular functions everywhere
• Computer Science, Mathematics
• SODA
• 2009
The problem of approximating a non-negative, monotone, submodular function f on a ground set of size n everywhere is considered, after only poly(n) oracle queries, and it is shown that no algorithm can achieve a factor better than Ω(√n/log n), even for rank functions of a matroid. Expand
Learning submodular functions
• Computer Science, Mathematics
• STOC '11
• 2011
This paper considers PAC-style learning of submodular functions in a distributional setting and uses lossless expanders to construct a new family of matroids which can take wildly varying rank values on superpolynomially many sets; no such construction was previously known. Expand
Is Submodularity Testable?
• Mathematics, Computer Science
• Algorithmica
• 2012
This work begins the study of property testing of submodularity on the boolean hypercube, and analyzes a natural tester for this problem, and proves an interesting lower bound suggesting that this tester cannot be efficient in terms of ϵ. Expand
An analysis of approximations for maximizing submodular set functions—I
• Mathematics, Computer Science
• Math. Program.
• 1978
It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm. Expand
Sketching valuation functions
• Computer Science, Mathematics
• SODA
• 2012
It is proved that every deterministic algorithm that accesses the function via value queries only cannot guarantee a sketching ratio better than n1−e, and it is shown that coverage functions, an interesting subclass of submodular functions, admit arbitrarily good sketches. Expand
A combinatorial strongly polynomial algorithm for minimizing submodular functions
• Mathematics, Computer Science
• JACM
• 2001
This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grötschel, Lovász, and Schrijver. The algorithm employsExpand
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions
• Mathematics, Computer Science
• STOC '11
• 2011
The authors' is the first truthful-in-expectation and polynomial-time mechanism to achieve a constant-factor approximation for an NP-hard welfare maximization problem in combinatorial auctions with heterogeneous goods and restricted valuations. Expand
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
• Mathematics, Computer Science
• ICALP
• 2012
The first randomized online algorithms for this problem with poly-logarithmic competitive ratio are presented, and a weighted-majority type update rule along with uncrossing properties of tight sets in the matroid polytope are extended to find an approximately optimal fractional LP solution. Expand
Testing Coverage Functions
• Mathematics, Computer Science
• ICALP
• 2012
An algorithm is demonstrated which makes O(m|U|) queries to an oracle of a coverage function and completely reconstructs it, giving a polytime tester for succinct coverage functions for which |U| is polynomially bounded in m. Expand