Task-Oriented Query Reformulation with Reinforcement Learning

Rodrigo Nogueira, Kyunghyun Cho
4/15/2017
cs.IR

Official code: nyu-dl/dl4ir-query-reformulator (144 stars, BSD-3-Clause, last commit 2018-05-15).

Abstract

Search engines play an important role in our everyday lives by assisting us in finding the information we need. When we input a complex query, however, results are often far from satisfactory. In this work, we introduce a query reformulation system based on a neural network that rewrites a query to maximize the number of relevant documents returned. We train this neural network with reinforcement learning. The actions correspond to selecting terms to build a reformulated query, and the reward is the document recall. We evaluate our approach on three datasets against strong baselines and show a relative improvement of 5-20% in terms of recall. Furthermore, we present a simple method to estimate a conservative upper-bound performance of a model in a particular environment and verify that there is still large room for improvements.

View on arXivView PDF

Code Implementations(1)

BSD-3-Clause
14430PythonApr 15, 20178 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{nogueira2017taskoriented,
  title  = {Task-Oriented Query Reformulation with Reinforcement Learning},
  author = {Rodrigo Nogueira and Kyunghyun Cho},
  year   = {2017},
  eprint = {1704.04572},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1704.04572}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1704.04572.svg)](https://codeofpaper.com/paper/1704.04572)

Discussion