Concept
Maximum Inner Product Search
Maximum Inner Product Search (MIPS) is the problem of finding, from a collection of vectors, the one (or top-k) whose inner product with a query vector is largest. It is the retrieval primitive underneath dense retrieval systems: you embed documents into vectors ahead of…
The rest of “Maximum Inner Product Search” 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→