{"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/gaussian-gated-linear-networks","title":"Gaussian Gated Linear Networks","arxiv_id":"2006.05964","date":"2020-06-10","proceeding":"NeurIPS 2020 12","authors":["David Budden","Adam Marblestone","Eren Sezener","Tor Lattimore","Greg Wayne","Joel Veness"],"abstract":"We propose the Gaussian Gated Linear Network (G-GLN), an extension to the recently proposed GLN family of deep neural networks. Instead of using backpropagation to learn features, GLNs have a distributed and local credit assignment mechanism based on optimizing a convex objective. This gives rise to many desirable properties including universality, data-efficient online learning, trivial interpretability and robustness to catastrophic forgetting. We extend the GLN framework from classification to multiple regression and density modelling by generalizing geometric mixing to a product of Gaussian densities. The G-GLN achieves competitive or state-of-the-art performance on several univariate and multivariate regression benchmarks, and we demonstrate its applicability to practical tasks including online contextual bandits and density estimation via denoising.","url_abs":"https://arxiv.org/abs/2006.05964v2","url_pdf":"https://arxiv.org/pdf/2006.05964v2.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":"gaussian-gated-linear-networks","repo_url":"https://github.com/deepmind/deepmind-research/tree/master/gated_linear_networks","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"gaussian-gated-linear-networks","repo_url":"https://github.com/2023-MindSpore-4/Code12/tree/main/d2l/chapter_03_linear-networks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"gaussian-gated-linear-networks","repo_url":"https://github.com/MindCode-4/code-7/tree/main/gaussian_adaptive_attention","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"density-estimation","task_name":"Density Estimation"},{"task_slug":"multi-armed-bandits","task_name":"Multi-Armed Bandits"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"g-gln","method_name":"G-GLN"},{"method_slug":"g-gln-neuron","method_name":"G-GLN Neuron"},{"method_slug":"gln","method_name":"GLN"},{"method_slug":"interpretability","method_name":"Interpretability"}],"datasets_introduced":[],"methods_introduced":[{"slug":"g-gln","name":"G-GLN","full_name":"Gaussian Gated Linear Network"},{"slug":"g-gln-neuron","name":"G-GLN Neuron","full_name":"G-GLN Neuron"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2006.05964","atlas_url":"https://app.syntology.ai/?focus=2006.05964","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":"2006.05964"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2006.05964\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2006.05964"},"call":"get_concepts_for_paper(arxiv_id=\"2006.05964\")"}],"by_repo":[{"repo":"deepmind/deepmind-research","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["2006.12982","2101.08692","2103.03206","2105.14039"],"harvested_for_calls":[{"arxiv_id":"2006.12982","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.12982"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.12982\")"},{"arxiv_id":"2101.08692","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2101.08692"},"call":"get_harvested_code_for_paper(arxiv_id=\"2101.08692\")"},{"arxiv_id":"2103.03206","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.03206"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.03206\")"},{"arxiv_id":"2105.14039","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.14039"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.14039\")"}]},{"repo":"2023-MindSpore-4/Code12","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindCode-4/code-7","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2407.00342"],"harvested_for_calls":[{"arxiv_id":"2407.00342","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.00342"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.00342\")"}]}],"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":"c7e131a45581a158ea51f78e078722881ba2dc2d41ce566ae1da595fe10b72b5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}