{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/stochastic-optimization-with-heavy-tailed","title":"Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping","arxiv_id":"2005.10785","date":"2020-05-21","proceeding":"NeurIPS 2020 12","authors":["Eduard Gorbunov","Marina Danilova","Alexander Gasnikov"],"abstract":"In this paper, we propose a new accelerated stochastic first-order method called clipped-SSTM for smooth convex stochastic optimization with heavy-tailed distributed noise in stochastic gradients and derive the first high-probability complexity bounds for this method closing the gap in the theory of stochastic optimization with heavy-tailed noise. Our method is based on a special variant of accelerated Stochastic Gradient Descent (SGD) and clipping of stochastic gradients. We extend our method to the strongly convex case and prove new complexity bounds that outperform state-of-the-art results in this case. Finally, we extend our proof technique and derive the first non-trivial high-probability complexity bounds for SGD with clipping without light-tails assumption on the noise.","url_abs":"https://arxiv.org/abs/2005.10785v2","url_pdf":"https://arxiv.org/pdf/2005.10785v2.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-optimization-with-heavy-tailed","repo_url":"https://github.com/eduardgorbunov/accelerated_clipping","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[{"method_slug":"sgd","method_name":"SGD"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2005.10785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10785"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","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/eduardgorbunov/accelerated_clipping","reach":null}],"summary":{"ran_fixture":2,"unverified":2},"by_repo_kind":{"official":{"samples":4,"ran":2,"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":4,"samples":[{"code_sha256_prefix":"e4200153ce8cef95","entry":"clipped_sgd_const_stepsize_toy_expect","repo":"eduardgorbunov/accelerated_clipping","repo_kind":"official","path":"algorithms.py","file_url":"https://github.com/eduardgorbunov/accelerated_clipping/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"none","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e4200153ce8cef95"}},{"code_sha256_prefix":"7c32bd64d18fddbb","entry":"sgd_const_stepsize_toy_expect","repo":"eduardgorbunov/accelerated_clipping","repo_kind":"official","path":"algorithms.py","file_url":"https://github.com/eduardgorbunov/accelerated_clipping/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"none","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7c32bd64d18fddbb"}},{"code_sha256_prefix":"1ce4134b9609adfc","entry":"clipped_sstm","repo":"eduardgorbunov/accelerated_clipping","repo_kind":"official","path":"algorithms.py","file_url":"https://github.com/eduardgorbunov/accelerated_clipping/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1ce4134b9609adfc"}},{"code_sha256_prefix":"35bd586f016e234f","entry":"sstm","repo":"eduardgorbunov/accelerated_clipping","repo_kind":"official","path":"algorithms.py","file_url":"https://github.com/eduardgorbunov/accelerated_clipping/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"35bd586f016e234f"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}