Escaping the curse of dimensionality with a tree-based regressor

COLT 2009 - The 22nd Conference on Learning Theory

Volumn , Issue , 2009, Pages

  Kpotufe, Samory ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE RATES; CURSE OF DIMENSIONALITY; INTRINSIC DIMENSIONS; K-D TREE; TREE-BASED;

EID: 84898079484     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. P. Bickel and B. Li. Local polynomial regression on unknown manifolds. Tech. Re. Dep. of Stats. UC Berkley, 2006.
2. M. Belkin and N. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15: 1373-1396, 2003.
3. K. Clarkson. Nearest-neighbor searching and metric space dimensions. Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, 2005.
4. A. Caponnetto and S. Smale. Risk bounds for random regression graphs. Foundations of Computational Mathematics, 7: 495-528, 2007.
5. S. Dasgupta and Y. Freund. Random projection trees and low dimensional manifolds. STOC, 2008.
6. L. Devroye, L. Gyorfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, 1996.
7. A. B. Goldberg, M. Li, and X. Zhu. Online manifold regularization: a new learning setting and empirical study. ECML PKDD, 2008.
8. S. Gey and E. Nedelec. Model selection for CART regression trees. IEEE Transactions on Information Theory, 51, 2005.
9. P. Indyk and A. Naor. Nearest neighbor preserving embedding. ACM Transactions on Algorithms, 2007.
10. R. Krauthgamer and J. Lee. Navigating nets: Simple algorithms for proximity search. SODA, 2004.
11. J. Lafferty and L. Wasserman. Statistical analysis of semi-supervised regression. NIPS, 2007.
12. S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290: 2323-2326, 2000.
13. C. Scott and R.D. Nowak. Minimax-optimal classification with dyadic decision trees. IEEE Transactions on Information Theory, 52, 2006.
14. C. J. Stone. Optimal rates of convergence for non-parametric estimators. Ann. Statist., 8: 1348-1360, 1980.
15. C. J. Stone. Optimal global rates of convergence for non-parametric estimators. Ann. Statist., 10: 1340-1353, 1982.
16. J.B. TenenBaum, V. De Silva, and J. Langford. A global geometric framework for non-linear dimensionality reduction. Science, 290: 2319-2323, 2000.
17. V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their expectation. Theory of probability and its applications, 16: 264-280, 1971.