Learning with convex loss and indefinite kernels
From MaRDI portal
Recommendations
- Regularization networks with indefinite kernels
- Learning rates for the kernel regularized regression with a differentiable strongly convex loss
- Least square regression with indefinite kernels and coefficient regularization
- Coefficient-based regularized regression with indefinite kernels by unbounded sampling
- Coefficient-based \(l^q\)-regularized regression with indefinite kernels and unbounded sampling
Cites work
- 10.1162/1532443041424319
- A Bennett concentration inequality and its application to suprema of empirical processes
- An approximation theory approach to learning with \(\ell^1\) regularization
- Analysis of support vector machines regression
- Approximation with polynomial kernels and SVM classifiers
- Classification with Gaussians and convex loss
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Concentration estimates for learning with unbounded sampling
- Consistency and robustness of kernel-based regression in convex risk minimization
- Fast rates for support vector machines using Gaussian kernels
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1950576 (Why is no real title available?)
- Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
- Learning rates of least-square regularized regression
- Learning theory estimates via integral operators and their approximations
- Learning with sample dependent hypothesis spaces
- Learning with varying insensitive loss
- Least square regression with indefinite kernels and coefficient regularization
- Local polynomial reproduction and moving least squares approximation
- Local Rademacher complexities
- Model selection for regularized least-squares algorithm in learning theory
- Multi-kernel regularized classifiers
- Multiscale kernels
- On the mathematical foundations of learning
- Optimal rates for the regularized least-squares algorithm
- Refinable kernels
- Regularization in kernel learning
- Regularization networks and support vector machines
- Robust Statistics
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
- Theory of Reproducing Kernels
- Weak convergence and empirical processes. With applications to statistics
Cited in
(14)- Support vector machine classification with indefinite kernels
- Indefinite kernel network with l^q-norm regularization
- Learned-loss boosting
- Regularization networks with indefinite kernels
- Analysis of regularized least-squares in reproducing kernel Kreĭn spaces
- Moving quantile regression
- Learning performance of regularized moving least square regression
- Indefinite kernel network with dependent sampling
- Classification with Gaussians and convex loss
- Correction to "The Importance of Convexity in Learning With Squared Loss" [Sep 98 1974-1980]
- The importance of convexity in learning with squared loss
- scientific article; zbMATH DE number 7255066 (Why is no real title available?)
- Supervised learning with indefinite topological Kernels
- scientific article; zbMATH DE number 7306907 (Why is no real title available?)
This page was built for publication: Learning with convex loss and indefinite kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378314)
