Deep Pairwise Learning To Rank For Search Autocomplete

08/11/2021
by   Kai Yuan, et al.
0

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 offline evaluation, and yielded +0.06 lift in an Amazon's online A/B experiment.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2019

Personalized Query Auto-Completion Through a Lightweight Representation of the User Context

Query Auto-Completion (QAC) is a widely used feature in many domains, in...
research
08/03/2023

Seasonality Based Reranking of E-commerce Autocomplete Using Natural Language Queries

Query autocomplete (QAC) also known as typeahead, suggests list of compl...
research
10/18/2019

Implicit Context-aware Learning and Discovery for Streaming Data Analytics

The performance of machine learning model can be further improved if con...
research
09/19/2022

Learning To Rank Diversely

Airbnb is a two-sided marketplace, bringing together hosts who own listi...
research
02/25/2018

Deep Neural Network for Learning to Rank Query-Text Pairs

This paper considers the problem of document ranking in information retr...
research
12/26/2019

Alpha Discovery Neural Network based on Prior Knowledge

In financial automatic feature construction task, genetic programming is...
research
09/06/2019

Pairwise Learning to Rank by Neural Networks Revisited: Reconstruction, Theoretical Analysis and Practical Performance

We present a pairwise learning to rank approach based on a neural net, c...

Please sign up or login with your details

Forgot password? Click here to reset