OpenMETU
metadata only
CC BY-NC-ND 4.0
Sparcent: faster multi-vector dense retrieval with sparse centroid indices
Multi-vector dense retrieval methods have set the state-of-the-art retrieval quality on ranking tasks. However, the superior effectiveness of such methods comes with substantial computational overhead, which makes their deployment in large-scale search engines infeasible. As a remedy, we propose a n
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- No More K-means: Single-Stage Sparse Coding for Efficient Multi-Vector Retrieval#1128604
- Unified and Efficient Approach for Multi-Vector Similarity Search#2768
- Unbalanced Optimal Transport for Efficient Visual Document Retrieval#1388495
- Beyond Recall Saturation: Scaling Hard-Negative Reranker Training for Industrial Legal Retrieval#1389424
- MRVQ: One Resident Index for Dimension- and Rate-Elastic Vector Search#1188362
Record · ID 1460374
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive