{"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/structured-bayesian-pruning-via-log-normal","title":"Structured Bayesian Pruning via Log-Normal Multiplicative Noise","arxiv_id":"1705.07283","date":"2017-05-20","proceeding":"NeurIPS 2017 12","authors":["Kirill Neklyudov","Dmitry Molchanov","Arsenii Ashukha","Dmitry Vetrov"],"abstract":"Dropout-based regularization methods can be regarded as injecting random\nnoise with pre-defined magnitude to different parts of the neural network\nduring training. It was recently shown that Bayesian dropout procedure not only\nimproves generalization but also leads to extremely sparse neural architectures\nby automatically setting the individual noise magnitude per weight. However,\nthis sparsity can hardly be used for acceleration since it is unstructured. In\nthe paper, we propose a new Bayesian model that takes into account the\ncomputational structure of neural networks and provides structured sparsity,\ne.g. removes neurons and/or convolutional channels in CNNs. To do this we\ninject noise to the neurons outputs while keeping the weights unregularized. We\nestablish the probabilistic model with a proper truncated log-uniform prior\nover the noise and truncated log-normal variational approximation that ensures\nthat the KL-term in the evidence lower bound is computed in closed-form. The\nmodel leads to structured sparsity by removing elements with a low SNR from the\ncomputation graph and provides significant acceleration on a number of deep\nneural architectures. The model is easy to implement as it can be formulated as\na separate dropout-like layer.","url_abs":"http://arxiv.org/abs/1705.07283v2","url_pdf":"http://arxiv.org/pdf/1705.07283v2.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":"structured-bayesian-pruning-via-log-normal","repo_url":"https://github.com/necludov/group-sparsity-sbp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"structured-bayesian-pruning-via-log-normal","repo_url":"https://github.com/ars-ashuha/variational-dropout-sparsifies-dnn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"structured-bayesian-pruning-via-log-normal","repo_url":"https://github.com/maxblumental/variational-drouput","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"structured-bayesian-pruning-via-log-normal","repo_url":"https://github.com/senya-ashukha/variational-dropout-sparsifies-dnn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"structured-bayesian-pruning-via-log-normal","repo_url":"https://github.com/xaosina/Struct-Sparse-Pruning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[],"methods":[{"method_slug":"dropout","method_name":"Dropout"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.07283","atlas_url":"https://app.syntology.ai/?focus=1705.07283","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":"1705.07283"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.07283\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.07283"},"call":"get_concepts_for_paper(arxiv_id=\"1705.07283\")"}],"by_repo":[{"repo":"necludov/group-sparsity-sbp","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ars-ashuha/variational-dropout-sparsifies-dnn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"maxblumental/variational-drouput","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"senya-ashukha/variational-dropout-sparsifies-dnn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xaosina/Struct-Sparse-Pruning","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":"5a89417d69259cdb2533db09f54ca13d88f3f60770135da6e68ae99637b7f9e2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}