AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Non-monotone Submodular Maximization in Exponentially Fewer Iterations

Eric Balkanski, Adam Breuer, Yaron Singer

NeurIPS 2018 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 17 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Choose the highest-value sample rather than a randomly chosen sample (ablation)BLOCKIT · Experiments across synthetic graphs and real-data applicationssolution valueImproved
Decrease the OPT parameter from the greedy solution value to 0.7 times that value (ablation)BLOCKIT · Movie recommendationsolution valueImproved
Reduce r to 5 and increase OPT from the greedy solution value to 3.5 times that value (ablation)BLOCKIT · Revenue maximizationsolution valueImproved
Use filtering that removes negative elements before adding blocksBLOCKIT · Experiments across eight settingssolution size: ∼10-15% fewer than k elementsMixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy