Learning-to-Rank with BERT in TF-Ranking

04/17/2020
by   Shuguang Han, et al.
0

This paper describes a machine learning algorithm for document (re)ranking, in which queries and documents are firstly encoded using BERT [1], and on top of that a learning-to-rank (LTR) model constructed with TF-Ranking (TFR) [2] is applied to further optimize the ranking performance. This approach is proved to be effective in a public MS MARCO benchmark [3]. Our submissions achieve the best performance for the passage re-ranking task as of March 30, 2020 [4], and the second best performance for the passage full-ranking task as of April 10, 2020 [5], demonstrating the effectiveness of combining ranking losses with BERT representations for document ranking.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2020

Longformer for MS MARCO Document Re-ranking Task

Two step document ranking, where the initial retrieval is done by a clas...
research
06/23/2022

BERT Rankers are Brittle: a Study using Adversarial Document Perturbations

Contextual ranking models based on BERT are now well established for a w...
research
04/06/2023

On the Learnability of Multilabel Ranking

Multilabel ranking is a central task in machine learning with widespread...
research
06/14/2023

Learning to Rank when Grades Matter

Graded labels are ubiquitous in real-world learning-to-rank applications...
research
04/28/2020

Joint Keyphrase Chunking and Salience Ranking with BERT

An effective keyphrase extraction system requires to produce self-contai...
research
03/18/2019

An Updated Duet Model for Passage Re-ranking

We propose several small modifications to Duet---a deep neural ranking m...
research
05/07/2018

Ranking for Relevance and Display Preferences in Complex Presentation Layouts

Learning to Rank has traditionally considered settings where given the r...

Please sign up or login with your details

Forgot password? Click here to reset