Approximation Bounds for Some Sparse Kernel Regression Algorithms

DOI10.1162/089976602760805395MaRDI QIDQ4815048zbMATH OpenOpenAlexWikidataFDO

Authors Tong Zhang

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

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10)

Recommendations

• Sparse spectrum Gaussian process regression
• Convergence of sparse variational inference in Gaussian processes regression
• Efficient Gaussian process regression for large datasets
• Sparse on-line Gaussian processes
• A unifying view of sparse approximate Gaussian process regression

Cites work

• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Atomic Decomposition by Basis Pursuit
• Matching pursuits with time-frequency dictionaries
• Smoothing Spline ANOVA for Multivariate Bernoulli Observations With Application to Ophthalmology Data
• Sparse Approximate Solutions to Linear Systems
• Sparse on-line Gaussian processes
• Tensor product space ANOVA models.
• Universal approximation bounds for superpositions of a sigmoidal function

Cited in

(11)

• A unifying view of sparse approximate Gaussian process regression
• Sparse Approximation of a Kernel Mean
• Sparse spectrum Gaussian process regression
• Regularization techniques and suboptimal solutions to optimization problems in learning from data
• scientific article; zbMATH DE number 7329270 (Why is no real title available?)
• Convergence rate of the semi-supervised greedy algorithm
• Greedy Kernel Approximation for Sparse Surrogate Modeling
• On the convergence rate of kernel-based sequential greedy regression
• Convergence of sparse variational inference in Gaussian processes regression
• Scalable bounding of predictive uncertainty in regression problems with SLAC
• Efficient Gaussian process regression for large datasets

This page was built for publication: Approximation Bounds for Some Sparse Kernel Regression Algorithms

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