Online pairwise learning algorithms with convex loss functions-Reference-Cited by-同舟云学术

Online pairwise learning algorithms with convex loss functions

Published:2017-09 Issue: Volume:406-407 Page:57-70
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Lin Junhong,Lei Yunwen,Zhang Bo,Zhou Ding-Xuan

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference34 articles.

1. Generalization bounds for ranking algorithms via algorithmic stability;Agarwal;J. Mach. Learn. Res.,2009

2. Non-strongly-convex smooth stochastic approximation with convergence rate o(1/n);Bach,2013

3. Local rademacher complexities;Bartlett;Ann. Stat.,2005

4. Rademacher and gaussian complexities: risk bounds and structural results;Bartlett;J. Mach. Learn. Res.,2003

5. Generalization bounds for metric and similarity learning;Cao;Mach. Learn.,2016

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Rates for Nonconvex Pairwise Learning;IEEE Transactions on Pattern Analysis and Machine Intelligence;2023-08

2. Investor preference analysis: An online optimization approach with missing information;Information Sciences;2023-07

3. Convergence analysis for kernel-regularized online regression associated with an RRKHS;Communications on Pure and Applied Analysis;2023

4. New Scalable and Efficient Online Pairwise Learning Algorithm;IEEE Transactions on Neural Networks and Learning Systems;2023

5. Robust pairwise learning with Huber loss;Journal of Complexity;2021-10