Research map / Learning theory and algorithms / Submodular and game algorithms
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 dynamic submodular sharpness instead of curvature or monotonic sharpness to bound greedy performance | Greedy · Parkinson Telemonitoring non-parametric learning | approximation factor | Helped |
| Use submodular sharpness instead of curvature analysis or monotonic sharpness | Greedy · MovieLens concave over modular, α = 0.8 | approximation factor | Helped |
| Use submodular sharpness instead of curvature analysis or monotonic sharpness | Greedy · MovieLens facility location | approximation factor | Helped |
| Use dynamic submodular sharpness rather than the other analyzed procedures | Greedy · VOC2012 exemplar-based clustering | approximation factor | Helped |
| Use monotonic sharpness rather than the worst-case guarantee | Greedy · MovieLens concave over modular, α = 0.8 | approximation factor | Helped |
Closest papers by meaning
- Guarantees for Greedy Maximization of Non-submodular Functions with Applications (ICML 2017 · similarity 0.91)
- Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints (AAAI 2019 · similarity 0.90)
- Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time (NeurIPS 2019 · similarity 0.90)
- Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions (ICML 2018 · similarity 0.90)
- A Unified Approach to Submodular Maximization Under Noise (NeurIPS 2025 · similarity 0.88)
- From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization (NeurIPS 2024 · similarity 0.87)
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.