{"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/deep-neural-networks-as-gaussian-processes","title":"Deep Neural Networks as Gaussian Processes","arxiv_id":"1711.00165","date":"2017-11-01","proceeding":"ICLR 2018 1","authors":["Jaehoon Lee","Yasaman Bahri","Roman Novak","Samuel S. Schoenholz","Jeffrey Pennington","Jascha Sohl-Dickstein"],"abstract":"It has long been known that a single-layer fully-connected neural network\nwith an i.i.d. prior over its parameters is equivalent to a Gaussian process\n(GP), in the limit of infinite network width. This correspondence enables exact\nBayesian inference for infinite width neural networks on regression tasks by\nmeans of evaluating the corresponding GP. Recently, kernel functions which\nmimic multi-layer random neural networks have been developed, but only outside\nof a Bayesian framework. As such, previous work has not identified that these\nkernels can be used as covariance functions for GPs and allow fully Bayesian\nprediction with a deep neural network.\n  In this work, we derive the exact equivalence between infinitely wide deep\nnetworks and GPs. We further develop a computationally efficient pipeline to\ncompute the covariance function for these GPs. We then use the resulting GPs to\nperform Bayesian inference for wide deep neural networks on MNIST and CIFAR-10.\nWe observe that trained neural network accuracy approaches that of the\ncorresponding GP with increasing layer width, and that the GP uncertainty is\nstrongly correlated with trained network prediction error. We further find that\ntest performance increases as finite-width trained networks are made wider and\nmore similar to a GP, and thus that GP predictions typically outperform those\nof finite-width networks. Finally we connect the performance of these GPs to\nthe recent theory of signal propagation in random neural networks.","url_abs":"http://arxiv.org/abs/1711.00165v3","url_pdf":"http://arxiv.org/pdf/1711.00165v3.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":"deep-neural-networks-as-gaussian-processes","repo_url":"https://github.com/brain-research/nngp","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"deep-neural-networks-as-gaussian-processes","repo_url":"https://github.com/chrhenning/uncertainty_based_ood","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"deep-neural-networks-as-gaussian-processes","repo_url":"https://github.com/google/wide_bnn_sampling","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":null},{"paper_slug":"deep-neural-networks-as-gaussian-processes","repo_url":"https://github.com/jxVmnLgedVwv6mNcGCBy/NNspectra","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"deep-neural-networks-as-gaussian-processes","repo_url":"https://github.com/kmatt10/DNNGP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"deep-neural-networks-as-gaussian-processes","repo_url":"https://github.com/thegregyang/NNspectra","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"deep-neural-networks-as-gaussian-processes","repo_url":"https://github.com/yumaloop/dnn_hsic","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"},{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.00165","atlas_url":"https://app.syntology.ai/?focus=1711.00165","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":"1711.00165"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.00165\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.00165"},"call":"get_concepts_for_paper(arxiv_id=\"1711.00165\")"}],"by_repo":[{"repo":"brain-research/nngp","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1912.02803"],"harvested_for_calls":[{"arxiv_id":"1912.02803","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1912.02803"},"call":"get_harvested_code_for_paper(arxiv_id=\"1912.02803\")"}]},{"repo":"chrhenning/uncertainty_based_ood","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2107.12248"],"harvested_for_calls":[{"arxiv_id":"2107.12248","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.12248"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.12248\")"}]},{"repo":"google/wide_bnn_sampling","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2206.07673"],"harvested_for_calls":[{"arxiv_id":"2206.07673","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.07673"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.07673\")"}]},{"repo":"jxVmnLgedVwv6mNcGCBy/NNspectra","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kmatt10/DNNGP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"thegregyang/NNspectra","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1907.10599"],"harvested_for_calls":[{"arxiv_id":"1907.10599","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.10599"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.10599\")"}]},{"repo":"yumaloop/dnn_hsic","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"7b3db695998fe5345673eca44ca2b79801d09a0cadbfa57a59fffd6e14d0ed91","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}