AI Paper Atlas

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

Fast Parallel Algorithms for Statistical Subset Selection Problems

Sharon Qian, Yaron Singer

NeurIPS 2019 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms · 3 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 DASH instead of parallelized SDSMASDSMA · feature selection / experimental designrunning timeImproved
use DASH instead of sequential greedy SDSMA on cheap oracle queriesSDSMA · synthetic dataobjective valueNo clear effect
use DASH instead of RANDOM or TOP-kRANDOM / TOP-k · all applicationsobjective valueImproved
use DASH instead of LASSOLASSO · synthetic linear regressionR2Improved
use DASH instead of LASSOLASSO · other experimentsaccuracyNo clear effect
parallelize SDSMA when oracle queries are cheapSDSMA · synthetic datarunning timeHurt
parallelize SDSMA when oracle queries are expensiveSDSMA · logistic regression gene selectionrunning timeImproved
use DASH instead of SDSMA at small kSDSMA · logistic regressionrunning timeHurt
use RANDOM when few features sufficeRANDOM · D2accuracyMixed

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