Research map / Learning theory and algorithms / Submodular and game algorithms
Fast Parallel Algorithms for Statistical Subset Selection Problems
Sharon Qian, Yaron Singer
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use DASH instead of parallelized SDSMA | SDSMA · feature selection / experimental design | running time | Improved |
| use DASH instead of sequential greedy SDSMA on cheap oracle queries | SDSMA · synthetic data | objective value | No clear effect |
| use DASH instead of RANDOM or TOP-k | RANDOM / TOP-k · all applications | objective value | Improved |
| use DASH instead of LASSO | LASSO · synthetic linear regression | R2 | Improved |
| use DASH instead of LASSO | LASSO · other experiments | accuracy | No clear effect |
| parallelize SDSMA when oracle queries are cheap | SDSMA · synthetic data | running time | Hurt |
| parallelize SDSMA when oracle queries are expensive | SDSMA · logistic regression gene selection | running time | Improved |
| use DASH instead of SDSMA at small k | SDSMA · logistic regression | running time | Hurt |
| use RANDOM when few features suffice | RANDOM · D2 | accuracy | Mixed |
Closest papers by meaning
- The FAST Algorithm for Submodular Maximization (ICML 2020 · similarity 0.90)
- Greedy Column Subset Selection: New Bounds and Distributed Algorithms (ICML 2016 · similarity 0.89)
- Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity (AAAI 2023 · similarity 0.88)
- Improved Theoretically-Grounded Evolutionary Algorithms for Subset Selection with a Linear Cost Constraint (ICML 2025 · similarity 0.86)
- Multinoulli Extension: A Lossless Yet Effective Probabilistic Framework for Subset Selection over Partition Constraints (ICML 2025 · similarity 0.86)
- GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility (NeurIPS 2025 · similarity 0.85)
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.
