Generalization ability of online pairwise support vector machine

DOI10.1016/J.JMAA.2020.124914MaRDI QIDQ1996328zbMATH OpenOpenAlexFDO

Authors Bin Zou, Yimo Qin, Jie Xu, Lei Yin, Hongwei Jiang, JingJing Zeng, Qi'an Chen

Publication date 4 March 2021

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jmaa.2020.124914

zbMATH Keywords

generalization abilityonline learningpairwise loss functionSVM

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Recommendations

• Online Pairwise Learning Algorithms
• Online regularized learning with pairwise loss functions
• Online pairwise learning algorithms with convex loss functions
• Online regularized pairwise learning with least squares loss
• Pairwise support vector machines and their application to large scale problems

Cites work

• 10.1162/1532443041424300
• Distance metric learning for large margin nearest neighbor classification
• Estimation of gradients and coordinate covariation in classification
• Generalization bounds for metric and similarity learning
• Generalization bounds for ranking algorithms via algorithmic stability
• Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
• Generalization performance of least-square regularized regression algorithm with Markov chain samples
• Learning the coordinate gradients
• Learning theory estimates via integral operators and their approximations
• Online Pairwise Learning Algorithms
• Online pairwise learning algorithms with convex loss functions
• Online regularized learning with pairwise loss functions
• Online regularized pairwise learning with least squares loss
• Optimal rates for the regularized least-squares algorithm
• Optimum bounds for the distributions of martingales in Banach spaces
• Pairwise support vector machines and their application to large scale problems
• Ranking and empirical minimization of \(U\)-statistics
• SVM-boosting based on Markov resampling: theory and algorithm
• The Generalization Ability of Online Algorithms for Dependent Data
• The generalization performance of ERM algorithm with strongly mixing observations
• The performance bounds of learning machines based on exponentially strongly mixing sequences
• Uniform ergodicity and strong mixing
• Unregularized online learning algorithms with general loss functions

Cited in

(3)

• A single pairwise model for classification using online learning with kernels
• Online training on a budget of support vector machines using twin prototypes
• Pairwise support vector machines and their application to large scale problems

Describes a project that uses

Uses Software

• LMNN

This page was built for publication: Generalization ability of online pairwise support vector machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996328)