MétaCan
Menu
Back to cohort
Record W4284682639 · doi:10.1145/3477495.3531749

Document Expansion Baselines and Learned Sparse Lexical Representations for MS MARCO V1 and V2

2022· article· en· W4284682639 on OpenAlexafffund
Xueguang Ma, Ronak Pradeep, Rodrigo Nogueira, Jimmy Lin

Bibliographic record

VenueProceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval · 2022
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of CanadaCanada First Research Excellence FundCompute Canada
KeywordsComputer scienceWeightingRanking (information retrieval)Information retrievalNatural language processingQuestion answeringArtificial intelligenceSequence (biology)Term (time)Language modelArtificial neural network

Abstract

fetched live from OpenAlex

With doc2query, we train a neural sequence-to-sequence model that, given an input span of text, predicts a natural language query that the text might answer. These predictions can be viewed as document expansions that feed standard bag-of-words term weighting models such as BM25 or neural retrieval models based on learned sparse lexical representations such as uniCOIL. Previous experiments on the MS MARCO datasets have demonstrated the effectiveness of these methods, and they serve as baselines that are widely used by the community today. Following the recent release of the MS MARCO V2 passage and document ranking test collections, we have refreshed our doc2query and uniCOIL models. This work describes a number of resources that support competitive, reproducible baselines for both the MS MARCO V1 and V2 test collections using our Anserini and Pyserini IR toolkits. Together, they provide a solid foundation for future research on neural retrieval models using the MS MARCO datasets and beyond.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.023
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.028
Threshold uncertainty score0.055

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.023
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0040.003
Science and technology studies0.0020.001
Scholarly communication0.0030.005
Open science0.0040.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0070.006

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.121
GPT teacher head0.362
Teacher spread0.241 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations16
Published2022
Admission routes2
Has abstractyes

Explore more

Same venueProceedings of the 45th International ACM SIGIR Conference on Research and Development in Information RetrievalSame topicTopic ModelingFrench-language works237,207