Research map / Learning theory and algorithms / Prediction and decision losses
A Randomized Algorithm to Reduce the Support of Discrete Measures
Francesco Cosentino, Harald Oberhauser, Alessandro Abate
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 greedy geometric selection of cone-basis points instead of repeated random basis sampling (ablation) | Measure reduction algorithm · Synthetic measure reduction | running time | Improved |
| Use greedy geometric selection of cone-basis points instead of repeated random basis sampling (ablation) | Measure reduction algorithm · Synthetic measure reduction | number of iterations | Improved |
| Add Las Vegas resets to the optimized algorithm (ablation) | Optimized measure reduction · Synthetic measure reduction | running time | No clear effect |
| Add Las Vegas resets to the randomized algorithm (ablation) | Fast least-squares solvers · Real-world datasets | running time | Improved |
| Add divide and conquer to the randomized algorithm (ablation) | Fast least-squares solvers · Real-world datasets | running-time variance | Improved |
| Use randomized reduction with deterministic fallback (ablation) | Fast least-squares solvers · Real-world datasets | running time | Improved |
| Use the randomized algorithm without a deterministic fallback on highly correlated features (ablation) | Fast least-squares solvers · Highly correlated dataset | running time | Hurt |
| Use randomized reduction in the regime N much larger than n | Measure reduction algorithm · Synthetic measure reduction | running time | Improved |
| Run the optimized randomized algorithm without a deterministic fallback | Measure reduction algorithm · General recombination settings | running time | Mixed |
Closest papers by meaning
- A Unified Approach for Computing Wasserstein Barycenters of Discrete and Continuous Measures (NeurIPS 2026 · similarity 0.85)
- Wasserstein barycenters can be computed in polynomial time in fixed dimension (JMLR 2021 · similarity 0.84)
- Dimensionality Reduction for Wasserstein Barycenter (NeurIPS 2021 · similarity 0.84)
- Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma (NeurIPS 2024 · similarity 0.82)
- Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures (ICML 2025 · similarity 0.82)
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem (NeurIPS 2024 · similarity 0.81)
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.
