mlsanityData to 7 Oct 2026

ControlBurn: Feature Selection by Sparse Forests

arXiv 2107.00219 ↗First posted 1 Jul 2021cs.LG stat.MEcited by 9

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

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  2. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  3. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  4. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
  5. 2019InterpretML: A Unified Framework for Machine Learning Interpretabilitycited by 243
  6. 2017PMLB: A Large Benchmark Suite for Machine Learning Evaluation and Comparisoncited by 139
  7. 2015Best Subset Selection via a Modern Optimization Lenscited by 99
  8. 2021S-LIME: Stabilized-LIME for Model Explanationcited by 52
  9. 2019Unbiased Measurement of Feature Importance in Tree-Based Methodscited by 30
  10. 2014Randomized Sketches of Convex Programs with Sharp Guaranteescited by 25
  11. 2020Trees, forests, and impurity-based variable importancecited by 16
  12. 2018Adaptive group-regularized logistic elastic net regressioncited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 2; 2024: 2; 2025: 1; 2026: 1.

9 papers.