Research map / Learning theory and algorithms / Submodular and game algorithms
Submodular Maximization via Gradient Ascent: The Case of Deep Submodular 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
- Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions (ICML 2018 · similarity 0.92)
- Efficient Submodular Maximization for Sums of Concave over Modular Functions (ICLR 2026 · similarity 0.92)
- Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization (NeurIPS 2024 · similarity 0.90)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.89)
- Online Submodular Maximization via Online Convex Optimization (AAAI 2024 · similarity 0.89)
- 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.