GUITAR: Gradient Pruning Toward Fast Neural Ranking

Abstract

With the continuous popularity of deep learning and representation learning, fast vector search becomes a vital task in various ranking/retrieval based applications, say recommendation, ads ranking and question answering. Neural network based ranking is widely adopted due to its powerful capacity in modeling complex relationships, such as between users and items, questions and answers. However, it is usually exploited in offline or re-ranking manners for it is time-consuming in computations. Online neural network ranking--so called fast neural ranking--is considered challenging because neural network measures are usually non-convex and asymmetric. Traditional Approximate Nearest Neighbor (ANN) search which usually focuses on metric ranking measures, is not applicable to these advanced measures. In this paper, we introduce a novel graph searching framework to accelerate the searching in the fast neural ranking problem. The proposed graph searching algorithm is bi-level: we first const

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keyzhao2023guitar

Related papers

• Understanding Image Retrieval Re-ranking: A Graph Neural Network Perspective (2020)0.00
• GGNN: Graph-based GPU Nearest Neighbor Search (2019)13.39
• Neural IR Meets Graph Embedding: A Ranking Model For Product Search (2019)11.85
• Efficient Neural Ranking Using Forward Indexes (2021)8.82
• Gpu-accelerated Multi-relational Parallel Graph Retrieval For Web-scale Recommendations (2025)0.00
• Scalable Exploration For Neural Online Learning To Rank With Perturbed Feedback (2022)0.00
• FINGER: Fast Inference For Graph-based Approximate Nearest Neighbor Search (2022)10.74
• Relative Nn-descent: A Fast Index Construction For Graph-based Approximate Nearest Neighbor Search (2023)8.09