output
20122025
most citedDeep Reinforcement Learning that Matters

345 citations

Showing cs.IRShow all

7 papers · 1 filter

cs.IR2021★ 18 cited

Not All Relevance Scores are Equal: Efficient Uncertainty and Calibration Modeling for Deep Retrieval Models

Daniel Cohen, Bhaskar Mitra, Oleg Lesota +2

In any ranking system, the retrieval model outputs a single score for a document based on its belief on how relevant it is to a given search query. While retrieval models have cont…

cs.IR2021

MS MARCO: Benchmarking Ranking Models in the Large-Data Regime

Nick Craswell, Bhaskar Mitra, Emine Yilmaz +2

Evaluation efforts such as TREC, CLEF, NTCIR and FIRE, alongside public leaderboard such as MS MARCO, are intended to encourage research and track our progress, addressing big ques…

cs.IR2021★ 1 cited

TREC Deep Learning Track: Reusable Test Collections in the Large Data Regime

Nick Craswell, Bhaskar Mitra, Emine Yilmaz +3

The TREC Deep Learning (DL) Track studies ad hoc search in the large data regime, meaning that a large set of human-labeled training data is available. Results so far indicate that…

cs.IR2021

Improving Transformer-Kernel Ranking Model Using Conformer and Query Term Independence

Bhaskar Mitra, Sebastian Hofstatter, Hamed Zamani +1

The Transformer-Kernel (TK) model has demonstrated strong reranking performance on the TREC Deep Learning benchmark -- and can be considered to be an efficient (but slightly less e…

cs.IR2021★ 5 cited

Significant Improvements over the State of the Art? A Case Study of the MS MARCO Document Ranking Leaderboard

Jimmy Lin, Daniel Campos, Nick Craswell +2

Leaderboards are a ubiquitous part of modern research in applied machine learning. By design, they sort entries into some linear order, where the top-scoring entry is recognized as…

cs.IR2021★ 4 cited

Tip of the Tongue Known-Item Retrieval: A Case Study in Movie Identification

Jaime Arguello, Adam Ferguson, Emery Fine +3

While current information retrieval systems are effective for known-item retrieval where the searcher provides a precise name or identifier for the item being sought, systems tend…

cs.IR2020★ 176 cited

Evaluating Stochastic Rankings with Expected Exposure

Fernando Diaz, Bhaskar Mitra, Michael D. Ekstrand +2

We introduce the concept of \emph{expected exposure} as the average attention ranked items receive from users over repeated samples of the same query. Furthermore, we advocate for…