{"url":"/task/passage-ranking","name":"Passage Ranking","slug":"passage-ranking","description_markdown":null,"categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":73,"papers_with_code":35,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/passage-ranking-on-ms-marco","slug":"passage-ranking-on-ms-marco","dataset":"MS MARCO","dataset_url":"/dataset/ms-marco","rows_in_archive":4,"metrics":["MRR@10"],"first_row_in_archive_order":{"model":"Fine-tuned SOTA","paper_title":"Text and Code Embeddings by Contrastive Pre-Training","paper_url":"/paper/text-and-code-embeddings-by-contrastive-pre","paper_date":"2022-01-24","arxiv_id":"2201.10005","code_links":[{"title":"openmatch/coco-dr","url":"https://github.com/openmatch/coco-dr"}],"syntology":null}}],"datasets":[{"url":"/dataset/ms-marco","name":"MS MARCO","full_name":"Microsoft Machine Reading Comprehension Dataset","num_papers_in_archive":1036}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":35,"tagged_in_all":73,"items":[{"url":"/paper/adaptive-re-ranking-with-a-corpus-graph","title":"Adaptive Re-Ranking with a Corpus Graph","date":"2022-08-18","arxiv_id":"2208.08942","repositories_listed":3,"syntology":null},{"url":"/paper/pseudo-relevance-feedback-for-multiple","title":"Pseudo-Relevance Feedback for Multiple Representation Dense Retrieval","date":"2021-06-21","arxiv_id":"2106.11251","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/repbert-contextualized-text-embeddings-for","title":"RepBERT: Contextualized Text Embeddings for First-Stage Retrieval","date":"2020-06-28","arxiv_id":"2006.15498","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/learning-to-rank-in-generative-retrieval","title":"Learning to Rank in Generative Retrieval","date":"2023-06-27","arxiv_id":"2306.15222","repositories_listed":2,"syntology":null},{"url":"/paper/shallow-pooling-for-sparse-labels","title":"Shallow pooling for sparse labels","date":"2021-08-31","arxiv_id":"2109.00062","repositories_listed":2,"syntology":null},{"url":"/paper/dealing-with-typos-for-bert-based-passage","title":"Dealing with Typos for BERT-based Passage Retrieval and Ranking","date":"2021-08-27","arxiv_id":"2108.12139","repositories_listed":2,"syntology":null},{"url":"/paper/document-ranking-with-a-pretrained-sequence","title":"Document Ranking with a Pretrained Sequence-to-Sequence Model","date":"2020-03-14","arxiv_id":"2003.06713","repositories_listed":2,"syntology":null},{"url":"/paper/iranker-towards-ranking-foundation-model","title":"IRanker: Towards Ranking Foundation Model","date":"2025-06-25","arxiv_id":"2506.21638","repositories_listed":1,"syntology":null},{"url":"/paper/sliding-windows-are-not-the-end-exploring","title":"Sliding Windows Are Not the End: Exploring Full Ranking with Long-Context Large Language Models","date":"2024-12-19","arxiv_id":"2412.14574","repositories_listed":1,"syntology":null},{"url":"/paper/cure-clinical-understanding-retrieval","title":"CURE: A dataset for Clinical Understanding & Retrieval Evaluation","date":"2024-12-09","arxiv_id":"2412.06954","repositories_listed":1,"syntology":null},{"url":"/paper/demorank-selecting-effective-demonstrations","title":"DemoRank: Selecting Effective Demonstrations for Large Language Models in Ranking Task","date":"2024-06-24","arxiv_id":"2406.16332","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_unverified":4,"n_pointer_only":17}},{"url":"/paper/leveraging-passage-embeddings-for-efficient","title":"Leveraging Passage Embeddings for Efficient Listwise Reranking with Large Language Models","date":"2024-06-21","arxiv_id":"2406.14848","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/shallow-cross-encoders-for-low-latency","title":"Shallow Cross-Encoders for Low-Latency Retrieval","date":"2024-03-29","arxiv_id":"2403.20222","repositories_listed":1,"syntology":null},{"url":"/paper/fusion-in-t5-unifying-document-ranking","title":"Fusion-in-T5: Unifying Document Ranking Signals for Improved Information Retrieval","date":"2023-05-24","arxiv_id":"2305.14685","repositories_listed":1,"syntology":null},{"url":"/paper/is-chatgpt-good-at-search-investigating-large","title":"Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents","date":"2023-04-19","arxiv_id":"2304.09542","repositories_listed":1,"syntology":null},{"url":"/paper/t2ranking-a-large-scale-chinese-benchmark-for","title":"T2Ranking: A large-scale Chinese Benchmark for Passage Ranking","date":"2023-04-07","arxiv_id":"2304.03679","repositories_listed":1,"syntology":null},{"url":"/paper/lead-liberal-feature-based-distillation-for","title":"LEAD: Liberal Feature-based Distillation for Dense Retrieval","date":"2022-12-10","arxiv_id":"2212.05225","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-impact-of-speech-recognition-errors-in","title":"On the Impact of Speech Recognition Errors in Passage Retrieval for Spoken Question Answering","date":"2022-09-26","arxiv_id":"2209.12944","repositories_listed":1,"syntology":null},{"url":"/paper/order-disorder-imitation-adversarial-attacks","title":"Order-Disorder: Imitation Adversarial Attacks for Black-box Neural Ranking Models","date":"2022-09-14","arxiv_id":"2209.06506","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-pairwise-re-ranking-with-pre-trained","title":"Sparse Pairwise Re-ranking with Pre-trained Transformers","date":"2022-07-10","arxiv_id":"2207.04470","repositories_listed":1,"syntology":null},{"url":"/paper/hlatr-enhance-multi-stage-text-retrieval-with","title":"HLATR: Enhance Multi-stage Text Retrieval with Hybrid List Aware Transformer Reranking","date":"2022-05-21","arxiv_id":"2205.10569","repositories_listed":1,"syntology":null},{"url":"/paper/analysing-the-robustness-of-dual-encoders-for","title":"Analysing the Robustness of Dual Encoders for Dense Retrieval Against Misspellings","date":"2022-05-04","arxiv_id":"2205.02303","repositories_listed":1,"syntology":null},{"url":"/paper/text-and-code-embeddings-by-contrastive-pre","title":"Text and Code Embeddings by Contrastive Pre-Training","date":"2022-01-24","arxiv_id":"2201.10005","repositories_listed":1,"syntology":null},{"url":"/paper/mmarco-a-multilingual-version-of-ms-marco","title":"mMARCO: A Multilingual Version of the MS MARCO Passage Ranking Dataset","date":"2021-08-31","arxiv_id":"2108.13897","repositories_listed":1,"syntology":null},{"url":"/paper/on-approximate-nearest-neighbour-selection","title":"On Approximate Nearest Neighbour Selection for Multi-Stage Dense Retrieval","date":"2021-08-25","arxiv_id":"2108.11480","repositories_listed":1,"syntology":null},{"url":"/paper/query-embedding-pruning-for-dense-retrieval","title":"Query Embedding Pruning for Dense Retrieval","date":"2021-08-23","arxiv_id":"2108.10341","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-sentence-level-representations-for","title":"Exploiting Sentence-Level Representations for Passage Ranking","date":"2021-06-14","arxiv_id":"2106.07316","repositories_listed":1,"syntology":null},{"url":"/paper/a-wrong-answer-or-a-wrong-question-an","title":"A Wrong Answer or a Wrong Question? An Intricate Relationship between Question Reformulation and Answer Selection in Conversational Question Answering","date":"2020-10-13","arxiv_id":"2010.06835","repositories_listed":1,"syntology":null},{"url":"/paper/improving-efficient-neural-ranking-models","title":"Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation","date":"2020-10-06","arxiv_id":"2010.02666","repositories_listed":1,"syntology":null},{"url":"/paper/expansion-via-prediction-of-importance-with","title":"Expansion via Prediction of Importance with Contextualization","date":"2020-04-29","arxiv_id":"2004.14245","repositories_listed":1,"syntology":null}],"syntology_records":4,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}