Jump to content

Draft:Product quantization

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Morinator (talk | contribs) at 23:33, 20 March 2025 (created brief summary of *product quantization*). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Product quantization (PQ) is a technique that decomposes high-dimensional vector spaces into a Cartesian product of low-dimensional subspaces, with each subspace quantized independently. This approach represents each vector by a compact code, enabling efficient distance estimation while significantly reducing memory usage. [1]

It is commonly used in approximate nearest neighbor search, like the Hierarchical navigable small world data structure.

  1. ^ "Product Quantization for Nearest Neighbor Search". hal.science. Retrieved 2025-03-21.