A top-magnitude sign quantisation, grounded in a family of convex polytopes, encodes embeddings as ternary vectors and delivers fast, accurate approximate similarity search.
Bulletin of the Amer- ican Mathematical Society39(6), 423–426 (1933)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings
A top-magnitude sign quantisation, grounded in a family of convex polytopes, encodes embeddings as ternary vectors and delivers fast, accurate approximate similarity search.