Regularized kernel networks with convex p-Lipschitz loss
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7415114 (Why is no real title available?)
- 10.1162/153244302760200704
- A note on application of integral operator in learning theory
- Asymptotic analysis of quantile regression learning based on coefficient dependent regularization
- Conditional quantiles with varying Gaussians
- Error analysis of classification learning algorithms based on LUMs loss
- Estimating conditional quantiles with the help of the pinball loss
- Fast rates for support vector machines using Gaussian kernels
- Implicit regularization with strongly convex bias: Stability and acceleration
- Learning Theory
- Learning rates of least-square regularized regression
- Learning rates of regularized regression for exponentially strongly mixing sequence
- Learning theory estimates via integral operators and their approximations
- Least square regression with indefinite kernels and coefficient regularization
- Leave-One-Out Bounds for Kernel Methods
- Minimum complexity regression estimation with weakly dependent observations
- ONLINE LEARNING WITH MARKOV SAMPLING
- Regularization networks and support vector machines
- Regularization networks with indefinite kernels
- Regularized least square regression with dependent samples
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- Sparse additive machine with ramp loss
- The generalization performance of ERM algorithm with strongly mixing observations
- Theory of Reproducing Kernels
Cited in
(3)
This page was built for publication: Regularized kernel networks with convex p-Lipschitz loss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026993)
