Skip to content
conftrace_

decision stump

8 papers

Explore in graph

Co-occurring keywords · papers mentioning both

ensemble learning (3) regularized boosting (1) tsybakov noise condition (1) model adaptivity (1) finite sample bound (1) convex problem (1) kernel methods (1) feature pruning (1) boosted decision tree (1) variable screening (1)

Papers

Actively Learning Halfspaces without Synthetic Data COLT 2026 Generalized additive models via direct optimization of regularized decision stump forests ICML 2025 Optimal Sparse Recovery with Decision Stumps AAAI 2023 Nonparametric Variable Screening with Optimal Decision Stumps AISTATS 2021 Explaining the Success of AdaBoost and Random Forests as Interpolating Classifiers JMLR 2017 Quickly Boosting Decision Trees – Pruning Underachieving Features Early ICML 2013 Support Vector Machinery for Infinite Ensemble Learning JMLR 2008 On the Rate of Convergence of Regularized Boosting Classifiers JMLR 2003