atlas

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

Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization

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

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use GAME instead of BMBKcontinuous bi-greedy optimization · NQP strong-DRaverage objective value: 1225.738044 -> 1225.840375No clear effect
Use BINARY instead of BMBKstrong-DR continuous bi-greedy optimization · NQP strong-DRaverage objective value: 1225.738044 -> 1225.816408No clear effect
Use GAME instead of BMBKcontinuous bi-greedy optimization · NQP weak-DRaverage objective value: 1203.424957 -> 1203.288522No clear effect
Use BINARY instead of BMBKstrong-DR continuous bi-greedy optimization · NQP weak-DRaverage objective value: 1203.424957 -> 1202.737999No clear effect
Use GAME instead of BMBKcontinuous bi-greedy optimization · Softmax extension (DPP, strong-DR)average objective value: 24.055435 -> 24.056934No clear effect
Use BINARY instead of BMBKstrong-DR continuous bi-greedy optimization · Softmax extension (DPP, strong-DR)average objective value: 24.055435 -> 23.945428No clear effect

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