按年被提到
20192020 · 2 次2026
大模型与语言模型›量化、解码与分词·arXiv:1908.10396 · cs.LG

Accelerating Large-Scale Inference with Anisotropic Vector Quantization

Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, Sanjiv Kumar · 2019
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 3 人首次 2020-07-07 · 最近 2024-05-29
3不同的人
2活跃月份
3讨论串
182被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Quantization based techniques are the current state-of-the-art for scaling maximum inner product search to massive databases. Traditional approaches to quantization aim to minimize the reconstruction error of the database points. Based on the observation that for a given query, the database points that have the largest inner products are more relevant, we develop a family of anisotropic quantization loss functions. Under natural statistical assumptions, we show that quantization with these loss functions leads to a new variant of vector quantization that more greatly penalizes the parallel component of a datapoint's residual relative to its orthogonal component. The proposed approach achieves state-of-the-art results on the public benchmarks available at \url{ann-benchmarks.com}.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论greenyoda · 2020-07

“If someone is looking for the referenced paper (Accelerating Large-Scale Inference with Anisotropic Vector Quantization), it can be found here: https://arxiv.org/abs/1908.10396 (It's also linked in the repository's docs/algorithms.md, to which there's a link at the bottom of the main page.)”

Scann: Scalable Nearest Neighbors原评论 ↗
评论contravariant · 2020-07

“In case anyone else was confused why they didn't just project onto q first if they want to have <q,x'> as close as possible to the original <q,x>. Apparently q is a random query vector and their research shows how to define an alternative quantization loss where you weigh quantization loss more heavily when |<q,x>| is high [1]. It's worth noting that wit…”

ScaNN: Efficient Vector Similarity Search原评论 ↗
评论peter_l_downs · 2024-05

“> JVector, the library that powers DataStax Astra vector search, now supports indexing larger-than-memory datasets by performing construction-related searches with compressed vectors. This means that the edge lists need to fit in memory, but the uncompressed vectors do not, which gives us enough headroom to index Wikipedia-en on a laptop. It's interestin…”

Vector indexing all of Wikipedia on a laptop原评论 ↗