{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/r2-d2-a-modular-baseline-for-open-domain","title":"R2-D2: A Modular Baseline for Open-Domain Question Answering","arxiv_id":"2109.03502","date":"2021-09-08","proceeding":"Findings (EMNLP) 2021 11","authors":["Martin Fajcik","Martin Docekal","Karel Ondrej","Pavel Smrz"],"abstract":"This work presents a novel four-stage open-domain QA pipeline R2-D2 (Rank twice, reaD twice). The pipeline is composed of a retriever, passage reranker, extractive reader, generative reader and a mechanism that aggregates the final prediction from all system's components. We demonstrate its strength across three open-domain QA datasets: NaturalQuestions, TriviaQA and EfficientQA, surpassing state-of-the-art on the first two. Our analysis demonstrates that: (i) combining extractive and generative reader yields absolute improvements up to 5 exact match and it is at least twice as effective as the posterior averaging ensemble of the same models with different parameters, (ii) the extractive reader with fewer parameters can match the performance of the generative reader on extractive QA datasets.","url_abs":"https://arxiv.org/abs/2109.03502v1","url_pdf":"https://arxiv.org/pdf/2109.03502v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"r2-d2-a-modular-baseline-for-open-domain","repo_url":"https://github.com/KNOT-FIT-BUT/R2-D2","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"open-domain-question-answering","task_name":"Open-Domain Question Answering"},{"task_slug":"passage-retrieval","task_name":"Passage Retrieval"},{"task_slug":"question-answering","task_name":"Question Answering"},{"task_slug":"triviaqa","task_name":"TriviaQA"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/open-domain-question-answering-on-natural","task":"Open-Domain Question Answering","dataset":"Natural Questions","model":"R2-D2 \\w HN-DPR","rank_in_archive_order":2,"of":5,"metrics":{"Exact Match":"55.9"},"uses_additional_data":false},{"leaderboard":"/sota/passage-retrieval-on-natural-questions","task":"Passage Retrieval","dataset":"Natural Questions","model":"DPR+ELECTRA-large-extreader-reranker","rank_in_archive_order":5,"of":10,"metrics":{"Precision@100":"88.25","Precision@20":"85.26"},"uses_additional_data":false},{"leaderboard":"/sota/passage-retrieval-on-natural-questions","task":"Passage Retrieval","dataset":"Natural Questions","model":"DPR+RoBERTa-base-crossencoder-reranker","rank_in_archive_order":6,"of":10,"metrics":{"Precision@100":"88.03","Precision@20":"84.46"},"uses_additional_data":false},{"leaderboard":"/sota/question-answering-on-natural-questions","task":"Question Answering","dataset":"Natural Questions","model":"R2-D2 (full)","rank_in_archive_order":5,"of":47,"metrics":{"EM":"55.9"},"uses_additional_data":false},{"leaderboard":"/sota/question-answering-on-natural-questions-long","task":"Question Answering","dataset":"Natural Questions (long)","model":"R2-D2 \\w HN-DPR","rank_in_archive_order":10,"of":13,"metrics":{"EM":"55.9"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2109.03502","atlas_url":"https://app.syntology.ai/?focus=2109.03502","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2109.03502"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2109.03502\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2109.03502"},"call":"get_concepts_for_paper(arxiv_id=\"2109.03502\")"}],"by_repo":[{"repo":"KNOT-FIT-BUT/R2-D2","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2102.10697"],"harvested_for_calls":[{"arxiv_id":"2102.10697","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2102.10697"},"call":"get_harvested_code_for_paper(arxiv_id=\"2102.10697\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"3de111c4d1456e35f7d76ddb6853762ecbd7aebec0c8244975945df9fa6bd196","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}