atlas

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

Deletion-Robust Submodular Maximization: Data Summarization with “the Right to be Forgotten”

ICML 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms

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 r instances of streaming algorithm (ROBUST-STREAMING) instead of single SIEVE-STREAMING to support deletionsSIEVE-STREAMING on image collection · 100 images, k=5, r=3normalized objective value vs. greedy knowing deletionsHelped
Increase memory from 1 to r instances with ROBUST-STREAMING under random deletions (ablation)Yahoo! Webscope click logs · Yahoo! Webscope, 99% deletednormalized AUC improvementHelped
Naively keep a larger solution (k+m) in a streaming algorithm instead of robust chainingStreaming submodular maximization with deletions · Coverage bad exampleobjective value after deleting B1Hurt
Use stochastic/random greedy deletions (RG/SG) versus deleting representative elementsSTREAM-GREEDY on geolocation data · geolocation, deletions during streamnormalized objective valueMixed

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