AI Paper Atlas

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

Horizontally Scalable Submodular Maximization

Mario Lucic, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause

ICML 2016 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 iterative random partitioning and compression across multiple rounds under fixed machine capacityTREE submodular maximization · Active set selection and exemplar-based clusteringapproximation ratio to centralized GREEDYImproved
Use STOCHASTIC GREEDY instead of GREEDY as the compression subprocedure (ablation)TREE · TINYobjective valueHurt
Use STOCHASTIC GREEDY instead of GREEDY as the compression subprocedure (ablation)TREE · WEBSCOPEobjective valueNo clear effect
Increase machine capacity while keeping the problem and method fixedTREE · WEB-100K, k=50relative error (%): 0.01, 0.00, 0.02Mixed

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