{"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/large-language-models-are-versatile","title":"Large Language Models are Versatile Decomposers: Decompose Evidence and Questions for Table-based Reasoning","arxiv_id":"2301.13808","date":"2023-01-31","proceeding":null,"authors":["Yunhu Ye","Binyuan Hui","Min Yang","Binhua Li","Fei Huang","Yongbin Li"],"abstract":"Table-based reasoning has shown remarkable progress in combining deep models with discrete reasoning, which requires reasoning over both free-form natural language (NL) questions and structured tabular data. However, previous table-based reasoning solutions usually suffer from significant performance degradation on huge evidence (tables). In addition, most existing methods struggle to reason over complex questions since the required information is scattered in different places. To alleviate the above challenges, we exploit large language models (LLMs) as decomposers for effective table-based reasoning, which (i) decompose huge evidence (a huge table) into sub-evidence (a small table) to mitigate the interference of useless information for table reasoning; and (ii) decompose complex questions into simpler sub-questions for text reasoning. Specifically, we first use the LLMs to break down the evidence (tables) involved in the current question, retaining the relevant evidence and excluding the remaining irrelevant evidence from the huge table. In addition, we propose a \"parsing-execution-filling\" strategy to alleviate the hallucination dilemma of the chain of thought by decoupling logic and numerical computation in each step. Extensive experiments show that our method can effectively leverage decomposed evidence and questions and outperforms the strong baselines on TabFact, WikiTableQuestion, and FetaQA datasets. Notably, our model outperforms human performance for the first time on the TabFact dataset.","url_abs":"https://arxiv.org/abs/2301.13808v3","url_pdf":"https://arxiv.org/pdf/2301.13808v3.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":"large-language-models-are-versatile","repo_url":"https://github.com/alibabaresearch/damo-convai","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"large-language-models-are-versatile","repo_url":"https://github.com/google-research/chain-of-table","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"hallucination","task_name":"Hallucination"},{"task_slug":"semantic-parsing","task_name":"Semantic Parsing"},{"task_slug":"table-based-fact-verification","task_name":"Table-based Fact Verification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/semantic-parsing-on-wikitablequestions","task":"Semantic Parsing","dataset":"WikiTableQuestions","model":"Dater","rank_in_archive_order":10,"of":22,"metrics":{"Accuracy (Dev)":"64.8","Accuracy (Test)":"65.9"},"uses_additional_data":false},{"leaderboard":"/sota/table-based-fact-verification-on-tabfact","task":"Table-based Fact Verification","dataset":"TabFact","model":"Dater","rank_in_archive_order":2,"of":15,"metrics":{"Test":"93.0"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2301.13808","atlas_url":"https://app.syntology.ai/?focus=2301.13808","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":"2301.13808"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2301.13808\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2301.13808"},"call":"get_concepts_for_paper(arxiv_id=\"2301.13808\")"}],"by_repo":[{"repo":"alibabaresearch/damo-convai","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["2210.15332","2305.14839","2501.01821"],"harvested_for_calls":[{"arxiv_id":"2210.15332","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.15332"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.15332\")"},{"arxiv_id":"2305.14839","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.14839"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.14839\")"},{"arxiv_id":"2501.01821","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2501.01821"},"call":"get_harvested_code_for_paper(arxiv_id=\"2501.01821\")"}]},{"repo":"google-research/chain-of-table","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2401.04398"],"harvested_for_calls":[{"arxiv_id":"2401.04398","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2401.04398"},"call":"get_harvested_code_for_paper(arxiv_id=\"2401.04398\")"}]}],"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":"d5265d29d367a57fa7b0c8e1aa351a8c8bb5b3a0ac5a4ca094a96be2d4036b66","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}