paper-with-me

Papers

Nonparametric Variable Screening with Optimal Decision Stumps

2020-11-05 · Jason M. Klusowski, Peter M. Tian

Decision trees and their ensembles are endowed with a rich set of diagnostic tools for ranking and screening variables in a predictive model. Despite the widespread use of tree based variable importance measures, pinning down their theoretical properties has been challenging and therefore largely unexplored. To address this gap between theory and practice, we derive finite sample performance guarantees for variable selection in nonparametric models using a single-level CART decision tree (a decision stump). Under standard operating assumptions in variable screening literature, we find that the marginal signal strength of each variable and ambient dimensionality can be considerably weaker and higher, respectively, than state-of-the-art nonparametric variable selection methods. Furthermore, unlike previous marginal screening methods that attempt to directly estimate each marginal projection via a truncated basis expansion, the fitted model used here is a simple, parsimonious decision stump, thereby eliminating the need for tuning the number of basis terms. Thus, surprisingly, even though decision stumps are highly inaccurate for estimation purposes, they can still be used to perform consistent model selection.

📄 PDF Abstract BibTeX arXiv:2011.02683

Code (0)

등록된 구현이 없습니다.

Tasks

DiagnosticModel SelectionVariable Selection

Similar Papers 제목 키워드 기반

Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

2019-06-08 · NeurIPS 2019 12 · Maksym Andriushchenko, Matthias Hein

The problem of adversarial robustness has been studied extensively for neural networks. However, for boosted decision trees and decision stumps there are almost no results, even though they are widely used in practice (e…

Adversarial Robustness

Random Forest for the Contextual Bandit Problem - extended version

2015-04-27 · Raphaël Féraud, Robin Allesiardo, Tanguy Urvoy, Fabrice Clérot

To address the contextual bandit problem, we propose an online random forest algorithm. The analysis of the proposed algorithm is based on the sample complexity needed to find the optimal decision stump. Then, the decisi…

Some Open Problems in Optimal AdaBoost and Decision Stumps

2015-05-26 · Joshua Belanich, Luis E. Ortiz

The significance of the study of the theoretical and practical properties of AdaBoost is unquestionable, given its simplicity, wide practical use, and effectiveness on real-world datasets. Here we present a few open prob…

Binary Classification

On $\ell_p$-norm Robustness of Ensemble Stumps and Trees

2020-08-20 · Yihan Wang, huan zhang, Hongge Chen, Duane Boning 외

Recent papers have demonstrated that ensemble stumps and trees could be vulnerable to small input perturbations, so robustness verification and defense for those models have become an important research problem. However,…

DeforestVis: Behavior Analysis of Machine Learning Models with Surrogate Decision Stumps

2023-03-31 · Angelos Chatzimparmpas, Rafael M. Martins, Alexandru C. Telea, Andreas Kerren

As the complexity of machine learning (ML) models increases and their application in different (and critical) domains grows, there is a strong demand for more interpretable and trustworthy ML. A direct, model-agnostic, w…

AttributeDecision Making