๊ฐ€์ž… ํ›„ ์ดˆ๋Œ€ ๋งํฌ๋ฅผ ๊ณต์œ ํ•˜๋ฉด ๋™์˜์ƒ ์žฌ์ƒ ๋ฐ ์ดˆ๋Œ€ ๋ณด์ƒ์„ ๋ฐ›์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

cv usk
@cv_usk
AI / Software Research Notes AI Agent, LLMOps, MLOps, Software Architecture ๆŠ•็จฟใฏๅ€‹ไบบใฎๆ„่ฆ‹ใงใ™ใ€‚
๊ฐ€์ž… May 2026
287 ํŒ”๋กœ์ž‰ ์ค‘    473 ํŒฌ
TL;DR: MV-IVF is an IVF index built directly over multi-vector (ColBERT-style) data, with point clouds as both documents and centroids. In batched search it averages about 4x the throughput of SVH. MV-IVF: Multi-Vector Retrieval via Multi-Vector Clustering Key points ใƒป๐Ÿงฉ Documents and centroids are both point clouds; routing uses MaxSim ใƒป๐Ÿ” With assignments fixed, the center update reduces to ordinary weighted clustering (MV-Lloyd) ใƒปโšก 1-bit / 4-bit / 8-bit quantization plus query compression, used at different stages ใƒป๐Ÿ“ฆ Batch search groups queries by leaf for better cache reuse ใƒป๐Ÿ“ˆ At 90% Recall-10@10, mean throughput is 2.19x MUVERA, 4.01x SVH, 2.07x MV-Vamana ใƒปโš–๏ธ Single-query latency wins on smaller datasets; MV-Vamana can win on larger ones Early stopping is a heuristic rather than a certified bound, and evaluation covers ColBERTv2 text retrieval only. Still, it shows that clustering multi-vector data directly is practical. #MultiVectorRetrieval# #ColBERT#
๋” ๋ณด๊ธฐ