atlas

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

Deletion Robust Submodular Maximization over Matroids

ICML 2022 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization · 4 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 a threshold-bucket summary and randomized selection for deletion robustness in the centralized settingMonotone submodular maximization over general matroids · Centralized deletion-robustapproximation factor: 3.582+O(ε)Helped
Use a streaming summary with threshold buckets and matroid-feasible swapsMonotone submodular maximization over general matroids · Streaming deletion-robustapproximation factor: 5.582+O(ε)Helped
Increase ε from 0.3 to 0.99 (ablation)Proposed algorithms · Additional experiments across datasetsobjective value: ≈ 1300 to ≈ 1200Hurt
Use the streaming deletion-robust algorithm instead of its omniscient counterpartStreaming algorithm · Reported experimentsobjective value: up to 20%; up to 2%Mixed
Use the centralized deletion-robust algorithm instead of the omniscient benchmarkCentralized algorithm · Reported experimentsobjective value relative to omniscient benchmark: 90-95%Hurt

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