The risk of trivial solutions in bipartite top ranking
type: Item
instance of: scholarly article
title: The risk of trivial solutions in bipartite top ranking
zbMATH Open document ID: 1482.62042
author: Aditya Krishna Menon
published in: Machine Learning
publication date: 2019-03-15T00:00:00Z
Mathematics Subject Classification ID: 62F07
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7036681
zbMATH Keywords: bipartite ranking
zbMATH Keywords: top rank optimisation
zbMATH Keywords: positives at the top
describes a project that uses: SVMstruct
MaRDI profile type: Publication
full work available at URL: s10994-018-5759-4
OpenAlex ID: W2889295521
cites work: Q3093256
cites work: Learning Theory
cites work: Convexity, Classification, and Risk Bounds
cites work: Ranking and empirical minimization of \(U\)-statistics
cites work: Q3174170
cites work: Q5396714
cites work: 10.1162/1532443041827916
cites work: Random classification noise defeats all convex potential boosters
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Composite binary losses
cites work: The \(p\)-norm push: a simple convex ranking algorithm that concentrates at the top of the list
cites work: Calibrated asymmetric surrogate losses
cites work: Robustness and generalization
cites work: Q3149262
Wikidata QID: Q129316098
DOI: 10.1007/S10994-018-5759-4
description: scientific article; zbMATH DE number 7036681