A tree-based regressor that adapts to intrinsic dimension

DOI10.1016/J.JCSS.2012.01.002MaRDI QIDQ439996zbMATH OpenOpenAlexFDO

Authors 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

nonparametric regressionmanifoldssparse datanotions of dimension

Mathematics Subject Classification ID

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

Recommendations

• On deep learning as a remedy for the curse of dimensionality in nonparametric regression
• Bayesian regression tree ensembles that adapt to smoothness and sparsity
• Curse of dimensionality and related issues in nonparametric functional regression
• Randomly-oriented \(k\)-\(d\) trees adapt to intrinsic dimension
• Estimation of a projection-pursuit type regression model

Cites work

• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• scientific article; zbMATH DE number 5485566 (Why is no real title available?)
• A distribution-free theory of nonparametric regression
• Extensions of Lipschitz mappings into a Hilbert space
• Finding the homology of submanifolds with high confidence from random samples
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Minimax-optimal classification with dyadic decision trees
• Model Selection for CART Regression Trees
• Nearest-neighbor-preserving embeddings
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Optimal rates of convergence for nonparametric estimators
• Rates of convergence of nearest neighbor estimation under arbitrary sampling
• Risk bounds for random regression graphs

Cited in

(11)

• Regularization-based model tree for multi-output regression
• Bayesian manifold regression
• Adaptive metric dimensionality reduction
• Minimax-optimal nonparametric regression in high dimensions
• Interactive Tree-Structured Regression via Principal Hessian Directions
• scientific article; zbMATH DE number 7415094 (Why is no real title available?)
• Non-uniform packings
• Intrinsic dimension adaptive partitioning for kernel methods
• Adaptive learning rates for support vector machines working on data with low intrinsic dimension
• Representation of functions on big data: graphs and trees
• Multiscale regression on unknown manifolds

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439996)