{"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/tasknorm-rethinking-batch-normalization-for","title":"TaskNorm: Rethinking Batch Normalization for Meta-Learning","arxiv_id":"2003.03284","date":"2020-03-06","proceeding":"ICML 2020 1","authors":["John Bronskill","Jonathan Gordon","James Requeima","Sebastian Nowozin","Richard E. Turner"],"abstract":"Modern meta-learning approaches for image classification rely on increasingly deep networks to achieve state-of-the-art performance, making batch normalization an essential component of meta-learning pipelines. However, the hierarchical nature of the meta-learning setting presents several challenges that can render conventional batch normalization ineffective, giving rise to the need to rethink normalization in this setting. We evaluate a range of approaches to batch normalization for meta-learning scenarios, and develop a novel approach that we call TaskNorm. Experiments on fourteen datasets demonstrate that the choice of batch normalization has a dramatic effect on both classification accuracy and training time for both gradient based and gradient-free meta-learning approaches. Importantly, TaskNorm is found to consistently improve performance. Finally, we provide a set of best practices for normalization that will allow fair comparison of meta-learning algorithms.","url_abs":"https://arxiv.org/abs/2003.03284v2","url_pdf":"https://arxiv.org/pdf/2003.03284v2.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":"tasknorm-rethinking-batch-normalization-for","repo_url":"https://github.com/cambridge-mlg/cnaps","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"tasknorm-rethinking-batch-normalization-for","repo_url":"https://github.com/fmu2/PyTorch-MAML","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"meta-learning","task_name":"Meta-Learning"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[{"method_slug":"batch-normalization","method_name":"Batch Normalization"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2003.03284","atlas_url":"https://app.syntology.ai/?focus=2003.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03284"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.03284"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.03284"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.03284\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2003.03284"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2003.03284\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2003.03284"},"call":"get_concepts_for_paper(arxiv_id=\"2003.03284\")"}],"by_repo":[{"repo":"cambridge-mlg/cnaps","kind":"official","samples":8,"ran":6,"instrument":3,"unverified":2},{"repo":"fmu2/PyTorch-MAML","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.03400"],"harvested_for_calls":[{"arxiv_id":"1703.03400","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.03400"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.03400\")"}]}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2003.03284.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2003.03284.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/fmu2/PyTorch-MAML","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/cambridge-mlg/cnaps","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_draft_wrong":3,"ran":3,"unverified":2},"n_samples":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":8,"ran":6,"n_ran_checked":3,"n_instrument":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":2,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":4,"n_ran_without_level_date":2,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-26","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"d9def42110729a85","code_sha256_prefix":"d9def42110729a85","entry":"conv1x1","repo":"cambridge-mlg/cnaps","repo_kind":"official","path":"src/resnet.py","file_url":"https://github.com/cambridge-mlg/cnaps/blob/HEAD/src/resnet.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int","fixture_out_type":"Conv2d","code_page":"/code/conv1x1","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d9def42110729a85"}},{"code_sha256":"fac5364e2f53c6db","code_sha256_prefix":"fac5364e2f53c6db","entry":"conv3x3","repo":"cambridge-mlg/cnaps","repo_kind":"official","path":"src/resnet.py","file_url":"https://github.com/cambridge-mlg/cnaps/blob/HEAD/src/resnet.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int","fixture_out_type":"Conv2d","code_page":"/code/conv3x3","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from lixiaotong97/DSU, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"fac5364e2f53c6db"}},{"code_sha256":"f87065055026fb7b","code_sha256_prefix":"f87065055026fb7b","entry":"get_log_files","repo":"cambridge-mlg/cnaps","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/cambridge-mlg/cnaps/blob/HEAD/src/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"checkpoint_dir:str/0/str, resume:bool/0/bool, test_mode:bool/0/bool","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T08:34:48.807261+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f87065055026fb7b"}},{"code_sha256":"083d7c12137fe0b7","code_sha256_prefix":"083d7c12137fe0b7","entry":"mean_pooling","repo":"cambridge-mlg/cnaps","repo_kind":"official","path":"src/set_encoder.py","file_url":"https://github.com/cambridge-mlg/cnaps/blob/HEAD/src/set_encoder.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:Tensor/2/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","retrieve_with":{"tool":"get_code","code_sha256":"083d7c12137fe0b7"},"code_page":"/code/mean-pooling","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"083d7c12137fe0b7"}},{"code_sha256":"36faaa70bb298474","code_sha256_prefix":"36faaa70bb298474","entry":"split_first_dim_linear","repo":"cambridge-mlg/cnaps","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/cambridge-mlg/cnaps/blob/HEAD/src/utils.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"x:Tensor/2/float, first_two_dims:list/1/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Anirudh257/strm, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"36faaa70bb298474"}},{"code_sha256":"70f3ccf89a0a79b7","code_sha256_prefix":"70f3ccf89a0a79b7","entry":"stack_first_dim","repo":"cambridge-mlg/cnaps","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/cambridge-mlg/cnaps/blob/HEAD/src/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:Tensor/4/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","retrieve_with":{"tool":"get_code","code_sha256":"70f3ccf89a0a79b7"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"70f3ccf89a0a79b7"}},{"code_sha256":"aa122878d6a7b1b3","code_sha256_prefix":"aa122878d6a7b1b3","entry":"process_cifar","repo":"cambridge-mlg/cnaps","repo_kind":"official","path":"src/prepare_extra_datasets.py","file_url":"https://github.com/cambridge-mlg/cnaps/blob/HEAD/src/prepare_extra_datasets.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"aa122878d6a7b1b3"}},{"code_sha256":"b3b6db52dd02d932","code_sha256_prefix":"b3b6db52dd02d932","entry":"process_mnist","repo":"cambridge-mlg/cnaps","repo_kind":"official","path":"src/prepare_extra_datasets.py","file_url":"https://github.com/cambridge-mlg/cnaps/blob/HEAD/src/prepare_extra_datasets.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b3b6db52dd02d932"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1b416dd51dcc3b933a8bc5755ac7b49c7b6f49c7ccd96b0ec47e819b17529123","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}