{"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/2408-03314","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","arxiv_id":"2408.03314","date":"2024-08-06","proceeding":null,"authors":["Charlie Snell","Jaehoon Lee","Kelvin Xu","Aviral Kumar"],"abstract":"Enabling LLMs to improve their outputs by using more test-time computation is a critical step towards building generally self-improving agents that can operate on open-ended natural language. In this paper, we study the scaling of inference-time computation in LLMs, with a focus on answering the question: if an LLM is allowed to use a fixed but non-trivial amount of inference-time compute, how much can it improve its performance on a challenging prompt? Answering this question has implications not only on the achievable performance of LLMs, but also on the future of LLM pretraining and how one should tradeoff inference-time and pre-training compute. Despite its importance, little research attempted to understand the scaling behaviors of various test-time inference methods. Moreover, current work largely provides negative results for a number of these strategies. In this work, we analyze two primary mechanisms to scale test-time computation: (1) searching against dense, process-based verifier reward models; and (2) updating the model's distribution over a response adaptively, given the prompt at test time. We find that in both cases, the effectiveness of different approaches to scaling test-time compute critically varies depending on the difficulty of the prompt. This observation motivates applying a \"compute-optimal\" scaling strategy, which acts to most effectively allocate test-time compute adaptively per prompt. Using this compute-optimal strategy, we can improve the efficiency of test-time compute scaling by more than 4x compared to a best-of-N baseline. Additionally, in a FLOPs-matched evaluation, we find that on problems where a smaller base model attains somewhat non-trivial success rates, test-time compute can be used to outperform a 14x larger model.","url_abs":"https://arxiv.org/abs/2408.03314v1","url_pdf":"https://arxiv.org/pdf/2408.03314v1.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":"2408-03314","repo_url":"https://github.com/huggingface/search-and-learn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"2408-03314","repo_url":"https://github.com/zarahall/fairness-prms","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"2408-03314","repo_url":"https://github.com/codelion/optillm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[],"methods":[{"method_slug":"base","method_name":"BASE"},{"method_slug":"focus","method_name":"Focus"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2408.03314","atlas_url":"https://app.syntology.ai/?focus=2408.03314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03314"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2408.03314"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2408.03314"},"call":"get_harvested_code_for_paper(arxiv_id=\"2408.03314\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2408.03314"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2408.03314\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2408.03314"},"call":"get_concepts_for_paper(arxiv_id=\"2408.03314\")"}],"by_repo":[{"repo":"huggingface/search-and-learn","kind":"listed","samples":9,"ran":6,"instrument":1,"unverified":3},{"repo":"zarahall/fairness-prms","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"codelion/optillm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["2203.11171","2305.10601","2402.08699"],"harvested_for_calls":[{"arxiv_id":"2203.11171","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.11171"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.11171\")"},{"arxiv_id":"2305.10601","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.10601"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.10601\")"},{"arxiv_id":"2402.08699","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.08699"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.08699\")"}]}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2408.03314.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2408.03314.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/codelion/optillm","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/huggingface/search-and-learn","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zarahall/fairness-prms","reach":{"status":"ok"}}],"summary":{"ran":5,"ran_draft_wrong":1,"unverified":3},"n_samples":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"listed":{"samples":9,"ran":6,"n_ran_checked":5,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":8,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":8,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":6,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-25","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"e2fa8778aaa14477","code_sha256_prefix":"e2fa8778aaa14477","entry":"aggregate_scores","repo":"huggingface/search-and-learn","repo_kind":"listed","path":"src/sal/utils/score.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/utils/score.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"scores:list/1/float, agg_strategy:str/0/str","fixture_out_type":"float","level_recorded_at":"2026-09-25T00:28:05.031210+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hmarkc/VG-Search, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","mcp_get_code":{"code_sha256":"e2fa8778aaa14477"}},{"code_sha256":"fcb58cf3620ba3fa","code_sha256_prefix":"fcb58cf3620ba3fa","entry":"build_conv","repo":"huggingface/search-and-learn","repo_kind":"listed","path":"src/sal/search/utils.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/search/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"prompt:str/0/str, response:str/0/str, system_prompt:str/0/str","fixture_out_type":"list","level_recorded_at":"2026-09-25T04:30:57.282821+00:00","retrieve_with":{"tool":"get_code","code_sha256":"fcb58cf3620ba3fa"},"code_page":"/code/build-conv","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hmarkc/VG-Search, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","mcp_get_code":{"code_sha256":"fcb58cf3620ba3fa"}},{"code_sha256":"ed2f4689128f9885","code_sha256_prefix":"ed2f4689128f9885","entry":"extract_multi_choice_answer","repo":"huggingface/search-and-learn","repo_kind":"listed","path":"src/sal/utils/qwen_math_parser.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/utils/qwen_math_parser.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"pred_str:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-25T04:30:57.282821+00:00","retrieve_with":{"tool":"get_code","code_sha256":"ed2f4689128f9885"},"code_page":"/code/extract-multi-choice-answer","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from QwenLM/Qwen2.5-Math, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"code_sha256":"0a2729199ea72cd2","code_sha256_prefix":"0a2729199ea72cd2","entry":"last","repo":"huggingface/search-and-learn","repo_kind":"listed","path":"src/sal/search/utils.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/search/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:list/1/int","fixture_out_type":"int","level_recorded_at":"2026-09-25T02:59:38.627214+00:00","retrieve_with":{"tool":"get_code","code_sha256":"0a2729199ea72cd2"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hmarkc/VG-Search, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","mcp_get_code":{"code_sha256":"0a2729199ea72cd2"}},{"code_sha256":"e1583186b85bad63","code_sha256_prefix":"e1583186b85bad63","entry":"list_mean","repo":"huggingface/search-and-learn","repo_kind":"listed","path":"src/sal/search/utils.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/search/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:list/1/float","fixture_out_type":"float64","level_recorded_at":"2026-09-25T04:00:33.621019+00:00","retrieve_with":{"tool":"get_code","code_sha256":"e1583186b85bad63"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hmarkc/VG-Search, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","mcp_get_code":{"code_sha256":"e1583186b85bad63"}},{"code_sha256":"940f44544351a853","code_sha256_prefix":"940f44544351a853","entry":"subsample_completions","repo":"huggingface/search-and-learn","repo_kind":"listed","path":"src/sal/utils/math.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/utils/math.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"x:dict/0/?, n:int/0/int","fixture_out_type":"dict","level_recorded_at":"2026-09-25T00:28:05.031210+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hmarkc/VG-Search, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","mcp_get_code":{"code_sha256":"940f44544351a853"}},{"code_sha256":"0f5e24b2cb4f615b","code_sha256_prefix":"0f5e24b2cb4f615b","entry":"batched_math_shepherd_inference","repo":"huggingface/search-and-learn","repo_kind":"listed","path":"src/sal/models/reward_models.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/models/reward_models.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0f5e24b2cb4f615b"}},{"code_sha256":"3c4ade317b7b432b","code_sha256_prefix":"3c4ade317b7b432b","entry":"extract_completion_answers","repo":"huggingface/search-and-learn","repo_kind":"listed","path":"src/sal/utils/math.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/utils/math.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hmarkc/VG-Search, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","mcp_get_code":{"code_sha256":"3c4ade317b7b432b"}},{"code_sha256":"07e55a87bf057096","code_sha256_prefix":"07e55a87bf057096","entry":"get_dataset_revisions","repo":"huggingface/search-and-learn","repo_kind":"listed","path":"src/sal/utils/hub.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/utils/hub.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hmarkc/VG-Search, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","mcp_get_code":{"code_sha256":"07e55a87bf057096"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f15a0cbf9056ef4a6ae5c4c643f21a612e572d21c3dab084a735b4a17865be48","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}