{"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":"/paper/gradnorm-gradient-normalization-for-adaptive","title":"GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networks","arxiv_id":"1711.02257","date":"2017-11-07","proceeding":"ICML 2018 7","authors":["Zhao Chen","Vijay Badrinarayanan","Chen-Yu Lee","Andrew Rabinovich"],"abstract":"Deep multitask networks, in which one neural network produces multiple\npredictive outputs, can offer better speed and performance than their\nsingle-task counterparts but are challenging to train properly. We present a\ngradient normalization (GradNorm) algorithm that automatically balances\ntraining in deep multitask models by dynamically tuning gradient magnitudes. We\nshow that for various network architectures, for both regression and\nclassification tasks, and on both synthetic and real datasets, GradNorm\nimproves accuracy and reduces overfitting across multiple tasks when compared\nto single-task networks, static baselines, and other adaptive multitask loss\nbalancing techniques. GradNorm also matches or surpasses the performance of\nexhaustive grid search methods, despite only involving a single asymmetry\nhyperparameter $\\alpha$. Thus, what was once a tedious search process that\nincurred exponentially more compute for each task added can now be accomplished\nwithin a few training runs, irrespective of the number of tasks. Ultimately, we\nwill demonstrate that gradient manipulation affords us great control over the\ntraining dynamics of multitask networks and may be one of the keys to unlocking\nthe potential of multitask learning.","url_abs":"http://arxiv.org/abs/1711.02257v4","url_pdf":"http://arxiv.org/pdf/1711.02257v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"gradnorm-gradient-normalization-for-adaptive","repo_url":"https://github.com/VICO-UoE/KD4MTL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"gradnorm-gradient-normalization-for-adaptive","repo_url":"https://github.com/choltz95/MTGP-NN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"gradnorm-gradient-normalization-for-adaptive","repo_url":"https://github.com/hav4ik/Hydra","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"gradnorm-gradient-normalization-for-adaptive","repo_url":"https://github.com/AvivNavon/AuxiLearn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.02257","atlas_url":"https://app.syntology.ai/?focus=1711.02257","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1711.02257"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.02257\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.02257"},"call":"get_concepts_for_paper(arxiv_id=\"1711.02257\")"}],"by_repo":[{"repo":"VICO-UoE/KD4MTL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2007.06889"],"harvested_for_calls":[{"arxiv_id":"2007.06889","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.06889"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.06889\")"}]},{"repo":"choltz95/MTGP-NN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hav4ik/Hydra","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1810.04650"],"harvested_for_calls":[{"arxiv_id":"1810.04650","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1810.04650"},"call":"get_harvested_code_for_paper(arxiv_id=\"1810.04650\")"}]},{"repo":"AvivNavon/AuxiLearn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2007.02693"],"harvested_for_calls":[{"arxiv_id":"2007.02693","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.02693"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.02693\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"fe572f30eb0abf67bb35bcf1fed3dc0cebeb836975ff24b037570db44c0e11d5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}