:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Zhang, Tian, Padaki, Ashwin, Liang, Jiaming, Ives, Zack, Waingarten, Erik
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Information Retrieval
Online Access:	https://arxiv.org/abs/2602.08097
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
by: Khanna, Sanjeev, et al.
Published: (2025)

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

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

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

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

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

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

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

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

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
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)

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

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

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)

Data-Dependent LSH for the Earth Mover's Distance
by: Jayaram, Rajesh, et al.
Published: (2024)

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

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

Streaming and Massively Parallel Algorithms for Euclidean Max-Cut
by: Menand, Nicolas, et al.
Published: (2025)

Average Case Graph Searching in Non-Uniform Cost Models
by: Szyfelbein, Michał
Published: (2026)

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

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
by: Azizi, Ilias, et al.
Published: (2025)

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

A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations
by: Charikar, Moses, et al.
Published: (2024)

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

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
by: Ma, Xinran, et al.
Published: (2025)

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

Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025)

Nearly Tight Bounds on Testing of Metric Properties
by: Bao, Yiqiao, et al.
Published: (2024)

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

Average-Distortion Sketching
by: Bao, Yiqiao, et al.
Published: (2024)

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

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

Diversity-Aware $k$-Maximum Inner Product Search Revisited
by: Huang, Qiang, et al.
Published: (2024)

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
by: Petrov, Aleksandr V., et al.
Published: (2024)

Instance-Optimal Uniformity Testing and Tracking
by: Blanc, Guy, et al.
Published: (2025)

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

Linked Array Tree: A Constant-Time Search Structure for Big Data
by: Liu, Songpeng
Published: (2025)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
by: Tabei, Yasuo
Published: (2025)