Online Pairwise Learning Algorithms

DOI10.1162/NECO_a_00817zbMath1472.68221arXiv1502.07229OpenAlexW2274052023WikidataQ50532611 ScholiaQ50532611MaRDI QIDQ5380417

Yiming Ying, Ding-Xuan Zhou

Publication date: 4 June 2019

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.07229

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Related Items (22)

Distributed spectral pairwise ranking algorithms ⋮ Online regularized pairwise learning with non-i.i.d. observations ⋮ Unnamed Item ⋮ Distributed kernel gradient descent algorithm for minimum error entropy principle ⋮ Kernel-based online gradient descent using distributed approach ⋮ Convergence of online pairwise regression learning with quadratic loss ⋮ Stochastic AUC optimization with general loss ⋮ Convergence analysis for kernel-regularized online regression associated with an RRKHS ⋮ Error analysis of kernel regularized pairwise learning with a strongly convex loss ⋮ Unnamed Item ⋮ Analysis of Online Composite Mirror Descent Algorithm ⋮ Stability and optimization error of stochastic gradient descent for pairwise learning ⋮ Online minimum error entropy algorithm with unbounded sampling ⋮ Kernel gradient descent algorithm for information theoretic learning ⋮ Robust pairwise learning with Huber loss ⋮ Generalization ability of online pairwise support vector machine ⋮ Online pairwise learning algorithms with convex loss functions ⋮ Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions ⋮ Online regularized pairwise learning with least squares loss ⋮ Convergence analysis of distributed multi-penalty regularized pairwise learning ⋮ Fast and strong convergence of online learning algorithms ⋮ Iterative gradient descent for outlier detection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalization bounds for metric and similarity learning
• Unregularized online learning algorithms with general loss functions
• Model selection for regularized least-squares algorithm in learning theory
• Online gradient descent learning algorithms
• Optimum bounds for the distributions of martingales in Banach spaces
• Ranking and empirical minimization of \(U\)-statistics
• Learning rates of least-square regularized regression
• Online learning algorithms
• Learning theory estimates via integral operators and their approximations
• On early stopping in gradient descent learning
• On the mathematical foundations of learning
• Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence
• Learning Theory
• Support Vector Machines
• On the Generalization Ability of On-Line Learning Algorithms
• An Explicit Description of the Reproducing Kernel Hilbert Spaces of Gaussian RBF Kernels
• Online Regularized Classification Algorithms
• Robust Stochastic Approximation Approach to Stochastic Programming
• 10.1162/153244303321897690
• Regularization schemes for minimum error entropy principle
• Theory of Reproducing Kernels
• A Stochastic Approximation Method

This page was built for publication: Online Pairwise Learning Algorithms