Similarity Search On Neighbor's Graphs With Automatic Pareto Optimal Performance And Minimum Expected Quality Setups Based On Hyperparameter Optimization

Abstract

This manuscript introduces an autotuned algorithm for searching nearest neighbors based on neighbor graphs and optimization metaheuristics to produce Pareto-optimal searches for quality and search speed automatically; the same strategy is also used to produce indexes that achieve a minimum quality. Our approach is described and benchmarked with other state-of-the-art similarity search methods, showing convenience and competitiveness.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keytellez2022similarity

Related papers

• A Scalable Solution To The Nearest Neighbor Search Problem Through Local-search Methods On Neighbor Graphs (2017)3.58
• Efficient Autotuning Of Hyperparameters In Approximate Nearest Neighbor Search (2018)6.77
• A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph (2023)0.00
• Automating Nearest Neighbor Search Configuration With Constrained Optimization (2023)0.00
• Towards Similarity Graphs Constructed By Deep Reinforcement Learning (2019)0.00
• Graph-based Nearest Neighbor Search: From Practice To Theory (2019)0.00
• A Comprehensive Survey And Experimental Comparison Of Graph-based Approximate Nearest Neighbor Search (2021)17.35
• Fast Approximate Nearest Neighbor Search With A Dynamic Exploration Graph Using Continuous Refinement (2023)0.00