{"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/fine-tuning-language-models-with-just-forward-1","title":"Fine-Tuning Language Models with Just Forward Passes","arxiv_id":"2305.17333","date":"2023-05-27","proceeding":"NeurIPS 2023 11","authors":["Sadhika Malladi","Tianyu Gao","Eshaan Nichani","Alex Damian","Jason D. Lee","Danqi Chen","Sanjeev Arora"],"abstract":"Fine-tuning language models (LMs) has yielded success on diverse downstream tasks, but as LMs grow in size, backpropagation requires a prohibitively large amount of memory. Zeroth-order (ZO) methods can in principle estimate gradients using only two forward passes but are theorized to be catastrophically slow for optimizing large models. In this work, we propose a memory-efficient zerothorder optimizer (MeZO), adapting the classical ZO-SGD method to operate in-place, thereby fine-tuning LMs with the same memory footprint as inference. For example, with a single A100 80GB GPU, MeZO can train a 30-billion parameter model, whereas fine-tuning with backpropagation can train only a 2.7B LM with the same budget. We conduct comprehensive experiments across model types (masked and autoregressive LMs), model scales (up to 66B), and downstream tasks (classification, multiple-choice, and generation). Our results demonstrate that (1) MeZO significantly outperforms in-context learning and linear probing; (2) MeZO achieves comparable performance to fine-tuning with backpropagation across multiple tasks, with up to 12x memory reduction and up to 2x GPU-hour reduction in our implementation; (3) MeZO is compatible with both full-parameter and parameter-efficient tuning techniques such as LoRA and prefix tuning; (4) MeZO can effectively optimize non-differentiable objectives (e.g., maximizing accuracy or F1). We support our empirical findings with theoretical insights, highlighting how adequate pre-training and task prompts enable MeZO to fine-tune huge models, despite classical ZO analyses suggesting otherwise.","url_abs":"https://arxiv.org/abs/2305.17333v3","url_pdf":"https://arxiv.org/pdf/2305.17333v3.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":"fine-tuning-language-models-with-just-forward-1","repo_url":"https://github.com/princeton-nlp/mezo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"fine-tuning-language-models-with-just-forward-1","repo_url":"https://github.com/liangyuwang/zo2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"fine-tuning-language-models-with-just-forward-1","repo_url":"https://github.com/mathisall/zo-adamu","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"task_slug":"in-context-learning","task_name":"In-Context Learning"},{"task_slug":"multiple-choice","task_name":"Multiple-choice"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.17333","atlas_url":"https://app.syntology.ai/?focus=2305.17333","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17333"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.17333"},"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_reference_implementation","arguments":{"name":"MeZO"},"call":"get_reference_implementation(name='MeZO')","min_level":{"quoted_from_server_card":["It REFUSES rather than serving below min_level, and the refusal names the highest level that exists","so lowering min_level is a deliberate, informed choice, not a guess."],"default_on_card":2,"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","this_implementation_level":3}},{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.17333"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.17333\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2305.17333"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2305.17333\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2305.17333"},"call":"get_concepts_for_paper(arxiv_id=\"2305.17333\")"}],"reference_implementation":[{"method_name":"MeZO","assembly_sha256":"a400ef65a576e491","source":"generated from the paper text (not the authors' code)","level":3,"level_is_quoted_from_server_card":[{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","v3_tests_passed_both_sides":0,"level_3_note":"level 3 is recorded, but its report lists no property test that passed on both","no_rung":"No rung compares this code against the authors' implementation","no_rung_quoted_from_server_card":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.","retrieve_with":"get_reference_implementation(name='MeZO')","have_check":{"url":"https://syntology.ai/api/graph/have?x=2305.17333","call":"have('2305.17333')","in_build_sample":false}}],"reference_implementation_is":"Syntology's reference implementation of this paper's method: code Syntology generated from the paper text (not the authors' code), at the level its own end-to-end run recorded (the assembly's own level, never averaged); the level's meaning is quoted from Syntology's server card, and nothing here says the code is correct or reproduces the paper's results","by_repo":[{"repo":"princeton-nlp/mezo","kind":"official","samples":14,"ran":8,"instrument":4,"unverified":6},{"repo":"liangyuwang/zo2","kind":"listed","samples":3,"ran":2,"instrument":0,"unverified":1},{"repo":"mathisall/zo-adamu","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2312.15184"],"harvested_for_calls":[{"arxiv_id":"2312.15184","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2312.15184"},"call":"get_harvested_code_for_paper(arxiv_id=\"2312.15184\")"}]}],"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","assemblies":[{"assembly_sha256":"a400ef65a576e491","source_kind":"generated","method_name":"MeZO","realizes_method":"MeZO","graph_method":"MeZO","realizes_severed":false,"claim":"Compute the MeZO (Memory-efficient Zeroth-order) parameter update for a single optimization step. Given current parameters theta (1D array of length d), forward loss loss_plus (scalar float), backward loss loss_minus (scalar float), perturbation scale epsilon (positive scalar), learning rate eta (po","centrality":"contribution","entry":"mezo_parameter_update","entry_sha256":"1d20da6c842d026dce8f87d5635c59c8b4802b16176a2f1f32fc99f49b31c7f7","n_bricks":1,"bricks":[{"entry":"mezo_parameter_update","code_sha256":"1d20da6c842d026dce8f87d5635c59c8b4802b16176a2f1f32fc99f49b31c7f7","role":"entry","order":0,"level":3,"status":"ran_honours"}],"ran_individually":1,"ran_individually_constructed":null,"ran_individually_by_status":{"ran_honours":1},"end_to_end":{"ran":true,"level":3,"against_independent_peer":true,"n_peers":1,"v3_tests_passed_both_sides":0,"means":"this assembly is a single routine, so the entry brick's verification IS the assembly's: it executed and two family-independent implementations agreed"},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"construction","claim_match_judges":["construction:spec_drafted_for_this_method"],"label_verdict":"matches","label_verdict_judged":false,"suggested_method":null,"batch_at":"2026-09-07T20:44:12+00:00","sibling_group":"0f6abaebefde","n_siblings":0,"retention":"keep","provenance":"assembly:generated_reference_impl_v1","attached_at":"2026-09-07T20:44:12+00:00","attached_provenance":"assembly:generated_reference_impl_v1"},{"assembly_sha256":"3b012f9109d95266","source_kind":"harvested","method_name":"MeZO","realizes_method":"MeZO","graph_method":"MeZO","realizes_severed":false,"claim":"This code implements the MeZO (Memory-efficient Zeroth-Order) optimization method, which fine-tunes language models using only forward passes to estimate gradients, avoiding the memory overhead of backpropagation.","centrality":"contribution","entry":"MeZOSGD","entry_sha256":"f9a6c1b932010ab6","n_bricks":3,"bricks":[{"entry":"MeZOSGD","code_sha256":"f9a6c1b932010ab6","role":"entry","order":0,"level":1,"status":"ran"},{"entry":"BaseOptimizer","code_sha256":"506b0c89834f1424","role":"helper","order":1,"level":1,"status":"ran"},{"entry":"MeZOSGDConfig","code_sha256":"00b3e776ab20cb69","role":"helper","order":2,"level":0,"status":"unverified"}],"ran_individually":2,"ran_individually_constructed":2,"ran_individually_by_status":{"ran":2},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"f7459a0794e7","n_siblings":0,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"0f6abaebefde","realizes_method":"MeZO","source_kind":"generated","batch_at":"2026-09-07T20:44:12+00:00","members":["a400ef65a576e491"]},{"group":"f7459a0794e7","realizes_method":"MeZO","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["3b012f9109d95266"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2305.17333"},"call":"assembly(arxiv_id=\"2305.17333\")"},"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/2305.17333.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/2305.17333.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/princeton-nlp/mezo","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/liangyuwang/zo2","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mathisall/zo-adamu","reach":{"status":"ok"}}],"summary":{"ran":5,"ran_honours":1,"ran_draft_wrong":4,"unverified":7},"n_samples":17,"n_ran":10,"n_constructed":2,"n_ran_checked":6,"n_instrument":4,"n_unverified":7,"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":{"official":{"samples":14,"ran":8,"n_ran_checked":4,"n_instrument":4,"repositories":1},"listed":{"samples":3,"ran":2,"n_ran_checked":2,"n_instrument":0,"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":4,"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":4,"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":9,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-26","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":"506b0c89834f1424","code_sha256_prefix":"506b0c89834f1424","entry":"BaseOptimizer","repo":"liangyuwang/zo2","repo_kind":"listed","path":"zo2/optimizer/mezo_sgd/zo.py","file_url":"https://github.com/liangyuwang/zo2/blob/HEAD/zo2/optimizer/mezo_sgd/zo.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"BaseOptimizer","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"506b0c89834f1424"}},{"code_sha256":"f9a6c1b932010ab6","code_sha256_prefix":"f9a6c1b932010ab6","entry":"MeZOSGD","repo":"liangyuwang/zo2","repo_kind":"listed","path":"zo2/optimizer/mezo_sgd/zo.py","file_url":"https://github.com/liangyuwang/zo2/blob/HEAD/zo2/optimizer/mezo_sgd/zo.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"fixture_out_type":"MeZOSGD","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f9a6c1b932010ab6"}},{"code_sha256":"7c5d9ba063f6642c","code_sha256_prefix":"7c5d9ba063f6642c","entry":"encode_prompt","repo":"princeton-nlp/mezo","repo_kind":"official","path":"large_models/utils.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/utils.py","link_basis":"plan_row","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"task:Task/0/?, template:Template/0/?, train_samples:list/1/Sample, eval_sample:Sample/0/?, tokenizer:Tokenizer/0/?, max_length:int/0/int, sfc:bool/0/bool, icl_sfc:bool/0/bool, generation:bool/0/bool, generation_with_gold:bool/0/bool, max_new_tokens:NoneType/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/encode-prompt","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from mathisall/zo-adamu, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"7c5d9ba063f6642c"}},{"code_sha256":"b989d4bce26f77ce","code_sha256_prefix":"b989d4bce26f77ce","entry":"f1","repo":"princeton-nlp/mezo","repo_kind":"official","path":"large_models/metrics.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/metrics.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"pred:str/0/str, gold:list/1/str","fixture_out_type":"float64","level_recorded_at":"2026-09-26T03:58:20.443611+00:00","code_page":"/code/f1","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b989d4bce26f77ce"}},{"code_sha256":"b5adfd6ac99a1b18","code_sha256_prefix":"b5adfd6ac99a1b18","entry":"find_module","repo":"princeton-nlp/mezo","repo_kind":"official","path":"large_models/lora.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/lora.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"root_module:callable/0/?, key:str/0/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/find-module","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from JingXuTHU/Random-Masking-Finds-Winning-Tickets-for-Parameter-Efficient-Fine-tuning, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"b5adfd6ac99a1b18"}},{"code_sha256":"54a6124d697bc2c2","code_sha256_prefix":"54a6124d697bc2c2","entry":"forward_wrap_with_option_len","repo":"princeton-nlp/mezo","repo_kind":"official","path":"large_models/utils.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/utils.py","link_basis":"plan_row","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"self:callable/0/?, input_ids:Tensor/2/int, labels:Tensor/2/int, option_len:list/1/int, num_options:list/1/int, return_dict:bool/0/bool","fixture_out_type":"CausalLMOutputWithPast","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/forward-wrap-with-option-len","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from mathisall/zo-adamu, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"54a6124d697bc2c2"}},{"code_sha256":"e768e25ca95f70cd","code_sha256_prefix":"e768e25ca95f70cd","entry":"input_example_to_string","repo":"princeton-nlp/mezo","repo_kind":"official","path":"medium_models/src/dataset.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/medium_models/src/dataset.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"example:Example/0/?, sep_token:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/input-example-to-string","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e768e25ca95f70cd"}},{"code_sha256":"fbef70dc7c700501","code_sha256_prefix":"fbef70dc7c700501","entry":"input_example_to_tuple","repo":"princeton-nlp/mezo","repo_kind":"official","path":"medium_models/src/dataset.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/medium_models/src/dataset.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"example:Example/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/input-example-to-tuple","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fbef70dc7c700501"}},{"code_sha256":"e7e75981cb464788","code_sha256_prefix":"e7e75981cb464788","entry":"normalize_answer","repo":"princeton-nlp/mezo","repo_kind":"official","path":"large_models/metrics.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/metrics.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"s:str/0/str","fixture_out_type":"str","retrieve_with":{"tool":"get_code","code_sha256":"e7e75981cb464788"},"code_page":"/code/normalize-answer","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from borealisai/radar-decoding, and LGPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","mcp_get_code":{"code_sha256":"e7e75981cb464788"}},{"code_sha256":"9a62fa939fc563a4","code_sha256_prefix":"9a62fa939fc563a4","entry":"tokenize_multipart_input","repo":"princeton-nlp/mezo","repo_kind":"official","path":"medium_models/src/dataset.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/medium_models/src/dataset.py","link_basis":"plan_row","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"input_text_list:list/1/str, max_length:int/0/int, tokenizer:BertTokenizer/0/?, task_name:str/0/str, prompt:bool/0/bool, template:NoneType/0/?, label_word_list:NoneType/0/?, first_sent_limit:NoneType/0/?, other_sent_limit:NoneType/0/?, gpt3:bool/0/bool, truncate_head:bool/0/bool, support_labels:NoneType/0/?","fixture_out_type":"dict","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/tokenize-multipart-input","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9a62fa939fc563a4"}},{"code_sha256":"00b3e776ab20cb69","code_sha256_prefix":"00b3e776ab20cb69","entry":"MeZOSGDConfig","repo":"liangyuwang/zo2","repo_kind":"listed","path":"zo2/optimizer/mezo_sgd/zo.py","file_url":"https://github.com/liangyuwang/zo2/blob/HEAD/zo2/optimizer/mezo_sgd/zo.py","link_basis":"first_harvest_node","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":"00b3e776ab20cb69"}},{"code_sha256":"bdb460cb247501dc","code_sha256_prefix":"bdb460cb247501dc","entry":"attn_forward_hook","repo":"princeton-nlp/mezo","repo_kind":"official","path":"large_models/prefix.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/prefix.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/attn-forward-hook","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bdb460cb247501dc"}},{"code_sha256":"84c658f2c9252878","code_sha256_prefix":"84c658f2c9252878","entry":"calculate_metric","repo":"princeton-nlp/mezo","repo_kind":"official","path":"large_models/metrics.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/metrics.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/calculate-metric","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"84c658f2c9252878"}},{"code_sha256":"f7c384f1e681ea7a","code_sha256_prefix":"f7c384f1e681ea7a","entry":"get_task","repo":"princeton-nlp/mezo","repo_kind":"official","path":"large_models/tasks.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/tasks.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/get-task","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f7c384f1e681ea7a"}},{"code_sha256":"84920a8095dca4fa","code_sha256_prefix":"84920a8095dca4fa","entry":"prepare_inputs_for_generation","repo":"princeton-nlp/mezo","repo_kind":"official","path":"large_models/prefix.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/prefix.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/prepare-inputs-for-generation","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"84920a8095dca4fa"}},{"code_sha256":"c239cb1add74b809","code_sha256_prefix":"c239cb1add74b809","entry":"tensor_all_gather","repo":"princeton-nlp/mezo","repo_kind":"official","path":"medium_models/src/linearhead_trainer.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/medium_models/src/linearhead_trainer.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c239cb1add74b809"}},{"code_sha256":"734d0491ecbc7841","code_sha256_prefix":"734d0491ecbc7841","entry":"varsize_tensor_all_gather","repo":"princeton-nlp/mezo","repo_kind":"official","path":"medium_models/src/linearhead_trainer.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/medium_models/src/linearhead_trainer.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"734d0491ecbc7841"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"606f7503cc1fd08f35aca26000d106c0fd22c0b61eadc53a45b8597819016b28","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}