GGNN:基于图的GPU最近邻搜索
GGNN: Graph-based GPU Nearest Neighbor Search
摘要:
高维近似最近邻(ANN)搜索是若干计算机视觉系统的组成部分,并且在具有显式记忆表示的深度学习中变得重要。由于PQT、FAISS和SONG开始利用GPU提供的大规模并行性,因此基于GPU的实现是当今最先进的ANN方法的关键资源。虽然这些方法中的大多数都允许更快的查询,但很少强调加速底层索引结构的构建。在本文中,我们提出了一种新的GPU友好的搜索结构的基础上最近邻图和图上的信息传播。我们的方法旨在利用GPU架构来加速索引结构的分层构造和执行查询。经验评估表明,GGNN在构建时间、准确性和搜索速度方面明显优于最先进的基于CPU和GPU的系统。
英文摘要:
Approximate nearest neighbor (ANN) search in high dimensions is an integral part of several computer vision systems and gains importance in deep learning with explicit memory representations. Since PQT, FAISS, and SONG started to leverage the massive parallelism offered by GPUs, GPU-based implementations are a crucial resource for today's state-of-the-art ANN methods. While most of these methods allow for faster queries, less emphasis is devoted to accelerating the construction of the underlying index structures. In this paper, we propose a novel GPU-friendly search structure based on nearest neighbor graphs and information propagation on graphs. Our method is designed to take advantage of GPU architectures to accelerate the hierarchical construction of the index structure and for performing the query. Empirical evaluation shows that GGNN significantly surpasses the state-of-the-art CPU- and GPU-based systems in terms of build-time, accuracy and search speed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。