Escaping the curse of dimensionality with a tree-based regressor

Samory Kpotufe

Escaping the curse of dimensionality with a tree-based regressor

Samory Kpotufe

Operations Research & Financial Engineering

Research output: Contribution to conference › Paper › peer-review

12 Scopus citations

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.

Original language	English (US)
State	Published - 2009
Event	22nd Conference on Learning Theory, COLT 2009 - Montreal, QC, Canada Duration: Jun 18 2009 → Jun 21 2009

Other

Other	22nd Conference on Learning Theory, COLT 2009
Country/Territory	Canada
City	Montreal, QC
Period	6/18/09 → 6/21/09

All Science Journal Classification (ASJC) codes

Education

Cite this

@conference{43e2caa4a77e4ee49bb03e5eec224e27,

title = "Escaping the curse of dimensionality with a tree-based regressor",

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.",

author = "Samory Kpotufe",

year = "2009",

language = "English (US)",

note = "22nd Conference on Learning Theory, COLT 2009 ; Conference date: 18-06-2009 Through 21-06-2009",

}

TY - CONF

T1 - Escaping the curse of dimensionality with a tree-based regressor

AU - Kpotufe, Samory

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84898079484

UR - https://www.scopus.com/pages/publications/84898079484#tab=citedBy

M3 - Paper

AN - SCOPUS:84898079484

T2 - 22nd Conference on Learning Theory, COLT 2009

Y2 - 18 June 2009 through 21 June 2009

ER -

Escaping the curse of dimensionality with a tree-based regressor

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this