A tree-based regressor that adapts to intrinsic dimension

DOI10.1016/j.jcss.2012.01.002zbMath1435.62143MaRDI QIDQ439996

Samory Kpotufe, Sanjoy Dasgupta

Publication date: 17 August 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2012.01.002

zbMATH Keywords

manifolds; nonparametric regression; sparse data; notions of dimension

Mathematics Subject Classification ID

62G08: Nonparametric regression and quantile regression

68T05: Learning and adaptive systems in artificial intelligence

Related Items

Unnamed Item, Intrinsic Dimension Adaptive Partitioning for Kernel Methods, Adaptive metric dimensionality reduction, Bayesian manifold regression, Non-uniform packings, Adaptive learning rates for support vector machines working on data with low intrinsic dimension, Multiscale regression on unknown manifolds, Representation of functions on big data: graphs and trees, Minimax-optimal nonparametric regression in high dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Risk bounds for random regression graphs
• Optimal rates of convergence for nonparametric estimators
• A distribution-free theory of nonparametric regression
• Finding the homology of submanifolds with high confidence from random samples
• Extensions of Lipschitz mappings into a Hilbert space
• Model Selection for CART Regression Trees
• Minimax-optimal classification with dyadic decision trees
• Nearest-neighbor-preserving embeddings
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Rates of convergence of nearest neighbor estimation under arbitrary sampling
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities