MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
Fuente:
arXiv
Saved in:
| Main Authors: | Dhulipala, Laxman, Hadian, Majid, Jayaram, Rajesh, Lee, Jason, Mirrokni, Vahab |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
by: Dhulipala, Laxman, et al.
Published: (2023)
by: Dhulipala, Laxman, et al.
Published: (2023)
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)
by: Gottesbüren, Lars, et al.
Published: (2024)
TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
by: Zandieh, Amir, et al.
Published: (2025)
by: Zandieh, Amir, et al.
Published: (2025)
Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025)
by: Conway, Alex, et al.
Published: (2025)
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)
by: Gao, Jianyang, et al.
Published: (2024)
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)
by: Gao, Jianyang, et al.
Published: (2024)
SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
by: Li, Hui, et al.
Published: (2025)
by: Li, Hui, et al.
Published: (2025)
Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
by: Iff, Patrick, et al.
Published: (2025)
by: Iff, Patrick, et al.
Published: (2025)
Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
by: Azizi, Ilias, et al.
Published: (2025)
by: Azizi, Ilias, et al.
Published: (2025)
CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
by: Coleman, Benjamin, et al.
Published: (2023)
by: Coleman, Benjamin, et al.
Published: (2023)
Approximate Nearest Neighbor Search with Window Filters
by: Engels, Joshua, et al.
Published: (2024)
by: Engels, Joshua, et al.
Published: (2024)
Retrieval with Learned Similarities
by: Ding, Bailu, et al.
Published: (2024)
by: Ding, Bailu, et al.
Published: (2024)
Diversity-Aware $k$-Maximum Inner Product Search Revisited
by: Huang, Qiang, et al.
Published: (2024)
by: Huang, Qiang, et al.
Published: (2024)
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
by: Xu, Yuexuan, et al.
Published: (2024)
by: Xu, Yuexuan, et al.
Published: (2024)
On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
by: Wang, Carrie, et al.
Published: (2025)
by: Wang, Carrie, et al.
Published: (2025)
jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
by: Tabei, Yasuo
Published: (2025)
by: Tabei, Yasuo
Published: (2025)
GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)
by: Shi, Jifan, et al.
Published: (2026)
Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
by: Zhao, Fuheng, et al.
Published: (2023)
by: Zhao, Fuheng, et al.
Published: (2023)
Linked Array Tree: A Constant-Time Search Structure for Big Data
by: Liu, Songpeng
Published: (2025)
by: Liu, Songpeng
Published: (2025)
TIMEST: Temporal Information Motif Estimator Using Sampling Trees
by: Pan, Yunjie, et al.
Published: (2025)
by: Pan, Yunjie, et al.
Published: (2025)
Correlation Sketches for Approximate Join-Correlation Queries
by: Santos, Aécio, et al.
Published: (2021)
by: Santos, Aécio, et al.
Published: (2021)
Foundations of Vector Retrieval
by: Bruch, Sebastian
Published: (2024)
by: Bruch, Sebastian
Published: (2024)
Chamfer-Linkage for Hierarchical Agglomerative Clustering
by: Gowda, Kishen N, et al.
Published: (2026)
by: Gowda, Kishen N, et al.
Published: (2026)
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)
by: De Man, Quinten, et al.
Published: (2026)
Accurate and Fast Estimation of Temporal Motifs using Path Sampling
by: Pan, Yunjie, et al.
Published: (2024)
by: Pan, Yunjie, et al.
Published: (2024)
Triadic First-Order Logic Queries in Temporal Networks
by: Bhalerao, Omkar, et al.
Published: (2025)
by: Bhalerao, Omkar, et al.
Published: (2025)
Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
by: Al-Jazzazi, Yousef, et al.
Published: (2025)
by: Al-Jazzazi, Yousef, et al.
Published: (2025)
Model-Free Counterfactual Subset Selection at Scale
by: Nguyen, Minh Hieu, et al.
Published: (2025)
by: Nguyen, Minh Hieu, et al.
Published: (2025)
COPR -- Efficient, large-scale log storage and retrieval
by: Reichinger, Julian, et al.
Published: (2024)
by: Reichinger, Julian, et al.
Published: (2024)
Massively Parallel Minimum Spanning Tree in General Metric Spaces
by: Azarmehr, Amir, et al.
Published: (2024)
by: Azarmehr, Amir, et al.
Published: (2024)
JAG: Joint Attribute Graphs for Filtered Nearest Neighbor Search
by: Xu, Haike, et al.
Published: (2026)
by: Xu, Haike, et al.
Published: (2026)
Deterministic Retrieval at Scale: Optimal-Space LCP Indexing and 308x Energy Reduction on Modern GPUs
by: Byriukov, Stanislav
Published: (2026)
by: Byriukov, Stanislav
Published: (2026)
CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
by: Zhang, Ziyu, et al.
Published: (2025)
by: Zhang, Ziyu, et al.
Published: (2025)
Querying in Constant Expected Time with Learned Indexes
by: Croquevielle, Luis, et al.
Published: (2024)
by: Croquevielle, Luis, et al.
Published: (2024)
Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
by: Bruch, Sebastian, et al.
Published: (2025)
by: Bruch, Sebastian, et al.
Published: (2025)
Efficient Centroid-Linkage Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024)
by: Bateni, MohammadHossein, et al.
Published: (2024)
Towards Scalable and Practical Batch-Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2024)
by: De Man, Quinten, et al.
Published: (2024)
Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)
by: Xu, Zhenxiang, et al.
Published: (2024)
An Effective Tag Assignment Approach for Billboard Advertisement
by: Ali, Dildar, et al.
Published: (2024)
by: Ali, Dildar, et al.
Published: (2024)
Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
by: Lebeda, Christian Janos, et al.
Published: (2024)
by: Lebeda, Christian Janos, et al.
Published: (2024)
Similar Items
-
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
by: Dhulipala, Laxman, et al.
Published: (2023) -
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024) -
TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
by: Zandieh, Amir, et al.
Published: (2025) -
Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025) -
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)