Error Estimates for Multivariate Regression on Discretized Function Spaces
From MaRDI portal
Publication:4976112
DOI10.1137/15M1013973zbMath1403.62058MaRDI QIDQ4976112
Publication date: 27 July 2017
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
convergence rateslearning theorysparse gridsregressionbias-variance problemdiscretized function spaces
Nonparametric regression and quantile regression (62G08) Estimation in multivariate analysis (62H12) Learning and adaptive systems in artificial intelligence (68T05) Multidimensional problems (41A63) Rate of convergence, degree of approximation (41A25)
Related Items (4)
Fast hyperbolic wavelet regression meets ANOVA ⋮ Worst-case recovery guarantees for least squares approximation using random samples ⋮ A representer theorem for deep kernel learning ⋮ Variational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the stability and accuracy of least squares approximations
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Spatially adaptive sparse grids for high-dimensional data-driven problems
- The entropy in learning theory. Error estimates
- Fitting multidimensional data using gradient penalties and the sparse grid combination technique
- Inequalities for uniform deviations of averages from expectations with applications to nonparametric regression
- Sparse grids for boundary integral equations
- A distribution-free theory of nonparametric regression
- Tensor product type subspace splittings and multilevel iterative methods for anisotropic problems
- Learning with sample dependent hypothesis spaces
- Approximation in learning theory
- Universal algorithms for learning theory. II: Piecewise polynomial functions
- On the mathematical foundations of learning
- Optimization with Sparsity-Inducing Penalties
- A Finite Element Method for Density Estimation with Gaussian Process Priors
- Data mining techniques
- Learning Theory
- An Optimal Order Regularization Method which Does Not Use Additional Smoothness Assumptions
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Maximum a posteriori density estimation and the sparse grid combination technique
- Principal Curves
- On the construction of sparse tensor product spaces
- Multiscale Approximation and Reproducing Kernel Hilbert Space Methods
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
- Sparse grids
- Nonlinear Dimensionality Reduction
- On Learning Vector-Valued Functions
This page was built for publication: Error Estimates for Multivariate Regression on Discretized Function Spaces
