Research map / Learning theory and algorithms / Submodular and game algorithms
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
Alan Kuhnle, J. David Smith, Victoria Crawford, My Thai
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use ThresholdGreedy instead of StandardGreedy | GIM · GrQc and Facebook | function queries | Improved |
| Use ThresholdGreedy instead of StandardGreedy | GIM · GrQc | solution quality | No clear effect |
| Use FastGreedy instead of ThresholdGreedy | GIM · GrQc and Facebook | function queries: at least 14.5% fewer; up to 43% fewer | Improved |
| Use FastGreedy instead of ThresholdGreedy | GIM · Facebook | solution quality: up to 3% | Hurt |
| Use FastGreedy instead of StandardGreedy | GIM · Facebook | function queries: up to 20M queries | Improved |
Closest papers by meaning
- Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization (AAAI 2021 · similarity 0.92)
- Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation (ICML 2025 · similarity 0.90)
- A Near Linear Query Lower Bound for Submodular Maximization (ICML 2025 · similarity 0.90)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.90)
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.89)
- A Unified Approach to Submodular Maximization Under Noise (NeurIPS 2025 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
