Research map / Learning theory and algorithms / Prediction and decision losses
Sparse Learning with CART
Jason Klusowski
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 CART instead of k-NN as the ambient dimension increases while the number of relevant variables stays fixed | Regression with sparse additive signals · Synthetic sparse additive experiment | prediction error | Mixed |
| Use CART instead of k-NN when adding non-diagnostic input variables | Boston housing regression · Boston housing dataset with added noisy inputs | prediction error | Mixed |
Closest papers by meaning
- Piecewise Constant and Linear Regression Trees: An Optimal Dynamic Programming Approach (ICML 2024 · similarity 0.86)
- Symbolic Regression Enhanced Decision Trees for Classification Tasks (AAAI 2024 · similarity 0.86)
- Learning Small Decision Trees with Few Outliers: A Parameterized Perspective (AAAI 2024 · similarity 0.86)
- Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO* (ICML 2025 · similarity 0.85)
- Near-Optimal Decision Trees in a SPLIT Second (ICML 2025 · similarity 0.85)
- Regression Trees Know Calculus (NeurIPS 2025 · similarity 0.84)
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.
