Online regularized generalized gradient classification algorithms
From MaRDI portal
Recommendations
Cites work
- Convergence analysis of online algorithms
- Convexity, Classification, and Risk Bounds
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- Learning rates of gradient descent algorithm for classification
- Multi-kernel regularized classifiers
- Online learning algorithms
- Online Learning with Kernels
- Online Regularized Classification Algorithms
- Optimal aggregation of classifiers in statistical learning.
- Optimization and nonsmooth analysis
- Regularization networks and support vector machines
- Relative expected instantaneous loss bounds
- Relative loss bounds for on-line density estimation with the exponential family of distributions
- Shannon sampling and function reconstruction from point values
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Support vector machine soft margin classifiers: error analysis
- Support vector machines are universally consistent
- Theory of Reproducing Kernels
- Tracking the best expert
Cited in
(6)- Convergence of online pairwise regression learning with quadratic loss
- Fully online classification by regularization
- Online Regularized Classification Algorithms
- scientific article; zbMATH DE number 1950582 (Why is no real title available?)
- Online logistic regression
- The relaxed online maximum margin algorithm
This page was built for publication: Online regularized generalized gradient classification algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110496)