Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search
<|reference_start|>Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search: We present a theoretical and empirical analysis of the adaptive entry point selection for graph-based approximate nearest neighbor search (ANNS). We introduce novel concepts: $b\textit{-monotonic path}$ and $B\textit{-MSNET}$, which better capture an actual graph in practical algorithms than existing concepts like MSNET. We prove that adaptive entry point selection offers better performance upper bound than the fixed central entry point under more general conditions than previous work. Empirically, we validate the method's effectiveness in accuracy, speed, and memory usage across various datasets, especially in challenging scenarios with out-of-distribution data and hard instances. Our comprehensive study provides deeper insights into optimizing entry points for graph-based ANNS for real-world high-dimensional data applications.<|reference_end|>
@article{oguri2024theoretical,
    title={Theoretical and Empirical Analysis of Adaptive Entry Point Selection for
  Graph-based Approximate Nearest Neighbor Search},
    author={Yutaro Oguri and Yusuke Matsui},
    journal={arXiv preprint arXiv:2402.04713},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.04713},
    primaryClass={cs.IR cs.DB cs.LG}
}