Escaping the curse of dimensionality with a tree-based regressor
classification
📊 stat.ML
keywords
regressordimensiontree-basedassouadconvergencecursedatadepends
read the original abstract
We present the first tree-based regressor whose convergence rate depends only on the intrinsic dimension of the data, namely its Assouad dimension. The regressor uses the RPtree partitioning procedure, a simple randomized variant of k-d trees.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.