The risk of trivial solutions in bipartite top ranking

DOI10.1007/S10994-018-5759-4zbMath1482.62042OpenAlexW2889295521WikidataQ129316098 ScholiaQ129316098MaRDI QIDQ669314

Aditya Krishna Menon

Publication date: 15 March 2019

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-018-5759-4

zbMATH Keywords

bipartite rankingpositives at the toptop rank optimisation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Statistical ranking and selection procedures (62F07)

Uses Software

• SVMstruct

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robustness and generalization
• Introductory lectures on convex optimization. A basic course.
• Calibrated asymmetric surrogate losses
• Random classification noise defeats all convex potential boosters
• Ranking and empirical minimization of \(U\)-statistics
• 10.1162/1532443041827916
• Learning Theory
• Convexity, Classification, and Risk Bounds

This page was built for publication: The risk of trivial solutions in bipartite top ranking