{"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/a-tail-index-analysis-of-stochastic-gradient","title":"A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networks","arxiv_id":"1901.06053","date":"2019-01-18","proceeding":null,"authors":["Umut Simsekli","Levent Sagun","Mert Gurbuzbalaban"],"abstract":"The gradient noise (GN) in the stochastic gradient descent (SGD) algorithm is\noften considered to be Gaussian in the large data regime by assuming that the\nclassical central limit theorem (CLT) kicks in. This assumption is often made\nfor mathematical convenience, since it enables SGD to be analyzed as a\nstochastic differential equation (SDE) driven by a Brownian motion. We argue\nthat the Gaussianity assumption might fail to hold in deep learning settings\nand hence render the Brownian motion-based analyses inappropriate. Inspired by\nnon-Gaussian natural phenomena, we consider the GN in a more general context\nand invoke the generalized CLT (GCLT), which suggests that the GN converges to\na heavy-tailed $\\alpha$-stable random variable. Accordingly, we propose to\nanalyze SGD as an SDE driven by a L\\'{e}vy motion. Such SDEs can incur `jumps',\nwhich force the SDE transition from narrow minima to wider minima, as proven by\nexisting metastability theory. To validate the $\\alpha$-stable assumption, we\nconduct extensive experiments on common deep learning architectures and show\nthat in all settings, the GN is highly non-Gaussian and admits heavy-tails. We\nfurther investigate the tail behavior in varying network architectures and\nsizes, loss functions, and datasets. Our results open up a different\nperspective and shed more light on the belief that SGD prefers wide minima.","url_abs":"http://arxiv.org/abs/1901.06053v1","url_pdf":"http://arxiv.org/pdf/1901.06053v1.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":"a-tail-index-analysis-of-stochastic-gradient","repo_url":"https://github.com/umutsimsekli/sgd_tail_index","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[],"methods":[{"method_slug":"sgd","method_name":"SGD"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.06053","atlas_url":"https://app.syntology.ai/?focus=1901.06053","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":"1901.06053"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.06053\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.06053"},"call":"get_concepts_for_paper(arxiv_id=\"1901.06053\")"}],"by_repo":[{"repo":"umutsimsekli/sgd_tail_index","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"4a369f2fb5690c6f54ddb98cb15d895b085306bc82830ec2090a6b66ad7bebbb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}