Regularized least square regression with unbounded and dependent sampling
From MaRDI portal
Publication:369717
DOI10.1155/2013/139318zbMath1273.62208WikidataQ58915348 ScholiaQ58915348MaRDI QIDQ369717
Publication date: 19 September 2013
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/139318
62M10: Time series, auto-correlation, regression, etc. in statistics (GARCH)
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Convergence rate of SVM for kernel-based robust regression, Online regularized pairwise learning with non-i.i.d. observations, Support vector machines regression with unbounded sampling, Convergence rate for the moving least-squares learning with dependent sampling, Fast learning from \(\alpha\)-mixing observations, Coefficient-based regularized regression with dependent and unbounded sampling, Analysis of Regression Algorithms with Unbounded Sampling
Cites Work
- Unnamed Item
- Integral operator approach to learning theory with unbounded sampling
- Optimal learning rates for least squares regularized regression with unbounded sampling
- Least square regression with indefinite kernels and coefficient regularization
- Regularized least square regression with dependent samples
- On regularization algorithms in learning theory
- A note on application of integral operator in learning theory
- ERM learning with unbounded sampling
- Concentration estimates for learning with unbounded sampling
- Regularization networks and support vector machines
- Optimal rates for the regularized least-squares algorithm
- Application of integral operator for regularized least-square regression
- Learning rates of least-square regularized regression
- Shannon sampling. II: Connections to learning theory
- Learning theory estimates via integral operators and their approximations
- Half supervised coefficient regularization for regression learning with unbounded sampling
- Spectral Algorithms for Supervised Learning
- ONLINE LEARNING WITH MARKOV SAMPLING
- Mixing properties of harris chains and autoregressive processes
- Minimum complexity regression estimation with weakly dependent observations
- Shannon sampling and function reconstruction from point values
