ControlBurn: Feature Selection by Sparse Forests
Not on the map. Why?
Abstract (arXiv)
Tree ensembles distribute feature importance evenly amongst groups of correlated features. The average feature ranking of the correlated group is suppressed, which reduces interpretability and complicates feature selection. In this paper we present ControlBurn, a feature selection algorithm that uses a weighted LASSO-based feature selection method to prune unnecessary features from tree ensembles, just as low-intensity fire reduces overgrown vegetation. Like the linear LASSO, ControlBurn assigns all the feature importance of a correlated group of features to a single feature. Moreover, the algorithm is efficient and only requires a single training iteration to run, unlike iterative wrapper-based feature selection methods. We show that ControlBurn performs substantially better than feature selection methods with comparable computational costs on datasets with correlated features.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 12 of its 35 references that are in the map. First posted on arXiv 1 Jul 2021.
Builds on
12 of 35 references.
References · 12
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
- 2019InterpretML: A Unified Framework for Machine Learning Interpretabilitycited by 243
- 2017PMLB: A Large Benchmark Suite for Machine Learning Evaluation and Comparisoncited by 139
- 2015Best Subset Selection via a Modern Optimization Lenscited by 99
- 2021S-LIME: Stabilized-LIME for Model Explanationcited by 52
- 2019Unbiased Measurement of Feature Importance in Tree-Based Methodscited by 30
- 2014Randomized Sketches of Convex Programs with Sharp Guaranteescited by 25
- 2020Trees, forests, and impurity-based variable importancecited by 16
- 2018Adaptive group-regularized logistic elastic net regressioncited by 4
Built on by
Citing papers per year: 2022: 3; 2023: 2; 2024: 2; 2025: 1; 2026: 1.
9 papers.
- 2022Data-Efficient and Interpretable Tabular Anomaly Detectioncited by 15
- 2023Interpretable Survival Analysis for Heart Failure Risk Predictioncited by 6
- 2022Adaptive Multi-view Rule Discovery for Weakly-Supervised Compatible Products Predictioncited by 4
- 2025SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learningcited by 4
- 2024Interpretable Prediction and Feature Selection for Survival Analysiscited by 2
- 2022ControlBurn: Nonlinear Feature Selection with Sparse Tree Ensemblescited by 1
- 2026FeatEHR-LLM: Leveraging Large Language Models for Feature Engineering in Electronic Health Recordscited by 1
- 2023End-to-end Feature Selection Approach for Learning Skinny Treescited by 0
- 2024FAST: An Optimization Framework for Fast Additive Segmentation in Transparent MLcited by 0
- 2026FeatEHR-LLM: Leveraging Large Language Models for Feature Engineering in Electronic Health Records24 Apr 2026
- 2025SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning27 Jan 2025
- 2024Interpretable Prediction and Feature Selection for Survival Analysis23 Apr 2024
- 2024FAST: An Optimization Framework for Fast Additive Segmentation in Transparent ML20 Feb 2024
- 2023End-to-end Feature Selection Approach for Learning Skinny Trees28 Oct 2023
- 2023Interpretable Survival Analysis for Heart Failure Risk Prediction24 Oct 2023
- 2022ControlBurn: Nonlinear Feature Selection with Sparse Tree Ensembles8 Jul 2022
- 2022Adaptive Multi-view Rule Discovery for Weakly-Supervised Compatible Products Prediction28 Jun 2022
- 2022Data-Efficient and Interpretable Tabular Anomaly Detection3 Mar 2022