{"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/nuqsgd","slug":"nuqsgd","name":"NUQSGD","full_name":"Nonuniform Quantization for Stochastic Gradient Descent","full_name_withheld":false,"description_markdown":"As the size and complexity of models and datasets grow, so does the need for communication-efficient variants of stochastic gradient descent that can be deployed to perform parallel model training. One popular communication-compression method for data-parallel [SGD](https://paperswithcode.com/method/sgd) is QSGD (Alistarh et al., 2017), which quantizes and encodes gradients to reduce communication costs. The baseline variant of QSGD provides strong theoretical guarantees, however, for practical purposes, the authors proposed a heuristic variant which we call QSGDinf, which demonstrated impressive empirical gains for distributed training of large neural networks. In this paper, we build on this work to propose a new gradient quantization scheme, and show that it has both stronger theoretical guarantees than QSGD, and matches and exceeds the empirical performance of the QSGDinf heuristic and of other compression methods.","description_state":"present","introduced_year":null,"introduced_by":{"title":"NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization","paper":"/paper/nuqsgd-provably-communication-efficient-data","first_author":"Ali Ramezani-Kebrya","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/nuqsgd-provably-communication-efficient-data"},"source":{"url":"https://arxiv.org/abs/1908.06077","title":"NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/fartashf/nuqsgd","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Data Parallel Methods","url":"/methods/category/data-parallel-methods","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/nuqsgd-provably-communication-efficient-data","slug":"nuqsgd-provably-communication-efficient-data","title":"NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization","date":"2021-04-28","arxiv_id":"2104.13818","n_code_links":0,"syntology":null}],"papers_shown":1,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":1,"with_a_code_link":0,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":1,"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/quantization","name":"Quantization","papers":1}],"tasks_shown":1,"n_tasks":1,"usage_by_year":[{"year":"2021","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/nuqsgd"},"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=NUQSGD","read_at":"2026-10-05T00:59:47+00:00","query":"NUQSGD","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":"2104.13818","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":false,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"1908.06077","title":"NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization","citations":null,"named_by":["title_prefix"],"bearer_name":"NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization","ask_with":"have('1908.06077')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'NUQSGD' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization' (arXiv:1908.06077, citations not recorded). None of them is a well-cited bearer of the name, so this is still a coverage gap for any better-known sense -- they are listed so you can judge, not as a substitute."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization” (arXiv:1908.06077, citations not recorded). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute.","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":"b508b463565704eae7d4e4afc5316cd9a77eddf29f64f1c94d49abd6d06b640c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}