The relaxed online maximum margin algorithm
From MaRDI portal
Recommendations
- An improved algorithm for online machine minimization
- Online optimization for max-norm regularization
- Online algorithms for BP functions maximization
- Online regularized generalized gradient classification algorithms
- Maxi-Min discriminant analysis via online learning
- scientific article; zbMATH DE number 1804099
- Online learning for min-max discrete problems
- Efficient online linear optimization with approximation algorithms
Cited in
(17)- Tracking the best hyperplane with a simple budget perceptron
- A primal-dual perspective of online learning algorithms
- Online multiple kernel classification
- The maximum cosine framework for deriving perceptron based linear classifiers
- 10.1162/15324430260185600
- scientific article; zbMATH DE number 1804099 (Why is no real title available?)
- An online AUC formulation for binary classification
- PAMR: passive aggressive mean reversion strategy for portfolio selection
- 10.1162/jmlr.2003.3.4-5.951
- On-line SVM learning via an incremental primal-dual technique
- Online training on a budget of support vector machines using twin prototypes
- On handling negative transfer and imbalanced distributions in multiple source transfer learning
- Online learning based on online DCA and application to online classification
- A family of large margin linear classifiers and its application in dynamic environments
- Stochastic online optimization for cyber-physical and robotic systems
- An online two-stage classification based on projections
- Online chaotic time series prediction using unbiased composite kernel machine via Cholesky factorization
This page was built for publication: The relaxed online maximum margin algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959967)
