Constructive analysis for coefficient regularization regression algorithms
From MaRDI portal
Publication:491841
DOI10.1016/j.jmaa.2015.06.006zbMath1326.62148OpenAlexW573944826MaRDI QIDQ491841
Publication date: 19 August 2015
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2015.06.006
least squares regressioncoefficient regularizationconstructive stepping-stone functionerror decomposition
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Error analysis for \(l^q\)-coefficient regularized moving least-square regression ⋮ Coefficient-based \(l^q\)-regularized regression with indefinite kernels and unbounded sampling
Cites Work
- Unnamed Item
- Unnamed Item
- Sharp learning rates of coefficient-based \(l^q\)-regularized regression with indefinite kernels
- Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Optimal learning rates for least squares regularized regression with unbounded sampling
- Least square regression with indefinite kernels and coefficient regularization
- Unified approach to coefficient-based regularized regression
- Multi-kernel regularized classifiers
- Constructive analysis for least squares regression with generalized \(K\)-norm regularization
- The covering number in learning theory
- Learning theory estimates for coefficient-based regularized regression
- Concentration estimates for learning with unbounded sampling
- Learning with sample dependent hypothesis spaces
- Learning rates of least-square regularized regression
- Learning theory estimates via integral operators and their approximations
- On the mathematical foundations of learning
- INDEFINITE KERNEL NETWORK WITH DEPENDENT SAMPLING
- CONVERGENCE ANALYSIS OF COEFFICIENT-BASED REGULARIZATION UNDER MOMENT INCREMENTAL CONDITION
- Least-squares regularized regression with dependent samples andq-penalty
- Capacity of reproducing kernel spaces in learning theory
- ONLINE LEARNING WITH MARKOV SAMPLING
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- Regularization schemes for minimum error entropy principle
This page was built for publication: Constructive analysis for coefficient regularization regression algorithms
