Pith. sign in

REVIEW 2 cited by

Deep Reinforced Query Reformulation for Information Retrieval

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.07987 v1 pith:Y67264JK submitted 2020-07-15 cs.IR

classification cs.IR
keywords queryretrievalmodeldeepinformationqueriesreformulationwhen
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Query reformulations have long been a key mechanism to alleviate the vocabulary-mismatch problem in information retrieval, for example by expanding the queries with related query terms or by generating paraphrases of the queries. In this work, we propose a deep reinforced query reformulation (DRQR) model to automatically generate new reformulations of the query. To encourage the model to generate queries which can achieve high performance when performing the retrieval task, we incorporate query performance prediction into our reward function. In addition, to evaluate the quality of the reformulated query in the context of information retrieval, we first train our DRQR model, then apply the retrieval ranking model on the obtained reformulated query. Experiments are conducted on the TREC 2020 Deep Learning track MSMARCO document ranking dataset. Our results show that our proposed model outperforms several query reformulation model baselines when performing retrieval task. In addition, improvements are also observed when combining with various retrieval models, such as query expansion and BERT.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Improved IR-based Bug Localization with Intelligent Relevance Feedback

    cs.SE 2025-01 conditional novelty 6.0 of 10

    BRaIn uses LLM relevance judgments to expand queries and re-rank search results, improving IR-based bug localization on the Bench4BL dataset.

  2. Rethinking On-policy Optimization for Query Augmentation

    cs.CL 2025-10 conditional novelty 5.0 of 10

    Simple zero-shot prompt-based query expansion matches costly RL-trained query rewriting in retrieval benchmarks, and training the RL policy to generate pseudo-documents (OPQE) yields the best overall scores.

Pith tools