Modular and Efficient Approximate Nearest Neighbors Search with Vectorium and kANNolo
cs.IR, cs.DB
Submitted: 2026-11-02
Updated: 2026-11-02
Code: https://github.com/TusKANNy/kannolo
Terminology
Sources
- ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search
- Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
- Arctic-Embed 2.0: Multilingual Retrieval Without Compromise
- SparTerm: Learning Term-based Sparse Representation for Fast Text Retrieval
- Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrieval
- A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniques
- SPLADE v2: Sparse Lexical and Expansion Model for Information Retrieval
- SPLADE-v3: New baselines for SPLADE
- Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data
- Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search
- Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models
- LAION-400M: Open Dataset of CLIP-Filtered 400 Million Image-Text Pairs
Related papers
- UniRank: Benchmarking Ranking Models for Unified Sequential Modeling and Feature Interaction
- Revisiting Text Ranking in Deep Research
- GateSID: One Gate to Balance Semantic and Collaborative Signals across the Item Lifecycle
- SAM-D2Q: Aligning Multimodal Doc2Query with Search Demand and Conversion for E-commerce
- GINGER: Spicing Up Graph-Based Vector Search
- Subtraction Gets You More: Gap-Aware Retrieval for Multimodal Multi-Hop QA