SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
From MaRDI portal
Recommendations
- Linear programming support vector machines
- Learning rates for multi-kernel linear programming classifiers
- Support vector machine soft margin classifiers: error analysis
- Support vector machine classification via parameterless robust linear programming
- Analysis of support vector machine classification
Cites work
- 10.1162/153244302760200704
- 10.1162/153244302760200713
- A note on different covering numbers in learning theory.
- Are Loss Functions All the Same?
- Capacity of reproducing kernel spaces in learning theory
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Improving the sample complexity using global data
- Massive data discrimination via linear support vector machines
- On the mathematical foundations of learning
- Optimal aggregation of classifiers in statistical learning.
- Regularization networks and support vector machines
- Shannon sampling and function reconstruction from point values
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Support vector machines are universally consistent
- Support vector machines with different norms: Motivation, formulations and results
- The covering number in learning theory
- 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
Cited in
(68)- Learning rates for regularized classifiers using multivariate polynomial kernels
- A simpler approach to coefficient regularized support vector machines regression
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Logistic classification with varying gaussians
- scientific article; zbMATH DE number 1708099 (Why is no real title available?)
- Error analysis of multicategory support vector machine classifiers
- Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions
- Quantum-enhanced least-square support vector machine: simplified quantum algorithm and sparse solutions
- Regularized least square regression with spherical polynomial kernels
- Linear programming approaches for multicategory support vector machines
- Support vector machines regression with l^1-regularizer
- Learning errors of linear programming support vector regression
- Learning rates for classification with Gaussian kernels
- Kernelized elastic net regularization: generalization bounds, and sparse recovery
- Soft margin support vector classification as buffered probability minimization
- Analysis of support vector machines regression
- Online outcome weighted learning with general loss functions
- Least square regression with \(l^{p}\)-coefficient regularization
- Alternative second-order cone programming formulations for support vector classification
- Sparse additive machine with ramp loss
- Tikhonov regularization for Gaussian empirical gain maximization in RKHS is consistent
- Quantile regression with _1-regularization and Gaussian kernels
- Learning and approximation by Gaussians on Riemannian manifolds
- Least square regression with indefinite kernels and coefficient regularization
- The generalization performance of ERM algorithm with strongly mixing observations
- Half supervised coefficient regularization for regression learning with unbounded sampling
- Fractional Gegenbauer kernel functions: theory and application
- Regularized kernel networks with convex p-Lipschitz loss
- Multi-kernel regularized classifiers
- Generalization analysis of Fredholm kernel regularized classifiers
- Generalization bounds of regularization algorithms derived simultaneously through hypothesis space complexity, algorithmic stability and data quality
- Generalized subsampled Newton method for large-scale linear inequalities with Tikhonov regularization
- SVM LEARNING AND Lp APPROXIMATION BY GAUSSIANS ON RIEMANNIAN MANIFOLDS
- Error Analysis of Coefficient-Based Regularized Algorithm for Density-Level Detection
- Consistency and convergence rate for nearest subspace classifier
- Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping
- Distributed learning via filtered hyperinterpolation on manifolds
- Comparison theorems on large-margin learning
- Hard or soft classification? Large-margin unified machines
- Learning with convex loss and indefinite kernels
- Least square regression with coefficient regularization by gradient descent
- Optimal convergence rates of deep neural networks in a classification setting
- Deep neural networks for rotation-invariance approximation and learning
- An efficient primal dual prox method for non-smooth optimization
- A note on support vector machines with polynomial kernels
- Approximating and learning by Lipschitz kernel on the sphere
- Support vector machine classification via parameterless robust linear programming
- Learning rates of least-square regularized regression with polynomial kernels
- Multiplicative updates for large margin classifiers.
- Constructive analysis for coefficient regularization regression algorithms
- Kernel classification using a linear programming approach
- Learning with sample dependent hypothesis spaces
- A new comparison theorem on conditional quantiles
- Error analysis for coefficient-based regularized regression in additive models
- An oracle inequality for regularized risk minimizers with strongly mixing observations
- Quantitative convergence analysis of kernel based large-margin unified machines
- Learning rates for multi-kernel linear programming classifiers
- Support vector machines and distance minimization
- Learning Rates of lq Coefficient Regularization Learning with Gaussian Kernel
- Generalization and learning rate of multi-class support vector classification and regression
- Guaranteed Classification via Regularized Similarity Learning
- Convergence analysis of coefficient-based regularization under moment incremental condition
- Distributed filtered hyperinterpolation for noisy data on the sphere
- Classification with polynomial kernels and l^1-coefficient regularization
- Learning rates of multi-kernel regularized regression
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
- Approximation by multivariate Bernstein-Durrmeyer operators and learning rates of least-squares regularized regression with multivariate polynomial kernels
- A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty
This page was built for publication: SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678449)
