Understanding and Generalizing Monotonic Proximity Graphs for Approximate Nearest Neighbor Search
원문 초록
Graph-based algorithms have shown great empirical potential for the approximate nearest neighbor (ANN) search problem. Currently, graph-based ANN search algorithms are designed mainly using heuristics, whereas theoretical analysis of such algorithms is quite lacking. In this paper, we study a fundamental model of proximity graphs used in graph-based ANN search, called Monotonic Relative Neighborhood Graph (MRNG), from a theoretical perspective. We use mathematical proofs to explain why proximity graphs that are built based on MRNG tend to have good searching performance. We also run experiments on MRNG and graphs generalizing MRNG to obtain a deeper understanding of the model. Our experiments give guidance on how to approximate and generalize MRNG to build proximity graphs on a large scale. In addition, we discover and study a hidden structure of MRNG called conflicting nodes, and we give theoretical evidence how conflicting nodes could be used to improve ANN search methods that are based on MRNG.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
StepProof: Step-by-step verification of natural language mathematical proofs
A Theoretical Analysis of Compositional Generalization in Neural Networks: A Necessary and Sufficient Condition
Hierarchical Attention Generates Better Proofs
Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation
Learning Rules Explaining Interactive Theorem Proving Tactic Prediction
ODGS: 3D Scene Reconstruction from Omnidirectional Images with 3D Gaussian Splattings
토론
이 논문과 연결된 포럼 글이 아직 없습니다.