Generalization ability of online pairwise support vector machine
From MaRDI portal
Publication:1996328
DOI10.1016/j.jmaa.2020.124914OpenAlexW3118876227MaRDI QIDQ1996328
Bin Zou, Lei Yin, Jie Xu, Hongwei Jiang, Yimo Qin, Qi'an Chen, JingJing Zeng
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
Uses Software
Cites Work
- Generalization bounds for metric and similarity learning
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Unregularized online learning algorithms with general loss functions
- Generalization performance of least-square regularized regression algorithm with Markov chain samples
- Learning the coordinate gradients
- Optimum bounds for the distributions of martingales in Banach spaces
- The generalization performance of ERM algorithm with strongly mixing observations
- SVM-boosting based on Markov resampling: theory and algorithm
- Online pairwise learning algorithms with convex loss functions
- Online regularized learning with pairwise loss functions
- Optimal rates for the regularized least-squares algorithm
- Ranking and empirical minimization of \(U\)-statistics
- The performance bounds of learning machines based on exponentially strongly mixing sequences
- Learning theory estimates via integral operators and their approximations
- The Generalization Ability of Online Algorithms for Dependent Data
- 10.1162/1532443041424300
- Online regularized pairwise learning with least squares loss
- Online Pairwise Learning Algorithms
- Uniform ergodicity and strong mixing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalization ability of online pairwise support vector machine