{"url":"/task/reranking","name":"Reranking","slug":"reranking","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":586,"papers_with_code":216,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":[],"datasets":[{"url":"/dataset/claim-matching-robustness","name":"Claim Matching Robustness","full_name":"","num_papers_in_archive":1}],"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":216,"tagged_in_all":586,"items":[{"url":"/paper/mteb-massive-text-embedding-benchmark","title":"MTEB: Massive Text Embedding Benchmark","date":"2022-10-13","arxiv_id":"2210.07316","repositories_listed":5,"syntology":{"n":13,"n_ran":3,"n_unverified":10,"n_pointer_only":0}},{"url":"/paper/approximate-nearest-neighbor-negative","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","date":"2020-07-01","arxiv_id":"2007.00808","repositories_listed":5,"syntology":{"n":12,"n_ran":3,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/facebook-fairs-wmt19-news-translation-task","title":"Facebook FAIR's WMT19 News Translation Task Submission","date":"2019-07-15","arxiv_id":"1907.06616","repositories_listed":5,"syntology":{"n":9,"n_ran":1,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/the-expando-mono-duo-design-pattern-for-text","title":"The Expando-Mono-Duo Design Pattern for Text Ranking with Pretrained Sequence-to-Sequence Models","date":"2021-01-14","arxiv_id":"2101.05667","repositories_listed":4,"syntology":null},{"url":"/paper/math-shepherd-a-label-free-step-by-step","title":"Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotations","date":"2023-12-14","arxiv_id":"2312.08935","repositories_listed":3,"syntology":null},{"url":"/paper/rankvicuna-zero-shot-listwise-document","title":"RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Models","date":"2023-09-26","arxiv_id":"2309.15088","repositories_listed":3,"syntology":null},{"url":"/paper/cliff-contrastive-learning-for-improving","title":"CLIFF: Contrastive Learning for Improving Faithfulness and Factuality in Abstractive Summarization","date":"2021-09-19","arxiv_id":"2109.09209","repositories_listed":3,"syntology":null},{"url":"/paper/a-temporal-variational-model-for-story","title":"A Temporal Variational Model for Story Generation","date":"2021-09-14","arxiv_id":"2109.06807","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/faster-r-cnn-features-for-instance-search","title":"Faster R-CNN Features for Instance Search","date":"2016-04-29","arxiv_id":"1604.08893","repositories_listed":3,"syntology":null},{"url":"/paper/relevance-isn-t-all-you-need-scaling-rag","title":"Relevance Isn't All You Need: Scaling RAG Systems With Inference-Time Compute Via Multi-Criteria Reranking","date":"2025-03-14","arxiv_id":"2504.07104","repositories_listed":2,"syntology":null},{"url":"/paper/rank-r1-enhancing-reasoning-in-llm-based","title":"Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learning","date":"2025-03-08","arxiv_id":"2503.06034","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/benchmarking-retrieval-augmented-generation-1","title":"Benchmarking Retrieval-Augmented Generation in Multi-Modal Contexts","date":"2025-02-24","arxiv_id":"2502.17297","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-high-order-interaction-awareness-in","title":"Enhancing High-order Interaction Awareness in LLM-based Recommender Model","date":"2024-09-30","arxiv_id":"2409.19979","repositories_listed":2,"syntology":null},{"url":"/paper/2407-21439","title":"MLLM Is a Strong Reranker: Advancing Multimodal Retrieval-augmented Generation via Knowledge-enhanced Reranking and Noise-injected Training","date":"2024-07-31","arxiv_id":"2407.21439","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/self-retrieval-building-an-information","title":"Self-Retrieval: End-to-End Information Retrieval with One Large Language Model","date":"2024-02-23","arxiv_id":"2403.00801","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_unverified":2,"n_pointer_only":4}},{"url":"/paper/towards-trustworthy-reranking-a-simple-yet","title":"Towards Trustworthy Reranking: A Simple yet Effective Abstention Mechanism","date":"2024-02-20","arxiv_id":"2402.12997","repositories_listed":2,"syntology":{"n":12,"n_ran":7,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/scaling-down-litting-up-efficient-zero-shot","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","date":"2023-12-26","arxiv_id":"2312.16098","repositories_listed":2,"syntology":null},{"url":"/paper/rankzephyr-effective-and-robust-zero-shot","title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","date":"2023-12-05","arxiv_id":"2312.02724","repositories_listed":2,"syntology":null},{"url":"/paper/neural-rankers-for-code-generation-via-inter","title":"Functional Overlap Reranking for Neural Code Generation","date":"2023-10-16","arxiv_id":"2311.03366","repositories_listed":2,"syntology":null},{"url":"/paper/global-features-are-all-you-need-for-image","title":"Global Features are All You Need for Image Retrieval and Reranking","date":"2023-08-14","arxiv_id":"2308.06954","repositories_listed":2,"syntology":{"n":18,"n_ran":13,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/expand-rerank-and-retrieve-query-reranking","title":"Expand, Rerank, and Retrieve: Query Reranking for Open-Domain Question Answering","date":"2023-05-26","arxiv_id":"2305.17080","repositories_listed":2,"syntology":null},{"url":"/paper/candidate-set-re-ranking-for-composed-image","title":"Candidate Set Re-ranking for Composed Image Retrieval with Dual Multi-modal Encoder","date":"2023-05-25","arxiv_id":"2305.16304","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/contrastive-learning-of-sentence-embeddings","title":"Contrastive Learning of Sentence Embeddings from Scratch","date":"2023-05-24","arxiv_id":"2305.15077","repositories_listed":2,"syntology":{"n":6,"n_ran":2,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/explaining-patterns-in-data-with-language","title":"Explaining Patterns in Data with Language Models via Interpretable Autoprompting","date":"2022-10-04","arxiv_id":"2210.01848","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/lepus-prompt-based-unsupervised-multi-hop","title":"Few-shot Reranking for Multi-hop QA via Language Model Prompting","date":"2022-05-25","arxiv_id":"2205.12650","repositories_listed":2,"syntology":null},{"url":"/paper/glide-towards-photorealistic-image-generation","title":"GLIDE: Towards Photorealistic Image Generation and Editing with Text-Guided Diffusion Models","date":"2021-12-20","arxiv_id":"2112.10741","repositories_listed":2,"syntology":{"n":15,"n_ran":9,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/dynamic-hybrid-relation-network-for-cross","title":"Dynamic Hybrid Relation Network for Cross-Domain Context-Dependent Semantic Parsing","date":"2021-01-05","arxiv_id":"2101.01686","repositories_listed":2,"syntology":null},{"url":"/paper/deep-multi-query-image-retrieval","title":"Deep Multi Query Image Retrieval","date":"2020-08-12","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/cost-effective-interactive-attention-learning","title":"Cost-effective Interactive Attention Learning with Neural Attention Processes","date":"2020-06-09","arxiv_id":"2006.05419","repositories_listed":2,"syntology":null}],"syntology_records":13,"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"}}