Coefficient-based regularization network with variance loss for error
From MaRDI portal
Publication:5150110
Recommendations
- Learning with coefficient-based regularization and ^1-penalty
- Variance-based regularization with convex objectives
- Regularization networks with indefinite kernels
- Regression Neural Networks with a Highly Robust Loss Function
- Regularization networks and support vector machines
- Improved spectral norm regularization for neural networks
- STRETCHING THE NET: MULTIDIMENSIONAL REGULARIZATION
- Iterative regularization for learning with convex loss functions
Cites work
- Algorithms for learning kernels based on centered alignment
- Approximation analysis of learning algorithms for support vector regression and quantile regression
- Asymptotic analysis of quantile regression learning based on coefficient dependent regularization
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Convergence rate of SVM for kernel-based robust regression
- Estimating conditional quantiles with the help of the pinball loss
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Kernel-based conditional canonical correlation analysis via modified Tikhonov regularization
- Learning rates of least-square regularized regression
- Learning Theory
- Learning theory estimates for coefficient-based regularized regression
- Learning theory estimates via integral operators and their approximations
- Learning theory of distributed spectral algorithms
- Least square regression with indefinite kernels and coefficient regularization
- Regularization networks and support vector machines
- Some properties of regularized kernel methods
- Support vector machine soft margin classifiers: error analysis
- The consistency of multicategory support vector machines
- The convergence rate of a regularized ranking algorithm
- The covering number in learning theory
Cited in
(4)- The kernel regularized learning algorithm for solving Laplace equation with Dirichlet boundary
- Error analysis of kernel regularized pairwise learning with a strongly convex loss
- Learning performance of uncentered kernel-based principal component analysis
- Reproducing property of bounded linear operators and kernel regularized least square regressions
This page was built for publication: Coefficient-based regularization network with variance loss for error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150110)
