Research map / Learning theory and algorithms / Submodular and game algorithms
Efficient Submodular Optimization under Noise: Local Search is Robust
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
- A Unified Approach to Submodular Maximization Under Noise (NeurIPS 2025 · similarity 0.96)
- Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity (ICML 2019 · similarity 0.92)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.90)
- Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization (NeurIPS 2024 · similarity 0.90)
- A Near Linear Query Lower Bound for Submodular Maximization (ICML 2025 · similarity 0.90)
- Consistent Submodular Maximization (ICML 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.