Statistical analysis of the moving least-squares method with unbounded sampling

DOI10.1016/j.ins.2014.01.001zbMath1343.62020OpenAlexW2092396945MaRDI QIDQ726158

Fangchao He, Hong Chen, Luoqing Li

Publication date: 8 July 2016

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.01.001

zbMATH Keywords

learning theoryconcentration inequalitysample errormoving least-squares methodunbounded sampling

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Asymptotic properties of nonparametric inference (62G20)

Related Items

Error analysis of the moving least-squares method with non-identical sampling ⋮ Convergence rate for the moving least-squares learning with dependent sampling ⋮ Error analysis for \(l^q\)-coefficient regularized moving least-square regression ⋮ Support vector machines regression with unbounded sampling ⋮ Optimal convergence rates of high order Parzen windows with unbounded sampling ⋮ Analysis of Regression Algorithms with Unbounded Sampling ⋮ Error analysis of the moving least-squares regression learning algorithm with β-mixing and non-identical sampling

Uses Software

• KernSmooth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
• Optimal learning rates for least squares regularized regression with unbounded sampling
• Robust linear least squares regression
• Toward approximate moving least squares approximation with irregularly spaced centers
• Concentration estimates for the moving least-square method in learning theory
• Multi-kernel regularized classifiers
• Hermite type moving-least-squares approximations
• Moving least-square method in learning theory
• Learning rates of multi-kernel regularized regression
• Elastic-net regularization in learning theory
• Stable moving least-squares
• High order Parzen windows and randomized sampling
• The covering number in learning theory
• Concentration estimates for learning with unbounded sampling
• Optimal rates for the regularized least-squares algorithm
• Learning rates of least-square regularized regression
• Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization
• Local polynomial reproduction and moving least squares approximation
• Learning Theory
• Capacity of reproducing kernel spaces in learning theory