Fig.1

Concept

Top-k

Top-k means selecting the k highest-scoring items from a ranked set, where k is a fixed integer you choose in advance. It is the retrieval counterpart to argmax, except instead of returning the single best candidate, you return the best k of them.

The rest of “Top-k” is a premium feature: every concept in the library gets a precise, practitioner-focused write-up like this one, cross-linked straight from the paper summaries that use it.

Log in to unlock

← Back to the library

Top-k, explained · Fig. 1