{"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/adan","slug":"adan","name":"Adan","full_name":"Adaptive Nesterov Momentum","full_name_withheld":false,"description_markdown":null,"description_state":"placeholder","introduced_year":null,"introduced_by":{"title":"Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models","paper":"/paper/adan-adaptive-nesterov-momentum-algorithm-for","first_author":"Xingyu Xie","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/adan-adaptive-nesterov-momentum-algorithm-for"},"source":{"url":"https://arxiv.org/abs/2208.06677v5","title":"Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models","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":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":null,"slug":"an-adaptive-gradient-regularization-method","title":"Adaptive Gradient Regularization: A Faster and Generalizable Optimization Technique for Deep Neural Networks","date":"2024-07-24","arxiv_id":"2407.16944","n_code_links":0,"syntology":null},{"paper":"/paper/collie-collaborative-training-of-large","slug":"collie-collaborative-training-of-large","title":"CoLLiE: Collaborative Training of Large Language Models in an Efficient Way","date":"2023-12-01","arxiv_id":"2312.00407","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":2,"n_instrument":2,"unverified":3,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["openlmlab/collie"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"uadam-unified-adam-type-algorithmic-framework","title":"UAdam: Unified Adam-Type Algorithmic Framework for Non-Convex Stochastic Optimization","date":"2023-05-09","arxiv_id":"2305.05675","n_code_links":0,"syntology":null},{"paper":"/paper/adan-adaptive-nesterov-momentum-algorithm-for","slug":"adan-adaptive-nesterov-momentum-algorithm-for","title":"Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models","date":"2022-08-13","arxiv_id":"2208.06677","n_code_links":9,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["sail-sg/adan"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":2,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":4,"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/adan/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/adan/papers/ran/1","json":"/method/adan/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/stochastic-optimization","name":"Stochastic Optimization","papers":2},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/image-generation","name":"Image Generation","papers":1},{"task":"/task/type","name":"Vocal Bursts Type Prediction","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1},{"task":"/task/parameter-efficient-fine-tuning","name":"parameter-efficient fine-tuning","papers":1}],"tasks_shown":8,"n_tasks":8,"usage_by_year":[{"year":"2022","papers":1},{"year":"2023","papers":2},{"year":"2024","papers":1}],"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/adan"},"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=Adan","read_at":"2026-10-05T00:51:30+00:00","query":"Adan","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":"2208.06677","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":"2208.06677","title":"Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models","citations":330,"named_by":["title_prefix"],"bearer_name":"Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models","ask_with":"have('2208.06677')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'Adan' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models' (arXiv:2208.06677, 330 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 “Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models” (arXiv:2208.06677, 330 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":"3b24a6fea1c6d0d5bfe7199a121aa3d6883d05c568e2e5b0e2c4b64e05568af7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}