AI Paper Atlas

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

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams

ICML 2018 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms · 42 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 adaptive thresholding instead of Sieve-Streaming's thresholdingSalsa · Maximum coverage in graphs, exemplar-based clustering, and movie recommendationutility: around 10%Helped
Use Salsa rather than Sieve-StreamingSalsa · CIFAR-10 exemplar-based clusteringutility: around 5% higher utilityHelped
Use Salsa rather than Sieve-StreamingSalsa · Spambase exemplar-based clusteringutilityHelped
Use Salsa or Two-Pass rather than Sieve-StreamingSalsa and Two-Pass · Personalized movie recommendation, MovieLens 1Mgap to Greedy: around 40% of the gapHelped
Use two passes with a lower threshold on the second passTwo-Pass · Monotone submodular maximizationapproximation ratio: 5/9Helped
Use a random-order stream rather than relying on arbitrary orderSalsa · Monotone submodular maximizationapproximation ratio: 0.5 to a constant α > 0.5Helped

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