{"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/stochastic-normalization","title":"Stochastic Normalization","arxiv_id":null,"date":"2020-12-01","proceeding":"NeurIPS 2020 12","authors":["Zhi Kou","Kaichao You","Mingsheng Long","Jianmin Wang"],"abstract":"Fine-tuning pre-trained deep networks on a small dataset is an important component in the deep learning pipeline. A critical problem in fine-tuning is how to avoid over-fitting when data are limited. Existing efforts work from two aspects: (1) impose regularization on parameters or features; (2) transfer prior knowledge to fine-tuning by reusing pre-trained parameters. In this paper, we take an alternative approach by refactoring the widely used Batch Normalization (BN) module to mitigate over-fitting. We propose a two-branch design with one branch normalized by mini-batch statistics and the other branch normalized by moving statistics. During training, two branches are stochastically selected to avoid over-depending on some sample statistics, resulting in a strong regularization effect, which we interpret as ``architecture regularization.'' The resulting method is dubbed stochastic normalization (\\textbf{StochNorm}). With the two-branch architecture, it naturally incorporates pre-trained moving statistics in BN layers during fine-tuning, exploiting more prior knowledge of pre-trained networks. Extensive empirical experiments show that StochNorm is a powerful tool to avoid over-fitting in fine-tuning with small datasets. Besides, StochNorm is readily pluggable in modern CNN backbones. It is complementary to other fine-tuning methods and can work together to achieve stronger regularization effect.","url_abs":"http://proceedings.neurips.cc/paper/2020/hash/bc573864331a9e42e4511de6f678aa83-Abstract.html","url_pdf":"http://proceedings.neurips.cc/paper/2020/file/bc573864331a9e42e4511de6f678aa83-Paper.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":"stochastic-normalization","repo_url":"https://github.com/thuml/StochNorm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"stochastic-normalization","repo_url":"https://github.com/thuml/Transfer-Learning-Library","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[],"methods":[{"method_slug":"batch-normalization","method_name":"Batch Normalization"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"thuml/StochNorm","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"thuml/Transfer-Learning-Library","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":7,"harvested_for":["1409.7495","1502.02791","1607.01719","1702.05464","1811.12833","1904.05801","2001.01526"],"harvested_for_calls":[{"arxiv_id":"1409.7495","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1409.7495"},"call":"get_harvested_code_for_paper(arxiv_id=\"1409.7495\")"},{"arxiv_id":"1502.02791","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1502.02791"},"call":"get_harvested_code_for_paper(arxiv_id=\"1502.02791\")"},{"arxiv_id":"1607.01719","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.01719"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.01719\")"},{"arxiv_id":"1702.05464","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1702.05464"},"call":"get_harvested_code_for_paper(arxiv_id=\"1702.05464\")"},{"arxiv_id":"1811.12833","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1811.12833"},"call":"get_harvested_code_for_paper(arxiv_id=\"1811.12833\")"},{"arxiv_id":"1904.05801","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.05801"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.05801\")"},{"arxiv_id":"2001.01526","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.01526"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.01526\")"}]}],"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":"2dba2a18c280096ebc896389a58ce1f79c084e68739ddd2607a91f11e1cd1e3d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}