Generalization ability of online pairwise support vector machine
type: Item
instance of: scholarly article
title: Generalization ability of online pairwise support vector machine
author: Bin Zou
author: Yimo Qin
author: Jie Xu
author: Lei Yin
author: Hongwei Jiang
author: JingJing Zeng
author: Qi'an Chen
published in: Journal of Mathematical Analysis and Applications
publication date: 2021-03-04T00:00:00Z
Mathematics Subject Classification ID: 68-XX
Mathematics Subject Classification ID: 62-XX
zbMATH DE Number: 7317499
zbMATH Keywords: online learning
zbMATH Keywords: pairwise loss function
zbMATH Keywords: SVM
zbMATH Keywords: generalization ability
describes a project that uses: LMNN
MaRDI profile type: Publication
full work available at URL: j.jmaa.2020.124914
OpenAlex ID: W3118876227
cites work: The Generalization Ability of Online Algorithms for Dependent Data
cites work: Q5405190
cites work: Generalization bounds for metric and similarity learning
cites work: Optimal rates for the regularized least-squares algorithm
cites work: Ranking and empirical minimization of \(U\)-statistics
cites work: Online regularized learning with pairwise loss functions
cites work: SVM-boosting based on Markov resampling: theory and algorithm
cites work: Online pairwise learning algorithms with convex loss functions
cites work: 10.1162/1532443041424300
cites work: Q3174048
cites work: Optimum bounds for the distributions of martingales in Banach spaces
cites work: Uniform ergodicity and strong mixing
cites work: Generalization bounds for ranking algorithms via algorithmic stability
cites work: Learning theory estimates via integral operators and their approximations
cites work: Online regularized pairwise learning with least squares loss
cites work: Distance metric learning for large margin nearest neighbor classification
cites work: Online Pairwise Learning Algorithms
cites work: Unregularized online learning algorithms with general loss functions
cites work: Learning the coordinate gradients
cites work: The performance bounds of learning machines based on exponentially strongly mixing sequences
cites work: The generalization performance of ERM algorithm with strongly mixing observations
cites work: Generalization performance of least-square regularized regression algorithm with Markov chain samples
cites work: Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
DOI: 10.1016/J.JMAA.2020.124914
description: scientific article; zbMATH DE number 7317499