A tree-based regressor that adapts to intrinsic dimension
From MaRDI portal
Publication:439996
DOI10.1016/J.JCSS.2012.01.002zbMATH Open1435.62143OpenAlexW2171463570MaRDI QIDQ439996FDOQ439996
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
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
Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Finding the homology of submanifolds with high confidence from random samples
- Optimal rates of convergence for nonparametric estimators
- Extensions of Lipschitz mappings into a Hilbert space
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Title not available (Why is that?)
- A distribution-free theory of nonparametric regression
- Model Selection for CART Regression Trees
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Rates of convergence of nearest neighbor estimation under arbitrary sampling
- Minimax-optimal classification with dyadic decision trees
- Title not available (Why is that?)
- Nearest-neighbor-preserving embeddings
- Risk bounds for random regression graphs
Cited In (11)
- Regularization-based model tree for multi-output regression
- Adaptive metric dimensionality reduction
- Bayesian manifold regression
- Minimax-optimal nonparametric regression in high dimensions
- Interactive Tree-Structured Regression via Principal Hessian Directions
- Title not available (Why is that?)
- 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)
