atlas

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

Randomized Algorithms for Submodular Function Maximization with a $k$-System Constraint

ICML 2021 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 7 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
randomized RANDOMMULTIGREEDY with ℓ=2 and p=2/(1+√k) instead of prior deterministic algorithmsnon-adaptive k-system submodular maximization · theoryapproximation ratio: (1+√k)^2 vs k+2√k+2+3 for prior bestHelped
accelerate RANDOMMULTIGREEDY via lazy evaluationRANDOMMULTIGREEDY · movie recommendation, image summarization, social advertisingnumber of oracle queriesHelped
randomized adaptive policy ADAPTRANDOMGREEDY for non-monotone adaptive objectivesadaptive k-system submodular maximization · social advertising with multiple productsutilityHelped
randomized sampling of RAMG with p in (0.9,1) (RAMG+) (ablation)RANDOMMULTIGREEDY · social advertising with multiple productsutilityHelped
RAMG vs FSGS on utilityRAMG · image summarizationutilityNo 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