{"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":"/method/adahessian","slug":"adahessian","name":"AdaHessian","full_name":"ADAHESSIAN","full_name_withheld":false,"description_markdown":"ADAHESSIAN is a new stochastic optimization algorithm that directly incorporates approximate curvature information from the loss function, and it includes several novel performance-improving features, including a fast Hutchinson based method to approximate the curvature matrix with low computational overhead.","description_state":"present","introduced_year":null,"introduced_by":{"title":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","paper":"/paper/adahessian-an-adaptive-second-order-optimizer","first_author":"Zhewei Yao","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/adahessian-an-adaptive-second-order-optimizer"},"source":{"url":"https://arxiv.org/abs/2006.00719v3","title":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]}],"n_papers_tagged":6,"archive_num_papers":6,"papers_newest_first":[{"paper":null,"slug":"a-dynamic-weighting-strategy-to-mitigate","title":"A Dynamic Weighting Strategy to Mitigate Worker Node Failure in Distributed Deep Learning","date":"2024-09-14","arxiv_id":"2409.09242","n_code_links":0,"syntology":null},{"paper":null,"slug":"sofim-stochastic-optimization-using","title":"SOFIM: Stochastic Optimization Using Regularized Fisher Information Matrix","date":"2024-03-05","arxiv_id":"2403.02833","n_code_links":0,"syntology":null},{"paper":"/paper/sania-polyak-type-optimization-framework","slug":"sania-polyak-type-optimization-framework","title":"SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms","date":"2023-12-28","arxiv_id":"2312.17369","n_code_links":1,"syntology":{"ran":10,"of":10,"n_ran_checked":6,"n_instrument":4,"unverified":0,"pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","official":{"repos":["fxrshed/sania"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"on-scaled-methods-for-saddle-point-problems","title":"On Scaled Methods for Saddle Point Problems","date":"2022-06-16","arxiv_id":"2206.08303","n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-optimizers-with-sparse-group-lasso-1","slug":"adaptive-optimizers-with-sparse-group-lasso-1","title":"Adaptive Optimizers with Sparse Group Lasso for Neural Networks in CTR Prediction","date":"2021-07-30","arxiv_id":"2107.14432","n_code_links":2,"syntology":null},{"paper":"/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","n_code_links":4,"syntology":{"ran":5,"of":11,"n_ran_checked":4,"n_instrument":1,"unverified":6,"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","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"]}}}],"papers_shown":6,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":6,"with_a_code_link":3,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":6,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/adahessian/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/adahessian/papers/ran/1","json":"/method/adahessian/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/stochastic-optimization","name":"Stochastic Optimization","papers":2},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":1},{"task":"/task/click-through-rate-prediction","name":"Click-Through Rate Prediction","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/second-order-methods","name":"Second-order methods","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1}],"tasks_shown":7,"n_tasks":7,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":1},{"year":"2023","papers":1},{"year":"2024","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/adahessian"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=AdaHessian","read_at":"2026-10-05T00:51:28+00:00","query":"AdaHessian","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2006.00719","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"2006.00719","title":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","citations":394,"named_by":["title_prefix"],"bearer_name":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","ask_with":"have('2006.00719')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'AdaHessian' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning' (arXiv:2006.00719, 394 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning” (arXiv:2006.00719, 394 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"9da92b895876a81d007b2442cbea29cddd1f0e4b0a7ffec5df9c6afb229a4578","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}