Support vector machine soft margin classifiers: error analysis
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Kernel-based maximum correntropy criterion with gradient descent method
- Quantitative convergence analysis of kernel based large-margin unified machines
- Moving quantile regression
- Learning rates for multi-kernel linear programming classifiers
- Learning from non-identical sampling for classification
- Fully online classification by regularization
- Regularized ranking with convex losses and \(\ell^1\)-penalty
- The learning rate of \(l_2\)-coefficient regularized classification with strong loss
- Classification with non-i.i.d. sampling
- On reject and refine options in multicategory classification
- Error analysis of classification learning algorithms based on LUMs loss
- Learning rates for kernel-based expectile regression
- Sparse online regression algorithm with insensitive loss functions
- Classification with polynomial kernels and l^1-coefficient regularization
- Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications
- Error bounds of multi-graph regularized semi-supervised classification
- Learning from dependent observations
- Learning rates of multi-kernel regularized regression
- Error bounds for learning the kernel
- Kernel-based sparse regression with the correntropy-induced loss
- Generalization bounds for metric and similarity learning
- Estimation of the misclassification error for multicategory support vector machine classification
- Learning rates for regularized classifiers using multivariate polynomial kernels
- Convergence rate of SVM for kernel-based robust regression
- Generalization bounds of ERM algorithm with Markov chain samples
- Online regularized generalized gradient classification algorithms
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Extreme learning machine for ranking: generalization analysis and applications
- Logistic classification with varying gaussians
- The convergence rate for a \(K\)-functional in learning theory
- Generalization performance of Lagrangian support vector machine based on Markov sampling
- Online learning for quantile regression and support vector regression
- Error analysis of multicategory support vector machine classifiers
- Kernel gradient descent algorithm for information theoretic learning
- scientific article; zbMATH DE number 2159115 (Why is no real title available?)
- Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions
- Convergence of online mirror descent
- Learning from uniformly ergodic Markov chains
- Online classification with varying Gaussians
- Support vector machines regression with l^1-regularizer
- Analysis of support vector machine classification
- Learning rates for partially linear support vector machine in high dimensions
- Learning rates for classification with Gaussian kernels
- Analysis of Online Composite Mirror Descent Algorithm
- Learning from regularized regression algorithms with \(p\)-order Markov chain sampling
- Robust fuzzy rough classifiers
- Analysis of support vector machines regression
- Statistical consistency of coefficient-based conditional quantile regression
- Moduli of smoothness, \(K\)-functionals and Jackson-type inequalities associated with Kernel function approximation in learning theory
- Robust fuzzy rough approximations with kNN granules for semi-supervised feature selection
- Online outcome weighted learning with general loss functions
- Learning rates for the kernel regularized regression with a differentiable strongly convex loss
- Distributed learning with regularized least squares
- Statistical analysis of the moving least-squares method with unbounded sampling
- Sparse additive machine with ramp loss
- Convergence analysis of online algorithms
- Margin error bounds for support vector machines on reproducing kernel Banach spaces
- Approximation analysis of learning algorithms for support vector regression and quantile regression
- Approximation with polynomial kernels and SVM classifiers
- Quantile regression with _1-regularization and Gaussian kernels
- Large margin unified machines with non-i.i.d. process
- Estimation of convergence rate for multi-regression learning algorithm
- Minimax optimal rates of convergence for multicategory classifications
- Learning and approximation by Gaussians on Riemannian manifolds
- Optimal learning rates for least squares regularized regression with unbounded sampling
- On the rate of convergence for multi-category classification based on convex losses
- The consistency of multicategory support vector machines
- The generalization performance of ERM algorithm with strongly mixing observations
- Multi-kernel regularized classifiers
- Functional incremental least square regression algorithm
- Generalization bounds of incremental SVM
- Convergence of unregularized online learning algorithms
- Generalization analysis of Fredholm kernel regularized classifiers
- Learning rates of regression with q-norm loss and threshold
- The consistency of least-square regularized regression with negative association sequence
- Understanding generalization of functional linear regression from non-i.i.d. sample viewpoint
- Convergence rate of the semi-supervised greedy algorithm
- Analysis of regularized least-squares in reproducing kernel Kreĭn spaces
- The guaranteed estimation of the Lipschitz classifier accuracy: confidence set approach
- An asymptotic statistical analysis of support vector machines with soft margins
- On the K-functional in learning theory
- Learning rates of regularized regression for exponentially strongly mixing sequence
- Unregularized online algorithms with varying Gaussians
- Consistency and convergence rate for nearest subspace classifier
- Compressed classification learning with Markov chain samples
- Learning performance of Tikhonov regularization algorithm with geometrically beta-mixing observations
- Learning rates of gradient descent algorithm for classification
- Learning rates of kernel-based robust classification
- Comparison theorems on large-margin learning
- Convergence rates of learning algorithms by random projection
- scientific article; zbMATH DE number 7415083 (Why is no real title available?)
- Sparse kernel regression with coefficient-based \(\ell_q\)-regularization
- Learning performance of regularized regression with multiscale kernels based on Markov observations
- Concentration estimates for learning with unbounded sampling
- Conditional quantiles with varying Gaussians
- On the convergence rate of kernel-based sequential greedy regression
- A note on support vector machines with polynomial kernels
- Approximating and learning by Lipschitz kernel on the sphere
- Generalization performance of least-square regularized regression algorithm with Markov chain samples
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
This page was built for publication: Support vector machine soft margin classifiers: error analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093220)
