# mips

> Browse 4 items tagged with mips.

## Items

- [Faster Maximum Inner Product Search in High Dimensions](https://vectordb.ever.works/items/faster-mips-high-dimensions) — A 2022 research paper presenting algorithms for faster MIPS (Maximum Inner Product Search) in high-dimensional spaces. MIPS is crucial for recommendation systems, neural networks, and various machine learning applications.
- [Maximum Inner Product is Query-Scaled Nearest Neighbor](https://vectordb.ever.works/items/maximum-inner-product-query-scaled) — A theoretical paper establishing the relationship between Maximum Inner Product Search and query-scaled nearest neighbor search. This connection enables applying NN techniques to MIPS problems with theoretical guarantees.
- [Inner Product Similarity](https://vectordb.ever.works/items/inner-product-similarity) — A vector similarity metric that calculates the dot product of two vectors, combining both magnitude and direction. Equivalent to cosine similarity when vectors are normalized, and commonly used for Maximum Inner Product Search (MIPS).
- [Maximum Inner Product Search (MIPS)](https://vectordb.ever.works/items/maximum-inner-product-search-mips) — A search problem focused on finding vectors that maximize the inner product with a query vector. Common in recommendation systems and neural search where magnitude carries semantic meaning, requiring specialized algorithms like those in ScaNN.

---

_Canonical page: https://vectordb.ever.works/tags/mips_