Research map / Learning theory and algorithms / Submodular and game algorithms
Continuous Submodular Maximization: Beyond DR-Submodularity
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
- Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization (NeurIPS 2018 · similarity 0.92)
- Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions (NeurIPS 2018 · similarity 0.92)
- Gradient Methods for Submodular Maximization (NeurIPS 2017 · similarity 0.91)
- A General Framework for Dynamic Consistent Submodular Maximization (ICML 2026 · similarity 0.91)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.91)
- Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization (NeurIPS 2024 · 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.