Research map / Learning theory and algorithms / Submodular and game algorithms
Efficient Submodular Maximization for Sums of Concave over Modular Functions
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.
Closest papers by meaning
- Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions (NeurIPS 2018 · similarity 0.92)
- Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity (ICML 2019 · similarity 0.92)
- Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions (ICML 2018 · similarity 0.92)
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.91)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.91)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.90)
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.