{"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":"/task/second-order-methods/papers/ran/1","list_of":"/task/second-order-methods","task":"Second-order methods","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,12],"of":12,"counts":{"archive_papers_tagged":181,"with_a_code_link":52,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":181,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/second-order-methods/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/sassha-sharpness-aware-adaptive-second-order","slug":"sassha-sharpness-aware-adaptive-second-order","title":"SASSHA: Sharpness-aware Adaptive Second-order Optimization with Stable Hessian Approximation","date":"2025-02-25","arxiv_id":"2502.18153","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sassha-sharpness-aware-adaptive-second-order#ran","syntology_url":"https://syntology.ai/paper/2502.18153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.18153"}},"official":{"repos":["LOG-postech/Sassha"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exact-tractable-gauss-newton-optimization-in","slug":"exact-tractable-gauss-newton-optimization-in","title":"Exact, Tractable Gauss-Newton Optimization in Deep Reversible Architectures Reveal Poor Generalization","date":"2024-11-12","arxiv_id":"2411.07979","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exact-tractable-gauss-newton-optimization-in#ran","syntology_url":"https://syntology.ai/paper/2411.07979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.07979"}},"official":{"repos":["mtkresearch/exact_GN_revNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/can-we-remove-the-square-root-in-adaptive","slug":"can-we-remove-the-square-root-in-adaptive","title":"Can We Remove the Square-Root in Adaptive Gradient Methods? A Second-Order Perspective","date":"2024-02-05","arxiv_id":"2402.03496","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/can-we-remove-the-square-root-in-adaptive#ran","syntology_url":"https://syntology.ai/paper/2402.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03496"}},"official":{"repos":["f-dangel/sirfshampoo","yorkerlin/remove-the-square-root"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-inverse-free-natural-gradient","slug":"structured-inverse-free-natural-gradient","title":"Structured Inverse-Free Natural Gradient: Memory-Efficient & Numerically-Stable KFAC","date":"2023-12-09","arxiv_id":"2312.05705","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-inverse-free-natural-gradient#ran","syntology_url":"https://syntology.ai/paper/2312.05705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.05705"}},"official":{"repos":["f-dangel/singd"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adam-through-a-second-order-lens","slug":"adam-through-a-second-order-lens","title":"Studying K-FAC Heuristics by Viewing Adam through a Second-Order Lens","date":"2023-10-23","arxiv_id":"2310.14963","repositories_listed":1,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":16,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/adam-through-a-second-order-lens#ran","syntology_url":"https://syntology.ai/paper/2310.14963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14963"}},"official":{"repos":["rmclarke/adamthroughasecondorderlens"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/error-feedback-can-accurately-compress","slug":"error-feedback-can-accurately-compress","title":"Error Feedback Can Accurately Compress Preconditioners","date":"2023-06-09","arxiv_id":"2306.06098","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/error-feedback-can-accurately-compress#ran","syntology_url":"https://syntology.ai/paper/2306.06098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.06098"}},"official":{"repos":["ist-daslab/efcp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mkor-momentum-enabled-kronecker-factor-based","slug":"mkor-momentum-enabled-kronecker-factor-based","title":"MKOR: Momentum-Enabled Kronecker-Factor-Based Optimizer Using Rank-1 Updates","date":"2023-06-02","arxiv_id":"2306.01685","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":2,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mkor-momentum-enabled-kronecker-factor-based#ran","syntology_url":"https://syntology.ai/paper/2306.01685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.01685"}},"official":{"repos":["mohammad-mozaffari/mkor"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-gradient-descent-deep-learning","slug":"automatic-gradient-descent-deep-learning","title":"Automatic Gradient Descent: Deep Learning without Hyperparameters","date":"2023-04-11","arxiv_id":"2304.05187","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/automatic-gradient-descent-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2304.05187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05187"}},"official":{"repos":["jxbz/agd"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/symmetry-teleportation-for-accelerated","slug":"symmetry-teleportation-for-accelerated","title":"Symmetry Teleportation for Accelerated Optimization","date":"2022-05-21","arxiv_id":"2205.10637","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/symmetry-teleportation-for-accelerated#ran","syntology_url":"https://syntology.ai/paper/2205.10637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10637"}},"official":{"repos":["rose-stl-lab/symmetry-teleportation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-matrix-free-approximations-of","slug":"efficient-matrix-free-approximations-of","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","date":"2021-07-07","arxiv_id":"2107.03356","repositories_listed":2,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":7,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/efficient-matrix-free-approximations-of#ran","syntology_url":"https://syntology.ai/paper/2107.03356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03356"}},"official":{"repos":["IST-DASLab/M-FAC"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/tensor-normal-training-for-deep-learning","slug":"tensor-normal-training-for-deep-learning","title":"Tensor Normal Training for Deep Learning Models","date":"2021-06-05","arxiv_id":"2106.02925","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tensor-normal-training-for-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2106.02925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02925"}},"official":{"repos":["renyiryry/tnt_neurips_2021"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adahessian-an-adaptive-second-order-optimizer","slug":"adahessian-an-adaptive-second-order-optimizer","title":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","date":"2020-06-01","arxiv_id":"2006.00719","repositories_listed":4,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/adahessian-an-adaptive-second-order-optimizer#ran","syntology_url":"https://syntology.ai/paper/2006.00719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.00719"}},"official":{"repos":["amirgholami/adahessian"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["listed","official"]}}}],"record_sha256":"2a338e8a21f0017d5e7818357222498ac8f46041e487c0ed001179a333ffb740","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}