Image de couverture de livre

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bruch, Sebastian, Nardini, Franco Maria, Rulli, Cosimo, Venturini, Rossano
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Information Retrieval Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximate Nearest Neighbor Search with Window Filters
par: Engels, Joshua, et autres
Publié: (2024)

Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations
par: Bruch, Sebastian, et autres
Publié: (2024)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
par: Al-Jazzazi, Yousef, et autres
Publié: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

Efficient Multi-Vector Dense Retrieval Using Bit Vectors
par: Nardini, Franco Maria, et autres
Publié: (2024)

Efficient Multivector Retrieval with Token-Aware Clustering and Hierarchical Indexing
par: Martinico, Silvio, et autres
Publié: (2026)

Pairing Clustered Inverted Indexes with kNN Graphs for Fast Approximate Retrieval over Learned Sparse Representations
par: Bruch, Sebastian, et autres
Publié: (2024)

Foundations of Vector Retrieval
par: Bruch, Sebastian
Publié: (2024)

Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets
par: Bruch, Sebastian, et autres
Publié: (2025)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
par: Zhang, Tian, et autres
Publié: (2026)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
par: Gottesbüren, Lars, et autres
Publié: (2024)

kANNolo: Sweet and Smooth Approximate k-Nearest Neighbors Search
par: Delfino, Leonardo, et autres
Publié: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

Forward Index Compression for Learned Sparse Retrieval
par: Bruch, Sebastian, et autres
Publié: (2026)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
par: Wang, Carrie, et autres
Publié: (2025)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
par: Shi, Jifan, et autres
Publié: (2026)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
par: Xu, Yuexuan, et autres
Publié: (2024)

A Bi-metric Framework for Fast Similarity Search
par: Xu, Haike, et autres
Publié: (2024)

Sparton: Fast and Memory-Efficient Triton Kernel for Learned Sparse Retrieval
par: Nguyen, Thong, et autres
Publié: (2026)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
par: Danait, Ved, et autres
Publié: (2025)

Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
par: Wang, Jiachen T., et autres
Publié: (2024)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
par: Zhang, Ziyu, et autres
Publié: (2025)

Effective Inference-Free Retrieval for Learned Sparse Representations
par: Nardini, Franco Maria, et autres
Publié: (2025)

Multivector Reranking in the Era of Strong First-Stage Retrievers
par: Martinico, Silvio, et autres
Publié: (2026)

REWA: A General Theory of Witness-Based Similarity
par: Phadke, Nikit
Publié: (2025)

Constant-Factor Approximation for the Uniform Decision Tree
par: Szyfelbein, Michał
Publié: (2026)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
par: Azizi, Ilias, et autres
Publié: (2025)

Minimum Weighted Feedback Arc Sets for Ranking from Pairwise Comparisons
par: Vahidi, Soroush, et autres
Publié: (2024)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
par: Xu, Zhenxiang, et autres
Publié: (2024)

Efficiently Constructing Sparse Navigable Graphs
par: Conway, Alex, et autres
Publié: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
par: Khanna, Sanjeev, et autres
Publié: (2025)

The Information Theory of Similarity
par: Phadke, Nikit
Publié: (2025)

Retrieval with Learned Similarities
par: Ding, Bailu, et autres
Publié: (2024)

Model-Free Counterfactual Subset Selection at Scale
par: Nguyen, Minh Hieu, et autres
Publié: (2025)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
par: Zhang, Guangyi, et autres
Publié: (2026)

Graph-Based Nearest-Neighbor Search without the Spread
par: Giliberti, Jeff, et autres
Publié: (2026)

Discovering Data Structures: Nearest Neighbor Search and Beyond
par: Salemohamed, Omar, et autres
Publié: (2024)

The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm
par: Chen, Jiale, et autres
Publié: (2025)