{"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/eliminet-a-model-for-eliminating-options-for-1","title":"ElimiNet: A Model for Eliminating Options for Reading Comprehension with Multiple Choice Questions","arxiv_id":"1904.02651","date":"2019-04-04","proceeding":"ICLR 2018 1","authors":["Soham Parikh","Ananya B. Sai","Preksha Nema","Mitesh M. Khapra"],"abstract":"The task of Reading Comprehension with Multiple Choice Questions, requires a\nhuman (or machine) to read a given passage, question pair and select one of the\nn given options. The current state of the art model for this task first\ncomputes a question-aware representation for the passage and then selects the\noption which has the maximum similarity with this representation. However, when\nhumans perform this task they do not just focus on option selection but use a\ncombination of elimination and selection. Specifically, a human would first try\nto eliminate the most irrelevant option and then read the passage again in the\nlight of this new information (and perhaps ignore portions corresponding to the\neliminated option). This process could be repeated multiple times till the\nreader is finally ready to select the correct option. We propose ElimiNet, a\nneural network-based model which tries to mimic this process. Specifically, it\nhas gates which decide whether an option can be eliminated given the passage,\nquestion pair and if so it tries to make the passage representation orthogonal\nto this eliminated option (akin to ignoring portions of the passage\ncorresponding to the eliminated option). The model makes multiple rounds of\npartial elimination to refine the passage representation and finally uses a\nselection module to pick the best option. We evaluate our model on the recently\nreleased large scale RACE dataset and show that it outperforms the current\nstate of the art model on 7 out of the $13$ question types in this dataset.\nFurther, we show that taking an ensemble of our elimination-selection based\nmethod with a selection based method gives us an improvement of 3.1% over the\nbest-reported performance on this dataset.","url_abs":"http://arxiv.org/abs/1904.02651v1","url_pdf":"http://arxiv.org/pdf/1904.02651v1.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":"eliminet-a-model-for-eliminating-options-for-1","repo_url":"https://github.com/sohamparikh94/ElimiNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"multiple-choice","task_name":"Multiple-choice"},{"task_slug":"reading-comprehension","task_name":"Reading Comprehension"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"sohamparikh94/ElimiNet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"062ca7bceff7faa40db7533e8cedbe1c158c4a019a87785f005c9a477af37af4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}