Francesco Benocci

Lossless Compression of Proximity Graph Indexes for Efficient Approximate Nearest Neighbors Search

Graph-based Approximate Nearest Neighbor (ANN) indexes, such as HNSW, are the backbone of modern vector search. However, their massive memory footprint creates a severe infrastructure bottleneck. While vector quantization is widely adopted to reduce the memory required to store data vectors, the graph's edge structure...