{"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/sophia-a-scalable-stochastic-second-order","title":"Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-training","arxiv_id":"2305.14342","date":"2023-05-23","proceeding":null,"authors":["Hong Liu","Zhiyuan Li","David Hall","Percy Liang","Tengyu Ma"],"abstract":"Given the massive cost of language model pre-training, a non-trivial improvement of the optimization algorithm would lead to a material reduction on the time and cost of training. Adam and its variants have been state-of-the-art for years, and more sophisticated second-order (Hessian-based) optimizers often incur too much per-step overhead. In this paper, we propose Sophia, Second-order Clipped Stochastic Optimization, a simple scalable second-order optimizer that uses a light-weight estimate of the diagonal Hessian as the pre-conditioner. The update is the moving average of the gradients divided by the moving average of the estimated Hessian, followed by element-wise clipping. The clipping controls the worst-case update size and tames the negative impact of non-convexity and rapid change of Hessian along the trajectory. Sophia only estimates the diagonal Hessian every handful of iterations, which has negligible average per-step time and memory overhead. On language modeling with GPT models of sizes ranging from 125M to 1.5B, Sophia achieves a 2x speed-up compared to Adam in the number of steps, total compute, and wall-clock time, achieving the same perplexity with 50% fewer steps, less total compute, and reduced wall-clock time. Theoretically, we show that Sophia, in a much simplified setting, adapts to the heterogeneous curvatures in different parameter dimensions, and thus has a run-time bound that does not depend on the condition number of the loss.","url_abs":"https://arxiv.org/abs/2305.14342v4","url_pdf":"https://arxiv.org/pdf/2305.14342v4.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":"sophia-a-scalable-stochastic-second-order","repo_url":"https://github.com/stanford-crfm/levanter","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"sophia-a-scalable-stochastic-second-order","repo_url":"https://github.com/Liuhong99/Sophia","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"sophia-a-scalable-stochastic-second-order","repo_url":"https://github.com/cor3bit/somax","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":null},{"paper_slug":"sophia-a-scalable-stochastic-second-order","repo_url":"https://github.com/helw150/levanter","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"sophia-a-scalable-stochastic-second-order","repo_url":"https://github.com/kyegomez/Sophia","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"sophia-a-scalable-stochastic-second-order","repo_url":"https://github.com/MindSpore-scientific/code-2/tree/main/stochastic-attention-head-removal-a-simple","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"sophia-a-scalable-stochastic-second-order","repo_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"attention-dropout","method_name":"Attention Dropout"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"cosine-annealing","method_name":"Cosine Annealing"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"discriminative-fine-tuning","method_name":"Discriminative Fine-Tuning"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"gpt","method_name":"GPT"},{"method_slug":"gpt-2","method_name":"GPT-2"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"linear-warmup-with-cosine-annealing","method_name":"Linear Warmup With Cosine Annealing"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"sophia","method_name":"Sophia"},{"method_slug":"weight-decay","method_name":"Weight Decay"}],"datasets_introduced":[],"methods_introduced":[{"slug":"sophia","name":"Sophia","full_name":"Second-order Clipped Stochastic Optimization"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.14342","atlas_url":"https://app.syntology.ai/?focus=2305.14342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14342"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.14342"},"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":"2305.14342"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.14342\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2305.14342"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2305.14342\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2305.14342"},"call":"get_concepts_for_paper(arxiv_id=\"2305.14342\")"}],"by_repo":[{"repo":"stanford-crfm/levanter","kind":"named_in_paper","samples":5,"ran":3,"instrument":0,"unverified":2},{"repo":"Liuhong99/Sophia","kind":"listed","samples":4,"ran":2,"instrument":0,"unverified":2},{"repo":"cor3bit/somax","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2603.25976"],"harvested_for_calls":[{"arxiv_id":"2603.25976","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2603.25976"},"call":"get_harvested_code_for_paper(arxiv_id=\"2603.25976\")"}]},{"repo":"helw150/levanter","kind":"listed","samples":6,"ran":4,"instrument":0,"unverified":2},{"repo":"kyegomez/Sophia","kind":"listed","samples":1,"ran":1,"instrument":1,"unverified":0},{"repo":"MindSpore-scientific/code-2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2311.15127"],"harvested_for_calls":[{"arxiv_id":"2311.15127","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2311.15127"},"call":"get_harvested_code_for_paper(arxiv_id=\"2311.15127\")"}]},{"repo":"labmlai/annotated_deep_learning_paper_implementations","kind":"listed","samples":3,"ran":3,"instrument":0,"unverified":0}],"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":"35716652fdc11e24","source_kind":"harvested","method_name":"Sophia","realizes_method":"Sophia","graph_method":"Sophia","realizes_severed":false,"claim":"The paper claims this code implements a scalable stochastic second-order optimizer for language model pre-training, named Sophia, which uses Hessian-based updates to improve efficiency over Adam and its variants.","centrality":"contribution","entry":"SophiaG","entry_sha256":"1436d0069dad845e","n_bricks":3,"bricks":[{"entry":"SophiaG","code_sha256":"1436d0069dad845e","role":"entry","order":0,"level":1,"status":"ran"},{"entry":"sophiag","code_sha256":"24947d588d9b62aa","role":"update_rule","order":1,"level":0,"status":"unverified"},{"entry":"_single_tensor_sophiag","code_sha256":"34b6a986acbf4f68","role":"helper","order":2,"level":0,"status":"unverified"}],"ran_individually":1,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":1},"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":"9795d9f1fd5d","n_siblings":1,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"7ef693e3d20e3c13","source_kind":"harvested","method_name":"Sophia","realizes_method":"Sophia","graph_method":"Sophia","realizes_severed":false,"claim":"Sophia is a scalable stochastic second-order optimizer for language model pre-training that uses Hessian-based information.","centrality":"contribution","entry":"Sophia","entry_sha256":"a6e9300c48fec63f","n_bricks":3,"bricks":[{"entry":"Sophia","code_sha256":"a6e9300c48fec63f","role":"entry","order":0,"level":1,"status":"ran"},{"entry":"GenericAdaptiveOptimizer","code_sha256":"15bc730db57a3642","role":"helper","order":1,"level":1,"status":"ran"},{"entry":"WeightDecay","code_sha256":"ba6a2ba94fbeb5e9","role":"helper","order":2,"level":1,"status":"ran"}],"ran_individually":3,"ran_individually_constructed":3,"ran_individually_by_status":{"ran":3},"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":"9795d9f1fd5d","n_siblings":1,"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":"9795d9f1fd5d","realizes_method":"Sophia","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["35716652fdc11e24","7ef693e3d20e3c13"]}],"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.14342"},"call":"assembly(arxiv_id=\"2305.14342\")"},"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.14342.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.14342.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/cor3bit/somax","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/kyegomez/Sophia","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Liuhong99/Sophia","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/stanford-crfm/levanter","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/MindSpore-scientific/code-2/tree/main/stochastic-attention-head-removal-a-simple","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/helw150/levanter","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"ran":11,"ran_honours":1,"ran_draft_wrong":1,"unverified":6},"n_samples":19,"n_ran":13,"n_constructed":4,"n_ran_checked":12,"n_instrument":1,"n_unverified":6,"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":{"named_in_paper":{"samples":5,"ran":3,"n_ran_checked":3,"n_instrument":0,"repositories":1},"listed":{"samples":14,"ran":10,"n_ran_checked":9,"n_instrument":1,"repositories":4}},"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":0,"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":0,"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","signature_not_shown":"the graph records a signature for this sample and it is not shown; signature_not_shown_because names why, as the export's field-exclusion reason","signature_not_shown_because":{"signature_is_harness_object_repr":"an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape"}},"n_ran_with_level_date":13,"n_ran_without_level_date":0,"n_ran_signature_not_shown":1,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","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":"15bc730db57a3642","code_sha256_prefix":"15bc730db57a3642","entry":"GenericAdaptiveOptimizer","repo":"labmlai/annotated_deep_learning_paper_implementations","repo_kind":"listed","path":"labml_nn/optimizers/sophia.py","file_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations/blob/HEAD/labml_nn/optimizers/sophia.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":"GenericAdaptiveOptimizer","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"15bc730db57a3642"}},{"code_sha256":"a6e9300c48fec63f","code_sha256_prefix":"a6e9300c48fec63f","entry":"Sophia","repo":"labmlai/annotated_deep_learning_paper_implementations","repo_kind":"listed","path":"labml_nn/optimizers/sophia.py","file_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations/blob/HEAD/labml_nn/optimizers/sophia.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":"Sophia","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a6e9300c48fec63f"}},{"code_sha256":"1436d0069dad845e","code_sha256_prefix":"1436d0069dad845e","entry":"SophiaG","repo":"Liuhong99/Sophia","repo_kind":"listed","path":"sophia.py","file_url":"https://github.com/Liuhong99/Sophia/blob/HEAD/sophia.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":"SophiaG","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1436d0069dad845e"}},{"code_sha256":"ba6a2ba94fbeb5e9","code_sha256_prefix":"ba6a2ba94fbeb5e9","entry":"WeightDecay","repo":"labmlai/annotated_deep_learning_paper_implementations","repo_kind":"listed","path":"labml_nn/optimizers/sophia.py","file_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations/blob/HEAD/labml_nn/optimizers/sophia.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":"WeightDecay","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ba6a2ba94fbeb5e9"}},{"code_sha256":"de22a502eda2c3b9","code_sha256_prefix":"de22a502eda2c3b9","entry":"auto_metric_from_name","repo":"stanford-crfm/levanter","repo_kind":"named_in_paper","path":"src/levanter/metrics.py","file_url":"https://github.com/stanford-crfm/levanter/blob/HEAD/src/levanter/metrics.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"name:str/0/str, value:float/0/float","fixture_out_type":"Metric","level_recorded_at":"2026-09-24T22:55:07.240920+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":"de22a502eda2c3b9"}},{"code_sha256":"1421ef5f024f6e23","code_sha256_prefix":"1421ef5f024f6e23","entry":"eval_loss_loop","repo":"helw150/levanter","repo_kind":"listed","path":"src/levanter/callbacks.py","file_url":"https://github.com/helw150/levanter/blob/HEAD/src/levanter/callbacks.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"loss_fn:callable/0/?, model:callable/0/?, dataset:list/1/tuple, max_batches:NoneType/0/?, name:str/0/str","fixture_out_type":"float","level_recorded_at":"2026-09-24T22:55:07.240920+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":"1421ef5f024f6e23"}},{"code_sha256":"a273291a5ece194d","code_sha256_prefix":"a273291a5ece194d","entry":"get_lr","repo":"Liuhong99/Sophia","repo_kind":"listed","path":"train_sophiag.py","file_url":"https://github.com/Liuhong99/Sophia/blob/HEAD/train_sophiag.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"signature":"it:int/0/int","fixture_out_type":"float","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"a273291a5ece194d"},"code_page":"/code/get-lr","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a273291a5ece194d"}},{"code_sha256":"2382cb6829841947","code_sha256_prefix":"2382cb6829841947","entry":"group_texts","repo":"kyegomez/Sophia","repo_kind":"listed","path":"experiments/training.py","file_url":"https://github.com/kyegomez/Sophia/blob/HEAD/experiments/training.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"examples:dict/0/?","fixture_out_type":"dict","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/group-texts","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2382cb6829841947"}},{"code_sha256":"003d0a17d2ac09ca","code_sha256_prefix":"003d0a17d2ac09ca","entry":"load_array_from_tensorstore","repo":"helw150/levanter","repo_kind":"listed","path":"src/levanter/tensorstore_serialization.py","file_url":"https://github.com/helw150/levanter/blob/HEAD/src/levanter/tensorstore_serialization.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"spec:dict/0/?","fixture_out_type":"coroutine","level_recorded_at":"2026-09-24T22:55:07.240920+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":"003d0a17d2ac09ca"}},{"code_sha256":"f3fb5a3a9edbf5ef","code_sha256_prefix":"f3fb5a3a9edbf5ef","entry":"local_device_grid_positions","repo":"helw150/levanter","repo_kind":"listed","path":"src/levanter/mesh.py","file_url":"https://github.com/helw150/levanter/blob/HEAD/src/levanter/mesh.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"mesh:MockMesh/0/?, process_index:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T22:55:07.240920+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":"f3fb5a3a9edbf5ef"}},{"code_sha256":"efa87b8fc2935200","code_sha256_prefix":"efa87b8fc2935200","entry":"process_mesh_position","repo":"helw150/levanter","repo_kind":"listed","path":"src/levanter/mesh.py","file_url":"https://github.com/helw150/levanter/blob/HEAD/src/levanter/mesh.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_object_repr","fixture_out_type":"ndarray","level_recorded_at":"2026-09-24T22:55:07.240920+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":"efa87b8fc2935200"}},{"code_sha256":"3f1967528c23afbd","code_sha256_prefix":"3f1967528c23afbd","entry":"unwrap_metrics","repo":"stanford-crfm/levanter","repo_kind":"named_in_paper","path":"src/levanter/metrics.py","file_url":"https://github.com/stanford-crfm/levanter/blob/HEAD/src/levanter/metrics.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"pytree:dict/0/?","fixture_out_type":"dict","level_recorded_at":"2026-09-24T22:55:07.240920+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":"3f1967528c23afbd"}},{"code_sha256":"9b3a9ebcd8b2b32b","code_sha256_prefix":"9b3a9ebcd8b2b32b","entry":"value_at_step","repo":"stanford-crfm/levanter","repo_kind":"named_in_paper","path":"src/levanter/schedule.py","file_url":"https://github.com/stanford-crfm/levanter/blob/HEAD/src/levanter/schedule.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"schedule_or_t:list/1/ScheduleStep, step:int/0/int","fixture_out_type":"list","level_recorded_at":"2026-09-24T22:55:07.240920+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":"9b3a9ebcd8b2b32b"}},{"code_sha256":"34b6a986acbf4f68","code_sha256_prefix":"34b6a986acbf4f68","entry":"_single_tensor_sophiag","repo":"Liuhong99/Sophia","repo_kind":"listed","path":"sophia.py","file_url":"https://github.com/Liuhong99/Sophia/blob/HEAD/sophia.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":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"34b6a986acbf4f68"}},{"code_sha256":"c501ae8133a11ec3","code_sha256_prefix":"c501ae8133a11ec3","entry":"distinct_values","repo":"stanford-crfm/levanter","repo_kind":"named_in_paper","path":"src/levanter/schedule.py","file_url":"https://github.com/stanford-crfm/levanter/blob/HEAD/src/levanter/schedule.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":"c501ae8133a11ec3"}},{"code_sha256":"d40382c2fb844d41","code_sha256_prefix":"d40382c2fb844d41","entry":"fold","repo":"stanford-crfm/levanter","repo_kind":"named_in_paper","path":"src/levanter/metrics.py","file_url":"https://github.com/stanford-crfm/levanter/blob/HEAD/src/levanter/metrics.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/fold","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d40382c2fb844d41"}},{"code_sha256":"030ef454b59ac14a","code_sha256_prefix":"030ef454b59ac14a","entry":"process_mesh_size","repo":"helw150/levanter","repo_kind":"listed","path":"src/levanter/mesh.py","file_url":"https://github.com/helw150/levanter/blob/HEAD/src/levanter/mesh.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":"030ef454b59ac14a"}},{"code_sha256":"8b3f53737bb49ef4","code_sha256_prefix":"8b3f53737bb49ef4","entry":"save_xla_dumps_to_wandb","repo":"helw150/levanter","repo_kind":"listed","path":"src/levanter/logging.py","file_url":"https://github.com/helw150/levanter/blob/HEAD/src/levanter/logging.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":"8b3f53737bb49ef4"}},{"code_sha256":"24947d588d9b62aa","code_sha256_prefix":"24947d588d9b62aa","entry":"sophiag","repo":"Liuhong99/Sophia","repo_kind":"listed","path":"sophia.py","file_url":"https://github.com/Liuhong99/Sophia/blob/HEAD/sophia.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":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"24947d588d9b62aa"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"932a89d4132ae79609c84c38f3d23415ceb3ffe4cd55b45ac56932663afcd7d7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}