paper-with-me

Papers

BERT-QE: Contextualized Query Expansion for Document Re-ranking

2020-09-15 · Findings of the Association for Computational Linguistics 2020 · Zhi Zheng, Kai Hui, Ben He, Xianpei Han, Le Sun, Andrew Yates

Query expansion aims to mitigate the mismatch between the language used in a query and in a document. However, query expansion methods can suffer from introducing non-relevant information when expanding the query. To bridge this gap, inspired by recent advances in applying contextualized models like BERT to the document retrieval task, this paper proposes a novel query expansion model that leverages the strength of the BERT model to select relevant document chunks for expansion. In evaluation on the standard TREC Robust04 and GOV2 test collections, the proposed BERT-QE model significantly outperforms BERT-Large models.

📄 PDF Abstract BibTeX arXiv:2009.07258

Code (1)

zh-zheng/BERT-QE 공식 구현 tf

Tasks

Re-RankingRetrieval

Methods 이 논문이 사용한 방법론

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Weight Decay 설명 없음
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…

Similar Papers 제목 키워드 기반

CEQE: Contextualized Embeddings for Query Expansion

2021-03-09 · Shahrzad Naseri, Jeffrey Dalton, Andrew Yates, James Allan

In this work we leverage recent advances in context-sensitive language models to improve the task of query expansion. Contextualized word representation models, such as ELMo and BERT, are rapidly replacing static embeddi…

RerankingRe-RankingRetrieval

BERT-Embedding and Citation Network Analysis based Query Expansion Technique for Scholarly Search

2023-01-26 · Shah Khalid, Shah Khusro, Aftab Alam, Abdul Wahid

The enormous growth of research publications has made it challenging for academic search engines to bring the most relevant papers against the given search query. Numerous solutions have been proposed over the years to i…

Retrieval

RepBERT: Contextualized Text Embeddings for First-Stage Retrieval

2020-06-28 · Jingtao Zhan, Jiaxin Mao, Yiqun Liu, Min Zhang 외

Although exact term match between queries and documents is the dominant method to perform first-stage retrieval, we propose a different approach, called RepBERT, to represent documents and queries with fixed-length conte…

Passage RankingRetrieval

On the Interpolation of Contextualized Term-based Ranking with BM25 for Query-by-Example Retrieval

2022-10-11 · Amin Abolghasemi, Arian Askari, Suzan Verberne

Term-based ranking with pre-trained transformer-based language models has recently gained attention as they bring the contextualization power of transformer models into the highly efficient term-based retrieval. In this …

Retrieval

Exploring Classic and Neural Lexical Translation Models for Information Retrieval: Interpretability, Effectiveness, and Efficiency Benefits

2021-02-12 · Leonid Boytsov, Zico Kolter

We study the utility of the lexical translation model (IBM Model 1) for English text retrieval, in particular, its neural variants that are trained end-to-end. We use the neural Model1 as an aggregator layer applied to c…

CPUDocument RankingInformation RetrievalRetrieval+2