Learning submodular functions
From MaRDI portal
Publication:5419150
DOI10.1145/1993636.1993741zbMath1288.90068OpenAlexW2023627355MaRDI QIDQ5419150
Maria-Florina Balcan, Nicholas J. A. Harvey
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993741
Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (18)
The Limitations of Optimization from Samples ⋮ Buy-many mechanisms are not much better than item pricing ⋮ Recognizing Coverage Functions ⋮ On additive approximate submodularity ⋮ Tractability of explaining classifier decisions ⋮ A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function ⋮ Unnamed Item ⋮ Maximize a monotone function with a generic submodularity ratio ⋮ Is submodularity testable? ⋮ A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions ⋮ Approximate F_2-Sketching of Valuation Functions ⋮ The Complexity of Partial Function Extension for Coverage Functions ⋮ Deterministic approximation algorithm for submodular maximization subject to a matroid constraint ⋮ Economic efficiency requires interaction ⋮ Approximate Modularity Revisited ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Learning submodular functions
