Approximation Bounds for Some Sparse Kernel Regression Algorithms
From MaRDI portal
Publication:4815048
DOI10.1162/089976602760805395zbMath1079.62545OpenAlexW2147331470WikidataQ78678617 ScholiaQ78678617MaRDI QIDQ4815048
Publication date: 19 August 2004
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/089976602760805395
Nonparametric regression and quantile regression (62G08) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10)
Related Items (3)
On the convergence rate of kernel-based sequential greedy regression ⋮ Convergence rate of the semi-supervised greedy algorithm ⋮ Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data
Cites Work
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Tensor product space ANOVA models.
- Sparse On-Line Gaussian Processes
- Atomic Decomposition by Basis Pursuit
- Universal approximation bounds for superpositions of a sigmoidal function
- Smoothing Spline ANOVA for Multivariate Bernoulli Observations With Application to Ophthalmology Data
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
This page was built for publication: Approximation Bounds for Some Sparse Kernel Regression Algorithms
