The asymptotics of ranking algorithms

DOI10.1214/13-AOS1142zbMath1281.62058arXiv1204.1688OpenAlexW3102424228WikidataQ123016831 ScholiaQ123016831MaRDI QIDQ2438754

Lester Mackey, Michael I. Jordan, John C. Duchi

Publication date: 6 March 2014

Published in: The Annals of Statistics (Search for Journal in Brave)

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

zbMATH Keywords

consistencyU-statisticsFisher consistencyrank aggregation

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Statistical decision theory (62C99) Statistical ranking and selection procedures (62F07)

Related Items

The asymptotics of ranking algorithms, Unnamed Item, Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A least squares solution for paired comparisons with incomplete data
• Decision-making with the AHP: Why is the principal eigenvector necessary
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Ranking and empirical minimization of \(U\)-statistics
• The asymptotics of ranking algorithms
• How to compare different loss functions and their risks
• Lectures on Modern Convex Optimization
• NON-NULL RANKING MODELS. I
• Introduction to Information Retrieval
• On the Generalization Ability of On-Line Learning Algorithms
• Statistical Analysis of Bayes Optimal Subset Ranking
• Relative measurement and its generalization in decision making why pairwise comparisons are central in mathematics for the measurement of intangible factors the analytic hierarchy/network process
• Robust Stochastic Approximation Approach to Stochastic Programming
• 10.1162/1532443041827916
• Convexity, Classification, and Risk Bounds