Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ma, Xinran, Zhou, Zhaoqi, Zhou, Chuan, Shang, Zaijiu, Li, Guoliang, Ma, Zhiming
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
di: Li, Binhong, et al.
Pubblicazione: (2025)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
di: Khanna, Sanjeev, et al.
Pubblicazione: (2025)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
di: Dehghankar, Mohsen, et al.
Pubblicazione: (2025)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
di: Andoni, Alexandr, et al.
Pubblicazione: (2026)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
di: Lu, Kejing, et al.
Pubblicazione: (2024)

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
di: McCauley, Samuel
Pubblicazione: (2024)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
di: Liang, Anqi, et al.
Pubblicazione: (2024)

Approximate Nearest Neighbor Search with Window Filters
di: Engels, Joshua, et al.
Pubblicazione: (2024)

Graph-Based Nearest-Neighbor Search without the Spread
di: Giliberti, Jeff, et al.
Pubblicazione: (2026)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
di: Gottesbüren, Lars, et al.
Pubblicazione: (2024)

Quantum Sketches, Hashing, and Approximate Nearest Neighbors
di: Hashemian, Sajjad
Pubblicazione: (2026)

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
di: Yu, Shangdi, et al.
Pubblicazione: (2023)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
di: Yin, Ziqi, et al.
Pubblicazione: (2026)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
di: Gao, Jianyang, et al.
Pubblicazione: (2024)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
di: Bruch, Sebastian, et al.
Pubblicazione: (2025)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
di: Zhang, Tian, et al.
Pubblicazione: (2026)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
di: Danait, Ved, et al.
Pubblicazione: (2025)

SVD Provably Denoises Nearest Neighbor Data
di: Kannan, Ravindran, et al.
Pubblicazione: (2026)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
di: Iff, Patrick, et al.
Pubblicazione: (2025)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
di: Al-Jazzazi, Yousef, et al.
Pubblicazione: (2025)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
di: Shi, Jifan, et al.
Pubblicazione: (2026)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
di: Xu, Yuexuan, et al.
Pubblicazione: (2024)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
di: Gao, Jianyang, et al.
Pubblicazione: (2024)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
di: Zhang, Ziyu, et al.
Pubblicazione: (2025)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
di: Mishra, Nina, et al.
Pubblicazione: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
di: Wang, Carrie, et al.
Pubblicazione: (2025)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
di: Diwan, Haya, et al.
Pubblicazione: (2024)

Discovering Data Structures: Nearest Neighbor Search and Beyond
di: Salemohamed, Omar, et al.
Pubblicazione: (2024)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
di: Krauthgamer, Robert, et al.
Pubblicazione: (2026)

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors
di: Chatziafratis, Vaggos, et al.
Pubblicazione: (2023)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
di: Zhang, Guangyi, et al.
Pubblicazione: (2026)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
di: Antoniadis, Antonios, et al.
Pubblicazione: (2020)

Palette Sparsification for Graphs with Sparse Neighborhoods
di: Dhawan, Abhishek
Pubblicazione: (2024)

Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
di: Wang, Jiachen T., et al.
Pubblicazione: (2024)

On the Effectiveness of Graph Reordering for Accelerating Approximate Nearest Neighbor Search on GPU
di: Oguri, Yutaro, et al.
Pubblicazione: (2025)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
di: Iacono, John, et al.
Pubblicazione: (2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
di: Herold, Martin G., et al.
Pubblicazione: (2025)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
di: Mallek, Nadym, et al.
Pubblicazione: (2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
di: Łącki, Jakub, et al.
Pubblicazione: (2025)

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs
di: Ootomo, Hiroyuki, et al.
Pubblicazione: (2023)