{"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/challenging-big-bench-tasks-and-whether-chain","title":"Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Them","arxiv_id":"2210.09261","date":"2022-10-17","proceeding":null,"authors":["Mirac Suzgun","Nathan Scales","Nathanael Schärli","Sebastian Gehrmann","Yi Tay","Hyung Won Chung","Aakanksha Chowdhery","Quoc V. Le","Ed H. Chi","Denny Zhou","Jason Wei"],"abstract":"BIG-Bench (Srivastava et al., 2022) is a diverse evaluation suite that focuses on tasks believed to be beyond the capabilities of current language models. Language models have already made good progress on this benchmark, with the best model in the BIG-Bench paper outperforming average reported human-rater results on 65% of the BIG-Bench tasks via few-shot prompting. But on what tasks do language models fall short of average human-rater performance, and are those tasks actually unsolvable by current language models? In this work, we focus on a suite of 23 challenging BIG-Bench tasks which we call BIG-Bench Hard (BBH). These are the task for which prior language model evaluations did not outperform the average human-rater. We find that applying chain-of-thought (CoT) prompting to BBH tasks enables PaLM to surpass the average human-rater performance on 10 of the 23 tasks, and Codex (code-davinci-002) to surpass the average human-rater performance on 17 of the 23 tasks. Since many tasks in BBH require multi-step reasoning, few-shot prompting without CoT, as done in the BIG-Bench evaluations (Srivastava et al., 2022), substantially underestimates the best performance and capabilities of language models, which is better captured via CoT prompting. As further analysis, we explore the interaction between CoT and model scale on BBH, finding that CoT enables emergent task performance on several BBH tasks with otherwise flat scaling curves.","url_abs":"https://arxiv.org/abs/2210.09261v1","url_pdf":"https://arxiv.org/pdf/2210.09261v1.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":"challenging-big-bench-tasks-and-whether-chain","repo_url":"https://github.com/suzgunmirac/big-bench-hard","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"challenging-big-bench-tasks-and-whether-chain","repo_url":"https://github.com/ArmelRandy/tree-of-problems","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"challenging-big-bench-tasks-and-whether-chain","repo_url":"https://github.com/yangling0818/buffer-of-thought-llm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"language-modelling","task_name":"Language Modelling"}],"methods":[{"method_slug":"palm","method_name":"PaLM"}],"datasets_introduced":[{"slug":"bbh","name":"BBH","full_name":"BIG-Bench Hard"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2210.09261","atlas_url":"https://app.syntology.ai/?focus=2210.09261","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":"2210.09261"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2210.09261\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2210.09261"},"call":"get_concepts_for_paper(arxiv_id=\"2210.09261\")"}],"by_repo":[{"repo":"suzgunmirac/big-bench-hard","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ArmelRandy/tree-of-problems","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2410.06634"],"harvested_for_calls":[{"arxiv_id":"2410.06634","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2410.06634"},"call":"get_harvested_code_for_paper(arxiv_id=\"2410.06634\")"}]},{"repo":"yangling0818/buffer-of-thought-llm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2406.04271","2506.18896"],"harvested_for_calls":[{"arxiv_id":"2406.04271","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.04271"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.04271\")"},{"arxiv_id":"2506.18896","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2506.18896"},"call":"get_harvested_code_for_paper(arxiv_id=\"2506.18896\")"}]}],"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":"02041d4218fbb21c2c0fac7e5a47659c6e29c8078dbd5cc9097cd17a33f46484","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}