Metraipolis › archive › dc_494c235ad290
Maximum inner-product search — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Maximum_inner-product_search
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T00:19:45.630Z
- SHA-256 of the archived text
069fbf4676275b6c5b756697cd9dfb3d7f67b82da3e4bbc0fd71ea4f95c74fba- Stable URL of this page
https://metraipolis.com/documento/dc_494c235ad290
How to cite
Maximum inner-product search — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Maximum_inner-product_search (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_494c235ad290 (Metraipolis archive dc_494c235ad290, sha256 069fbf4676275b6c5b756697cd9dfb3d7f67b82da3e4bbc0fd71ea4f95c74fba)
BibTeX
@misc{dc494c235ad290,
title = {Maximum inner-product search — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Maximum_inner-product_search},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_494c235ad290; sha256 069fbf4676275b6c5b756697cd9dfb3d7f67b82da3e4bbc0fd71ea4f95c74fba},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Maximum_inner-product_search. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Maximum inner-product search (MIPS) is a search problem, with a corresponding class of search algorithms which attempt to maximise the inner product between a query and the data items to be retrieved. MIPS algorithms are used in a wide variety of big data applications, including recommendation algorithms and machine learning. Formally, for a database of vectors x i {\displaystyle x_{i}} defined over a set of labels S {\displaystyle S} in an inner product space with an inner product ⟨ ⋅ , ⋅ ⟩ {\displaystyle \langle \cdot ,\cdot \rangle } defined on it, MIPS search can be defined as the problem of determining a r g m a x i ∈ S ⟨ x i , q ⟩ {\displaystyle {\underset {i\in S}{\operatorname {arg\,max} }}\ \langle x_{i},q\rangle } for a given query q {\displaystyle q} . Although there is an obvious linear-time implementation, it is generally too slow to be used on practical problems. However, efficient algorithms exist to speed up MIPS search. Under the assumption of all vectors in the set having constant norm, MIPS can be viewed as equivalent to a nearest neighbor search (NNS) problem in which maximizing the inner product is equivalent to minimizing the corresponding distance metric in the NNS problem. Like other forms of NNS, MIPS algorithms may be approximate or exact. MIPS search is used as part of DeepMind's RETRO algorithm.
Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; categoria «Machine learning»).
Fonte: Wikipedia in inglese, voce «Maximum inner-product search» — https://en.wikipedia.org/wiki/Maximum_inner-product_search
Wikidata Q112892318 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q112892318
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Maximum_inner-product_search?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1303325176, consultata il 2026-10-05T23:36:36.493Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 53e7ff9daa85f487993e4f16825366bcf75542d9ca4da88183dd0e1d0558b3c5