PGTuner: An Efficient Framework for Automatic and Transferable Configuration Tuning of Proximity Graphs
Hao Duan, Yitong Song, Bin Yao, Anqi Liang
摘要
Approximate Nearest Neighbor Search (ANNS) plays a crucial role in many key areas. Proximity graphs (PGs) are the leading method for ANNS, offering the best balance between query efficiency and accuracy. However, their performance heavily depends on various construction and query parameters, which are difficult to optimize due to their complex inter-dependencies. Given that users often prioritize specific accuracy levels, efficiently identifying the optimal PG configurations to meet these targets is essential. Although some studies have explored automatic configuration tuning for PGs, they are limited by inefficiencies and suboptimal results. These issues stem from the need to construct numerous PGs for searching and re-tuning from scratch whenever the dataset changes, as well as the failure to capture the complex dependencies between configurations, query performance, and tuning objectives. To address these challenges, we propose PGTuner, an efficient framework for automatic PG configuration tuning leveraging pretraining knowledge and model transfer techniques. PGTuner improves efficiency through a pre-trained query performance prediction (QPP) model, eliminating the need to build multiple PGs. It also features a deep reinforcement learning-based parameter configuration recommendation (PCR) model to recommend optimal configurations for specific datasets and accuracy targets. Additionally, PGTuner incorporates out-of-distribution detection and deep active learning for efficient tuning in dynamic scenarios and transferring to new datasets. Extensive experiments demonstrate that PGTuner can stably achieve the top-level tuning effect across different datasets while significantly improving tuning efficiency by up to 14.69×, with a 14.64× boost in dynamic scenarios. The code and data for PGTuner are available online at https://github.com/hao- duan/PGTuner.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper18
- Retrieval-Augmented Generation for Knowledge-Intensive NLP TasksPatrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni 等NeurIPS 2020 · 被引用 19,162 次
- Energy-based Out-of-distribution DetectionWeitang Liu, Xiaoyun Wang, John D. Owens, Yixuan LiNeurIPS 2020 · 被引用 2,213 次
- Out-of-Distribution Detection with Deep Nearest NeighborsYiyou Sun, Yifei Ming, Xiaojin Zhu, Yixuan LiICML 2022 · 被引用 789 次
- A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor SearchMengzhao Wang, Xiaoliang Xu, Qiang Yue, Yuxiang WangVLDB 2021 · 被引用 354 次
- Likelihood Regret: An Out-of-Distribution Detection Score For Variational Auto-encoderZhisheng Xiao, Qing Yan, Yali AmitNeurIPS 2020 · 被引用 234 次
相关 Paper
- CSPG: Crossing Sparse Proximity Graphs for Approximate Nearest Neighbor SearchMing Yang, Yuzheng Cai, Weiguo ZhengNeurIPS 2024 · 被引用 14 次
- Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor SearchShuo Yang, Jiadong Xie, Yingfan Liu, Jeffrey Xu Yu 等VLDB 2025 · 被引用 16 次
- Graph-based Approximate Nearest Neighbor Search by Deep Reinforcement RoutingMingjie Li, Junhao Lin, Dian Ouyang, Ying Zhang 等ACM MM 2025
- Efficient Approximate Nearest Neighbor Search in Multi-dimensional DatabasesYun Peng, Byron Choi, Tsz Nam Chan, Jianye Yang 等SIGMOD 2023 · 被引用 74 次
- Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor SearchBinhong Li, Xiao Yan, Shangqi LuSIGMOD 2026 · 被引用 1 次
