Ranking Perspective for Tree-based Methods with Applications to Symbolic Feature Selection
<|reference_start|>Ranking Perspective for Tree-based Methods with Applications to Symbolic Feature Selection: Tree-based methods are powerful nonparametric techniques in statistics and machine learning. However, their effectiveness, particularly in finite-sample settings, is not fully understood. Recent applications have revealed their surprising ability to distinguish transformations (which we call symbolic feature selection) that remain obscure under current theoretical understanding. This work provides a finite-sample analysis of tree-based methods from a ranking perspective. We link oracle partitions in tree methods to response rankings at local splits, offering new insights into their finite-sample behavior in regression and feature selection tasks. Building on this local ranking perspective, we extend our analysis in two ways: (i) We examine the global ranking performance of individual trees and ensembles, including Classification and Regression Trees (CART) and Bayesian Additive Regression Trees (BART), providing finite-sample oracle bounds, ranking consistency, and posterior contraction results. (ii) Inspired by the ranking perspective, we propose concordant divergence statistics $\mathcal{T}_0$ to evaluate symbolic feature mappings and establish their properties. Numerical experiments demonstrate the competitive performance of these statistics in symbolic feature selection tasks compared to existing methods.<|reference_end|>
@article{luo2024ranking,
    title={Ranking Perspective for Tree-based Methods with Applications to Symbolic
  Feature Selection},
    author={Hengrui Luo and Meng Li},
    journal={arXiv preprint arXiv:2410.02623},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.02623},
    primaryClass={math.ST cs.NA math.NA stat.ML stat.TH}
}