Research map / Learning theory and algorithms / Submodular and game algorithms
DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization
Tonmoy Dey, Yixin Chen, Alan Kuhnle
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 |
|---|---|---|---|
| Replace GREEDY in the distributed framework with parallelizable LAG | R-DASH · decentralized datasets | runtime: 190 times faster | Improved |
| Replace GREEDY in the distributed framework with parallelizable LAG | R-DASH · ImageSumm | runtime: 8000 times quicker | Improved |
| Use sublinear-adaptive R-DASH instead of existing distributed algorithms | centralized datasets · ImageSumm and InfluenceMax | solution value | No clear effect |
| Use T-DASH rather than the other evaluated algorithms | centralized datasets · ImageSumm and InfluenceMax | solution value | Hurt |
| Use T-DASH with only 4 threads per machine | T-DASH · centralized data | parallel runtime | Hurt |
| Increase the number of machines from 8 to 32 | RANDGREEDI · centralized data when k > n/322 | relative performance | Hurt |
| Increase the number of machines | R-DASH · scalability experiment | speedup | Improved |
| Use LAG instead of GREEDY in the distributed distorted framework | G-DASH · SMCC | approximation ratio: 1 − 1/e − ε | Improved |
| Use LAT with threshold αOPT/k in the single-round distributed construction | T-DASH · SMCC | approximation ratio: 3/8 − ε | Improved |
| Apply MED when the objective satisfies Condition 1 | MED · SMCC | maximum cardinality constraint: n | Improved |
Closest papers by meaning
- Distributed Submodular Maximization (JMLR 2016 · similarity 0.92)
- Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization (AAAI 2021 · similarity 0.91)
- Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity (ICML 2019 · similarity 0.91)
- Non-monotone Submodular Maximization in Exponentially Fewer Iterations (NeurIPS 2018 · similarity 0.91)
- Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation (ICML 2025 · similarity 0.89)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.88)
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.
