ControlBurn: Feature Selection by Sparse Forests
Brian Liu, Miaolan Xie, Madeleine Udell
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- Data-Efficient and Interpretable Tabular Anomaly DetectionChun-Hao Chang, Jinsung Yoon, Sercan Ö. Arik, Madeleine Udell 等KDD 2023 · 被引用 11 次
- Interpretable Prediction and Feature Selection for Survival AnalysisMike Van Ness, Madeleine UdellKDD 2025
- FAST: An Optimization Framework for Fast Additive Segmentation in Transparent MLBrian Liu, Rahul MazumderKDD 2024
它引用的顶会 Paper1
相关 Paper
- Fire: An Optimization Approach for Fast Interpretable Rule ExtractionBrian Liu, Rahul MazumderKDD 2023 · 被引用 7 次
- Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree EnsemblesYoussouf Emine, Alexandre Forel, Idriss Malek, Thibaut VidalAAAI 2025 · 被引用 3 次
- Born-Again Tree EnsemblesThibaut Vidal, Maximilian SchifferICML 2020 · 被引用 62 次
- Leveraging Model Inherent Variable Importance for Stable Online Feature SelectionJohannes Haug, Martin Pawelczyk, Klaus Broelemann, Gjergji KasneciKDD 2020 · 被引用 11 次
- Optimal Sparse Recovery with Decision StumpsKiarash Banihashem, Mohammad Hajiaghayi, Max SpringerAAAI 2023 · 被引用 2 次
