atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Loss Functions for Top-k Error: Analysis and Insights

CVPR 2016 · Learning theory and algorithms › Prediction and decision losses · approach: Ranking-based loss optimization · 65 citations (OpenAlex)

Check your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use softmax loss instead of optimizing a loss for one specific kMulticlass classification · 11 datasetstop-k performance across kHelped
Use a proposed top-k loss instead of softmax for a specific kMulticlass classification · 11 datasetstop-k performance at the target kHelped
Use smooth top-k hinge lossesTop-k hinge optimization · Scaling experimentstraining convergence speedHelped
Use smooth top-1 SVM instead of nonsmooth top-1 SVMILSVRC 2012 · ILSVRC 2012convergence rateHelped
Use smooth top-1 SVM instead of softmaxILSVRC 2012 · ILSVRC 2012training costHelped
Discard the highest-scoring predictions from the lossTruncated top-k entropy loss · Top-k classificationloss when top-k error is zeroHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy