Least-square regularized regression with non-iid sampling
From MaRDI portal
Publication:2272113
DOI10.1016/j.jspi.2009.04.007zbMath1176.68163OpenAlexW2042138716MaRDI QIDQ2272113
Publication date: 5 August 2009
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2009.04.007
reproducing kernel Hilbert spacestrong mixing conditionleast-square regularized regressionsampling with non-identical distributions
General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Error analysis of the moving least-squares method with non-identical sampling, Coefficient regularized regression with non-iid sampling, Convergence rate for the moving least-squares learning with dependent sampling, Error analysis for \(l^q\)-coefficient regularized moving least-square regression, Regression learning with non-identically and non-independently sampling, Concentration estimates for learning with unbounded sampling, Fast learning from \(\alpha\)-mixing observations, Classification with non-i.i.d. sampling, Learning performance of regularized regression with multiscale kernels based on Markov observations, Error analysis of the moving least-squares regression learning algorithm with β-mixing and non-identical sampling
Cites Work
- Unnamed Item
- Model selection for regularized least-squares algorithm in learning theory
- Regularized least square regression with dependent samples
- Learning from dependent observations
- A note on application of integral operator in learning theory
- High order Parzen windows and randomized sampling
- Almost sure invariance principles for weakly dependent vector-valued random variables
- The covering number in learning theory
- Optimal rates for the regularized least-squares algorithm
- Learning rates of regularized regression for exponentially strongly mixing sequence
- Learning rates of least-square regularized regression
- Shannon sampling. II: Connections to learning theory
- Learning theory estimates via integral operators and their approximations
- Capacity of reproducing kernel spaces in learning theory
- ONLINE LEARNING WITH MARKOV SAMPLING
- Minimum complexity regression estimation with weakly dependent observations
- 10.1162/153244302760200704
- Shannon sampling and function reconstruction from point values
- Leave-One-Out Bounds for Kernel Methods
- The Invariance Principle for Stationary Processes