Convergence rate for the moving least-squares learning with dependent sampling
From MaRDI portal
Publication:824709
DOI10.1186/s13660-018-1794-8zbMath1498.68239OpenAlexW2885891144WikidataQ92159534 ScholiaQ92159534MaRDI QIDQ824709
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1794-8
Nonparametric regression and quantile regression (62G08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inequalities; stochastic orderings (60E15) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Unnamed Item
- Unnamed Item
- Regularized least square regression with unbounded and dependent sampling
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
- Semi-supervised learning with the help of Parzen windows
- Classification with non-i.i.d. sampling
- Toward approximate moving least squares approximation with irregularly spaced centers
- Concentration estimates for the moving least-square method in learning theory
- Statistical analysis of the moving least-squares method with unbounded sampling
- Regularized least square regression with dependent samples
- Hermite type moving-least-squares approximations
- Learning from dependent observations
- Moving least-square method in learning theory
- Least-square regularized regression with non-iid sampling
- Learning performance of regularized moving least square regression
- Learning rates of least-square regularized regression
- Coefficient-based regularized regression with dependent and unbounded sampling
- Half supervised coefficient regularization for regression learning with unbounded sampling
- Coefficient regularized regression with non-iid sampling
- Learning Theory
- ONLINE LEARNING WITH MARKOV SAMPLING
- Minimum complexity regression estimation with weakly dependent observations
