Research map / Learning theory and algorithms / Submodular and game algorithms
Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design
Jayanth Jagalur-Mohan, Youssef Marzouk
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Guarantees for Greedy Maximization of Non-submodular Functions with Applications (ICML 2017 · similarity 0.93)
- Optimization for Approximate Submodularity (NeurIPS 2018 · similarity 0.91)
- Optimal approximation for unconstrained non-submodular minimization (ICML 2020 · similarity 0.90)
- Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? (ICML 2018 · similarity 0.90)
- Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions (ICML 2018 · similarity 0.90)
- Consistent Submodular Maximization (ICML 2024 · 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.
