A tree-based regressor that adapts to intrinsic dimension

DOI10.1016/j.jcss.2012.01.002zbMath1435.62143OpenAlexW2171463570MaRDI 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

manifoldsnonparametric regressionsparse datanotions of dimension

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (9)

Bayesian manifold regression ⋮ Multiscale regression on unknown manifolds ⋮ Intrinsic Dimension Adaptive Partitioning for Kernel Methods ⋮ Adaptive metric dimensionality reduction ⋮ Non-uniform packings ⋮ Adaptive learning rates for support vector machines working on data with low intrinsic dimension ⋮ Unnamed Item ⋮ 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

This page was built for publication: A tree-based regressor that adapts to intrinsic dimension