PARADE(BERT)

Reported on 2 benchmarks across 1 task · 1 paper

Note: results are matched by exact model name. Different papers may use the same name for different model variants.

Natural Language Processing2 results

Ad-Hoc Information RetrievalonTREC Robust04
P@20· 2020-08-20
0.4486
best: 0.5165 (monoT5-3B (zero-shot))
PARADE: Passage Representation Aggregation for Document Reranking arXiv:2008.09093
Ad-Hoc Information RetrievalonTREC Robust04
nDCG@20· 2020-08-20
0.5252
best: 0.6091 (monoT5-3B (zero-shot))
PARADE: Passage Representation Aggregation for Document Reranking arXiv:2008.09093