Approximation analysis of gradient descent algorithm for bipartite ranking

DOI10.1155/2012/189753MaRDI QIDQ1760585zbMATH OpenOpenAlexWikidataFDO

Authors Hong Chen, Fangchao He, Zhibin Pan

Publication date 15 November 2012

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/189753

zbMATH Keywords

gradient descent algorithmbipartite rankinglearning rates

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Generalization performance of bipartite ranking algorithms with convex losses
• Learning Theory
• The convergence rate of a regularized ranking algorithm
• Learning rates for regularized least squares ranking algorithm
• Learning rates of gradient descent algorithm for classification

Cites work

• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• 10.1162/1532443041827916
• Estimation of gradients and coordinate covariation in classification
• Generalization bounds for ranking algorithms via algorithmic stability
• Generalization bounds for the area under the ROC curve
• Gradient learning in a classification setting by gradient descent
• Learning Theory
• Learning coordinate covariances via gradients
• Learning gradients by a gradient descent algorithm
• Learning rates of gradient descent algorithm for classification
• Learning rates of multi-kernel regularized regression
• Learning theory estimates via integral operators and their approximations
• Margin-based ranking and an equivalence between AdaBoost and RankBoost
• ONLINE LEARNING WITH MARKOV SAMPLING
• Online Regularized Classification Algorithms
• Online learning algorithms
• Ranking and empirical minimization of \(U\)-statistics
• Shannon sampling. II: Connections to learning theory
• Statistical Analysis of Bayes Optimal Subset Ranking
• The \(p\)-norm push: a simple convex ranking algorithm that concentrates at the top of the list
• Theory of Reproducing Kernels

Cited in

(4)

• Randomized smoothing variance reduction method for large-scale non-smooth convex optimization
• Learning rates of gradient descent algorithm for classification
• Generalization performance of bipartite ranking algorithms with convex losses
• Adaptive partitioning schemes for bipartite ranking

This page was built for publication: Approximation analysis of gradient descent algorithm for bipartite ranking

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