The asymptotics of ranking algorithms
From MaRDI portal
Publication:2438754
DOI10.1214/13-AOS1142zbMath1281.62058arXiv1204.1688WikidataQ123016831 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
68Q32: Computational learning theory
68T05: Learning and adaptive systems in artificial intelligence
62C99: Statistical decision theory
62F07: Statistical ranking and selection procedures
Related Items
Unnamed Item, Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion, The asymptotics of ranking algorithms
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
