{"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/accordion","slug":"accordion","name":"Accordion","full_name":"Accordion","full_name_withheld":false,"description_markdown":"**Accordion** is a gradient communication scheduling algorithm that is generic across models while imposing low computational overheads. Accordion inspects the change in the gradient norms to detect critical regimes and adjusts the communication schedule dynamically. Accordion works for both adjusting the gradient compression rate or the batch size without additional parameter tuning.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Accordion: Adaptive Gradient Communication via Critical Learning Regime Identification","paper":"/paper/accordion-adaptive-gradient-communication-via","first_author":"Saurabh Agarwal","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/accordion-adaptive-gradient-communication-via"},"source":{"url":"https://arxiv.org/abs/2010.16248v1","title":"Accordion: Adaptive Gradient Communication via Critical Learning Regime Identification","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":"Data Parallel Methods","url":"/methods/category/data-parallel-methods","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Distributed Methods","url":"/methods/category/distributed-methods","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":null,"slug":"rethinking-layered-graphic-design-generation","title":"Rethinking Layered Graphic Design Generation with a Top-Down Approach","date":"2025-07-08","arxiv_id":"2507.05601","n_code_links":0,"syntology":null},{"paper":null,"slug":"capafoldable-self-tracking-foldable-smart","title":"Origami Single-end Capacitive Sensing for Continuous Shape Estimation of Morphing Structures","date":"2023-07-03","arxiv_id":"2307.05370","n_code_links":0,"syntology":null},{"paper":null,"slug":"accordion-a-communication-aware-machine","title":"Accordion: A Communication-Aware Machine Learning Framework for Next Generation Networks","date":"2023-01-12","arxiv_id":"2302.00623","n_code_links":0,"syntology":null},{"paper":"/paper/accordion-adaptive-gradient-communication-via","slug":"accordion-adaptive-gradient-communication-via","title":"Accordion: Adaptive Gradient Communication via Critical Learning Regime Identification","date":"2020-10-29","arxiv_id":"2010.16248","n_code_links":2,"syntology":null}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":1,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":4,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/3d-geometry","name":"3D geometry","papers":1},{"task":"/task/quantization","name":"Quantization","papers":1}],"tasks_shown":2,"n_tasks":2,"usage_by_year":[{"year":"2020","papers":1},{"year":"2023","papers":2},{"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/accordion"},"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=Accordion","read_at":"2026-10-05T00:51:20+00:00","query":"Accordion","kind":"method","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"Accordion","origin_arxiv_id":"2507.05601"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":"for_this_exact_name_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"2010.16248","repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2507.05601","citations":9},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Accordion'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2507.05601","page":null,"syntology_url":"https://syntology.ai/paper/2507.05601","in_graph_layer":false,"samples":0},"line":"about another paper, arXiv:2507.05601: no code under this exact name (no_code; paper_only). About another paper: this answer is about arXiv:2507.05601, while the archive credits arXiv:2010.16248, so it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"a34970f5d45d42c5f3359e6e4382347b981f5a4e9df128aec3ef283fd44d6dab","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}