Research map / Learning theory and algorithms / Combinatorial and search optimization
An Efficient Pruning Algorithm for Robust Isotonic Regression
Cong Han Lim
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 |
|---|---|---|---|
| Increase grid granularity k from 2^7 to 2^16 | Pruning algorithm · Synthetic robust isotonic regression | objective error | Improved |
| Increase percentage of flipped/corrupted points (5% to 50%) | Pruning algorithm · Synthetic robust isotonic regression, k=2^16 | speedup over DP: stabilizes at about 9-10× | Hurt |
| Increase k | Pruning algorithm vs DP · Synthetic robust isotonic regression | points processed and wall-clock time | Improved |
Closest papers by meaning
- Efficient Algorithms for Non-convex Isotonic Regression through Submodular Optimization (NeurIPS 2018 · similarity 0.91)
- Hardness and Algorithms for Robust and Sparse Optimization (ICML 2022 · similarity 0.88)
- Robust Sparse Regression with Non-Isotropic Designs (NeurIPS 2024 · similarity 0.87)
- Sparse High-Dimensional Isotonic Regression (NeurIPS 2019 · similarity 0.87)
- Isotonic Modeling with Non-Differentiable Loss Functions with Application to Lasso Regularization (TPAMI 2016 · similarity 0.87)
- Private Isotonic Regression (NeurIPS 2022 · similarity 0.87)
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.
