{"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/adam-mini","slug":"adam-mini","name":"Adam-mini","full_name":"Adaptive Moment Estimation - Mini","full_name_withheld":false,"description_markdown":"**Adam-mini** is a memory-efficient [Adam](https://paperswithcode.com/method/adam) variant that achieves on-par or better performance than [AdamW](https://paperswithcode.com/method/adamw) with 45% to 50% less memory footprint. Adam-mini reduces the memory footprint by cutting down the learning rate resources in Adam (i.e., $ {1}/{\\sqrt{v}} $). The authors find that ≥ 90% of these learning rates in $ v $ could be harmlessly removed if they (1) carefully partition the parameters into blocks following their proposed principle on Hessian structure; (2) assign a single but good learning rate to each parameter block. They further find that, for each of these parameter blocks, there exists a single high-quality learning rate that can outperform Adam, provided that sufficient resources are available to search it out.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Adam-mini: Use Fewer Learning Rates To Gain More","paper":"/paper/adam-mini-use-fewer-learning-rates-to-gain","first_author":"Yushun Zhang","n_authors":9,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/adam-mini-use-fewer-learning-rates-to-gain"},"source":{"url":"https://arxiv.org/abs/2406.16793v6","title":"Adam-mini: Use Fewer Learning Rates To Gain More","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/zyushun/Adam-mini/blob/main/adam_mini/adam_mini.py","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":null,"slug":"the-sharpness-disparity-principle-in","title":"The Sharpness Disparity Principle in Transformers for Accelerating Language Model Pre-Training","date":"2025-02-26","arxiv_id":"2502.19002","n_code_links":0,"syntology":null},{"paper":"/paper/adam-mini-use-fewer-learning-rates-to-gain","slug":"adam-mini-use-fewer-learning-rates-to-gain","title":"Adam-mini: Use Fewer Learning Rates To Gain More","date":"2024-06-24","arxiv_id":"2406.16793","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zyushun/adam-mini"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}}],"papers_shown":2,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":2,"with_a_code_link":1,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":2,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"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":1,"papers_where_code_ran_first_page":"/method/adam-mini/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/adam-mini/papers/ran/1","json":"/method/adam-mini/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/language-modeling","name":"Language Modeling","papers":1},{"task":"/task/language-modelling","name":"Language Modelling","papers":1},{"task":"/task/large-language-model","name":"Large Language Model","papers":1}],"tasks_shown":3,"n_tasks":3,"usage_by_year":[{"year":"2024","papers":1},{"year":"2025","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/adam-mini"},"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=Adam-mini","read_at":"2026-10-05T00:51:28+00:00","query":"Adam-mini","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":"2406.16793","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":"2406.16793","title":"Adam-mini: Use Fewer Learning Rates To Gain More","citations":148,"named_by":["title_prefix"],"bearer_name":"Adam-mini: Use Fewer Learning Rates To Gain More","ask_with":"have('2406.16793')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'Adam-mini' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'Adam-mini: Use Fewer Learning Rates To Gain More' (arXiv:2406.16793, 148 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 “Adam-mini: Use Fewer Learning Rates To Gain More” (arXiv:2406.16793, 148 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":["Adam","AdAM","C-Adam","M+Adam","SR-Adam","Adam-v2","TS_Adam"],"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":"c02c3c35d766dd824a6c8ed99877ff873f4bbabd2941f5441a70625878a0f19d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}