{"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/adahessian-an-adaptive-second-order-optimizer","title":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","arxiv_id":"2006.00719","date":"2020-06-01","proceeding":null,"authors":["Zhewei Yao","Amir Gholami","Sheng Shen","Mustafa Mustafa","Kurt Keutzer","Michael W. Mahoney"],"abstract":"We introduce ADAHESSIAN, a second order stochastic optimization algorithm which dynamically incorporates the curvature of the loss function via ADAptive estimates of the HESSIAN. Second order algorithms are among the most powerful optimization algorithms with superior convergence properties as compared to first order methods such as SGD and Adam. The main disadvantage of traditional second order methods is their heavier per iteration computation and poor accuracy as compared to first order methods. To address these, we incorporate several novel approaches in ADAHESSIAN, including: (i) a fast Hutchinson based method to approximate the curvature matrix with low computational overhead; (ii) a root-mean-square exponential moving average to smooth out variations of the Hessian diagonal across different iterations; and (iii) a block diagonal averaging to reduce the variance of Hessian diagonal elements. We show that ADAHESSIAN achieves new state-of-the-art results by a large margin as compared to other adaptive optimization methods, including variants of Adam. In particular, we perform extensive tests on CV, NLP, and recommendation system tasks and find that ADAHESSIAN: (i) achieves 1.80%/1.45% higher accuracy on ResNets20/32 on Cifar10, and 5.55% higher accuracy on ImageNet as compared to Adam; (ii) outperforms AdamW for transformers by 0.13/0.33 BLEU score on IWSLT14/WMT14 and 2.7/1.0 PPL on PTB/Wikitext-103; (iii) outperforms AdamW for SqueezeBert by 0.41 points on GLUE; and (iv) achieves 0.032% better score than Adagrad for DLRM on the Criteo Ad Kaggle dataset. Importantly, we show that the cost per iteration of ADAHESSIAN is comparable to first order methods, and that it exhibits robustness towards its hyperparameters.","url_abs":"https://arxiv.org/abs/2006.00719v3","url_pdf":"https://arxiv.org/pdf/2006.00719v3.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":"adahessian-an-adaptive-second-order-optimizer","repo_url":"https://github.com/amirgholami/adahessian","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"adahessian-an-adaptive-second-order-optimizer","repo_url":"https://github.com/davda54/ada-hessian","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"adahessian-an-adaptive-second-order-optimizer","repo_url":"https://github.com/morganmcg1/ImageNette_ImageWoof_ImageWang","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"adahessian-an-adaptive-second-order-optimizer","repo_url":"https://github.com/cor3bit/somax","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"jax","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"second-order-methods","task_name":"Second-order methods"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"absolute-position-encodings","method_name":"Absolute Position Encodings"},{"method_slug":"adagrad","method_name":"AdaGrad"},{"method_slug":"adahessian","method_name":"AdaHessian"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"adamw","method_name":"AdamW"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"label-smoothing","method_name":"Label Smoothing"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"position-wise-feed-forward-layer","method_name":"Position-Wise Feed-Forward Layer"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"sgd","method_name":"SGD"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"transformer","method_name":"Transformer"}],"datasets_introduced":[],"methods_introduced":[{"slug":"adahessian","name":"AdaHessian","full_name":"ADAHESSIAN"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2006.00719","atlas_url":"https://app.syntology.ai/?focus=2006.00719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.00719"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.00719"},"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":"2006.00719"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.00719\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2006.00719"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2006.00719\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2006.00719"},"call":"get_concepts_for_paper(arxiv_id=\"2006.00719\")"}],"by_repo":[{"repo":"amirgholami/adahessian","kind":"official","samples":9,"ran":4,"instrument":1,"unverified":5},{"repo":"davda54/ada-hessian","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"morganmcg1/ImageNette_ImageWoof_ImageWang","kind":"listed","samples":2,"ran":1,"instrument":0,"unverified":1},{"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\")"}]}],"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/2006.00719.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/2006.00719.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/amirgholami/adahessian","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/morganmcg1/ImageNette_ImageWoof_ImageWang","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/davda54/ada-hessian","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/cor3bit/somax","reach":null}],"summary":{"ran":4,"ran_draft_wrong":1,"unverified":6},"n_samples":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"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":{"official":{"samples":9,"ran":4,"n_ran_checked":3,"n_instrument":1,"repositories":1},"listed":{"samples":2,"ran":1,"n_ran_checked":1,"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":1,"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":1,"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":4,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","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":"387ee05bb55df246","code_sha256_prefix":"387ee05bb55df246","entry":"average_sqr_diag_hessian","repo":"morganmcg1/ImageNette_ImageWoof_ImageWang","repo_kind":"listed","path":"AdaHessian.py","file_url":"https://github.com/morganmcg1/ImageNette_ImageWoof_ImageWang/blob/HEAD/AdaHessian.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"p:Tensor/2/float, sqr_mom:float/0/float, dampening:bool/0/bool, sqr_avg_diag_hessian:Tensor/2/float, hutchinson_trace:Tensor/2/float","fixture_out_type":"dict","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"387ee05bb55df246"}},{"code_sha256":"8b69e8ab29b336b3","code_sha256_prefix":"8b69e8ab29b336b3","entry":"bn_relu","repo":"amirgholami/adahessian","repo_kind":"official","path":"adahessian_tf/Models/Resnets.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/adahessian_tf/Models/Resnets.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:EagerTensor/2/float","fixture_out_type":"EagerTensor","level_recorded_at":"2026-09-25T10:06:43.451432+00:00","retrieve_with":{"tool":"get_code","code_sha256":"8b69e8ab29b336b3"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8b69e8ab29b336b3"}},{"code_sha256":"fac5364e2f53c6db","code_sha256_prefix":"fac5364e2f53c6db","entry":"conv3x3","repo":"amirgholami/adahessian","repo_kind":"official","path":"image_classification/models/resnet.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/image_classification/models/resnet.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int","fixture_out_type":"Conv2d","code_page":"/code/conv3x3","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 lixiaotong97/DSU, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"fac5364e2f53c6db"}},{"code_sha256":"de32ddb77d1b5144","code_sha256_prefix":"de32ddb77d1b5144","entry":"get_params_grad","repo":"amirgholami/adahessian","repo_kind":"official","path":"image_classification/utils.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/image_classification/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"model:callable/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"de32ddb77d1b5144"}},{"code_sha256":"beeda9e1db69fe81","code_sha256_prefix":"beeda9e1db69fe81","entry":"test","repo":"amirgholami/adahessian","repo_kind":"official","path":"image_classification/utils.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/image_classification/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"model:callable/0/?, test_loader:list/1/tuple","fixture_out_type":"float","level_recorded_at":"2026-09-25T10:06:43.451432+00:00","code_page":"/code/test","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"beeda9e1db69fe81"}},{"code_sha256":"dedf33bd0adc1f56","code_sha256_prefix":"dedf33bd0adc1f56","entry":"VGG","repo":"amirgholami/adahessian","repo_kind":"official","path":"adahessian_tf/Models/VGGs.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/adahessian_tf/Models/VGGs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/vgg","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"dedf33bd0adc1f56"}},{"code_sha256":"6d822742f437ca1a","code_sha256_prefix":"6d822742f437ca1a","entry":"adahessian_step","repo":"morganmcg1/ImageNette_ImageWoof_ImageWang","repo_kind":"listed","path":"AdaHessian.py","file_url":"https://github.com/morganmcg1/ImageNette_ImageWoof_ImageWang/blob/HEAD/AdaHessian.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":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6d822742f437ca1a"}},{"code_sha256":"6290891118db623e","code_sha256_prefix":"6290891118db623e","entry":"conv_block","repo":"amirgholami/adahessian","repo_kind":"official","path":"adahessian_tf/Models/VGGs.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/adahessian_tf/Models/VGGs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/conv-block","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6290891118db623e"}},{"code_sha256":"52e6b930397c2338","code_sha256_prefix":"52e6b930397c2338","entry":"getData","repo":"amirgholami/adahessian","repo_kind":"official","path":"image_classification/utils.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/image_classification/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/getdata","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"52e6b930397c2338"}},{"code_sha256":"b13423aecaba1080","code_sha256_prefix":"b13423aecaba1080","entry":"original_block","repo":"amirgholami/adahessian","repo_kind":"official","path":"adahessian_tf/Models/Resnets.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/adahessian_tf/Models/Resnets.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":"b13423aecaba1080"}},{"code_sha256":"0a1815a3309d2414","code_sha256_prefix":"0a1815a3309d2414","entry":"shortcut","repo":"amirgholami/adahessian","repo_kind":"official","path":"adahessian_tf/Models/Resnets.py","file_url":"https://github.com/amirgholami/adahessian/blob/HEAD/adahessian_tf/Models/Resnets.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":"0a1815a3309d2414"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"62bd8b92968cca97bffffd71fb2ad882791edbedafc21a8925c9a7c60171f0dd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}