Research map / Learning theory and algorithms / Submodular and game algorithms
Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection
Abhimanyu Das, David Kempe
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 |
|---|---|---|---|
| prune sets with marginal gain at most eps=0.2 when computing the submodularity ratio of Forward Regression | Forward Regression analysis · Boston Housing and World Bank | submodularity ratio: less than 0.4 -> more than 0.8 | Improved |
Closest papers by meaning
- Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? (ICML 2018 · similarity 0.91)
- Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization (ICML 2016 · similarity 0.90)
- Subspace Selection via DR-Submodular Maximization on Lattices (AAAI 2019 · similarity 0.89)
- Optimal approximation for unconstrained non-submodular minimization (ICML 2020 · similarity 0.89)
- Instance Specific Approximations for Submodular Maximization (ICML 2021 · similarity 0.89)
- Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems (NeurIPS 2025 · similarity 0.88)
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.
