arXiv:2108.04976
Deep Pairwise Learning To Rank For Search Autocomplete
원문 초록
Autocomplete (a.k.a "Query Auto-Completion", "AC") suggests full queries based on a prefix typed by customer. Autocomplete has been a core feature of commercial search engine. In this paper, we propose a novel context-aware neural network based pairwise ranker (DeepPLTR) to improve AC ranking, DeepPLTR leverages contextual and behavioral features to rank queries by minimizing a pairwise loss, based on a fully-connected neural network structure. Compared to LambdaMART ranker, DeepPLTR shows +3.90% MeanReciprocalRank (MRR) lift in offline evaluation, and yielded +0.06% (p < 0.1) Gross Merchandise Value (GMV) lift in an Amazon's online A/B experiment.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Kamae: Bridging Spark and Keras for Seamless ML Preprocessing
Unidentified and Confounded? Understanding Two-Tower Models for Unbiased Learning to Rank
LTRR: Learning To Rank Retrievers for LLMs
Paths to Causality: Finding Informative Subgraphs Within Knowledge Graphs for Knowledge-Based Causal Discovery
VisualQuality-R1: Reasoning-Induced Image Quality Assessment via Reinforcement Learning to Rank
Unlearning for Federated Online Learning to Rank: A Reproducibility Study
토론
이 논문과 연결된 포럼 글이 아직 없습니다.