Convergence rate of SVM for kernel-based robust regression
From MaRDI portal
Recommendations
- Learning rates of kernel-based robust classification
- Robust support vector regression in the primal
- Robust support vector regression with generic quadratic nonconvex \(\varepsilon\)-insensitive loss
- Training robust support vector regression with smooth non-convex loss function
- Homotopy continuation approaches for robust SV classification and regression
Cites work
- A new comparison theorem on conditional quantiles
- Aspects of robust linear regression
- Asymptotic analysis of quantile regression learning based on coefficient dependent regularization
- Conditional quantiles with varying Gaussians
- Consistency of kernel-based quantile regression
- Convergence rate of semi-supervised gradient learning algorithms
- Convergence rate of the semi-supervised greedy algorithm
- Estimating conditional quantiles with the help of the pinball loss
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Generalization errors of Laplacian regularized least squares regression
- Generalized convexity and optimization. Theory and applications
- Half supervised coefficient regularization for regression learning with unbounded sampling
- Homotopy continuation approaches for robust SV classification and regression
- scientific article; zbMATH DE number 3954047 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Integral operator approach to learning theory with unbounded sampling
- Kernel methods for independence measurement with coefficient constraints
- Learning rate of magnitude-preserving regularization ranking with dependent samples
- Learning sets with separating kernels
- Multi-kernel regularized classifiers
- On the mathematical foundations of learning
- Optimal learning rates for least squares regularized regression with unbounded sampling
- Regularized least square regression with unbounded and dependent sampling
- Robust Statistics
- Robust Truncated Hinge Loss Support Vector Machines
- Semi-supervised learning based on high density region estimation
- Support vector machine soft margin classifiers: error analysis
- Support Vector Machines
- The consistency of least-square regularized regression with negative association sequence
- The convergence rate of semi-supervised regression with quadratic loss
- The learning rates of regularized regression based on reproducing kernel Banach spaces
- The performance of semi-supervised Laplacian regularized regression with the least square loss
- The Remedian: A Robust Averaging Method for Large Data Sets
- Theory of Reproducing Kernels
- Universal kernels
Cited in
(9)- Homotopy continuation approaches for robust SV classification and regression
- Robust support vector regression in the primal
- Learning rates of kernel-based robust classification
- Learning rates for the kernel regularized regression with a differentiable strongly convex loss
- Convergence of online pairwise regression learning with quadratic loss
- Gradient descent for robust kernel-based regression
- On the K-functional in learning theory
- Coefficient-based regularization network with variance loss for error
- Convex analysis method for distributed learning algorithm
This page was built for publication: Convergence rate of SVM for kernel-based robust regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626547)
