Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
learning theoryerror analysislarge deviationsapproximation theoryconvergence ratesdiscrete least squaresmultivariate polynomial approximationnoisy evaluations
Nonparametric regression and quantile regression (62G08) Multidimensional problems (41A63) Approximation by polynomials (41A10) Best approximation, Chebyshev systems (41A50) Rate of convergence, degree of approximation (41A25) Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70)
- Analysis of discrete L^2 projection on polynomial spaces with random evaluations
- Adaptive polynomial approximation by means of random discrete least squares
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Optimal weighted least-squares methods
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- scientific article; zbMATH DE number 1262778 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 1169068 (Why is no real title available?)
- scientific article; zbMATH DE number 2115052 (Why is no real title available?)
- A distribution-free theory of nonparametric regression
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Approximation in learning theory
- Approximation of quantities of interest in stochastic PDEs by the random discrete \(L^2\) projection on polynomial spaces
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Large deviations
- Learning Theory
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Multivariate discrete least-squares approximations with a new type of collocation grid
- On the mathematical foundations of learning
- On the stability and accuracy of least squares approximations
- Spectral Methods for Uncertainty Quantification
- Strong converse for identification via quantum channels
- Universal algorithms for learning theory. I: Piecewise constant functions.
- Universal algorithms for learning theory. II: Piecewise polynomial functions
- User-friendly tail bounds for sums of random matrices
- Adaptive approximation by optimal weighted least-squares methods
- Convergence rates for a class of estimators based on Stein's method
- Multivariate approximation in downward closed polynomial spaces
- Multilevel weighted least squares polynomial approximation
- Stability of discrete empirical interpolation and gappy proper orthogonal decomposition with randomized and deterministic sampling points
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Convergence of Binomial-Based Derivative Estimation for C 2 Noisy Discretized Curves
- Convergence bounds for empirical nonlinear least-squares
- Marshall lemma in discrete convex estimation
- Boosted optimal weighted least-squares
- Optimal weighted least-squares methods
This page was built for publication: Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893175)
