{"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/on-neural-networks-as-infinite-tree","title":"On Neural Networks as Infinite Tree-Structured Probabilistic Graphical Models","arxiv_id":"2305.17583","date":"2023-05-27","proceeding":null,"authors":["Boyao Li","Alexander J. Thomson","Houssam Nassif","Matthew M. Engelhard","David Page"],"abstract":"Deep neural networks (DNNs) lack the precise semantics and definitive probabilistic interpretation of probabilistic graphical models (PGMs). In this paper, we propose an innovative solution by constructing infinite tree-structured PGMs that correspond exactly to neural networks. Our research reveals that DNNs, during forward propagation, indeed perform approximations of PGM inference that are precise in this alternative PGM structure. Not only does our research complement existing studies that describe neural networks as kernel machines or infinite-sized Gaussian processes, it also elucidates a more direct approximation that DNNs make to exact inference in PGMs. Potential benefits include improved pedagogy and interpretation of DNNs, and algorithms that can merge the strengths of PGMs and DNNs.","url_abs":"https://arxiv.org/abs/2305.17583v5","url_pdf":"https://arxiv.org/pdf/2305.17583v5.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":"on-neural-networks-as-infinite-tree","repo_url":"https://github.com/engelhard-lab/dnn_treepgm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"}],"methods":[{"method_slug":"pgm","method_name":"PGM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.17583","atlas_url":"https://app.syntology.ai/?focus=2305.17583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17583"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/engelhard-lab/dnn_treepgm","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":7},"by_repo_kind":{"official":{"samples":7,"ran":0,"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":0,"samples":[{"code_sha256_prefix":"d34f7dd289b54567","entry":"cont_bern_log_norm","repo":"engelhard-lab/dnn_treepgm","repo_kind":"official","path":"model.py","file_url":"https://github.com/engelhard-lab/dnn_treepgm/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d34f7dd289b54567"}},{"code_sha256_prefix":"9fe2624d6c30505c","entry":"covertype","repo":"engelhard-lab/dnn_treepgm","repo_kind":"official","path":"datagen.py","file_url":"https://github.com/engelhard-lab/dnn_treepgm/blob/HEAD/datagen.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9fe2624d6c30505c"}},{"code_sha256_prefix":"c9160cab40cffc68","entry":"get_pdf_dataset","repo":"engelhard-lab/dnn_treepgm","repo_kind":"official","path":"synthetic.py","file_url":"https://github.com/engelhard-lab/dnn_treepgm/blob/HEAD/synthetic.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c9160cab40cffc68"}},{"code_sha256_prefix":"cecdb4590b47072c","entry":"make_digit","repo":"engelhard-lab/dnn_treepgm","repo_kind":"official","path":"datagen.py","file_url":"https://github.com/engelhard-lab/dnn_treepgm/blob/HEAD/datagen.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cecdb4590b47072c"}},{"code_sha256_prefix":"8182061f5e947d2b","entry":"make_moon","repo":"engelhard-lab/dnn_treepgm","repo_kind":"official","path":"datagen.py","file_url":"https://github.com/engelhard-lab/dnn_treepgm/blob/HEAD/datagen.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8182061f5e947d2b"}},{"code_sha256_prefix":"8f3c00e6c1d9e951","entry":"normal_logpdf","repo":"engelhard-lab/dnn_treepgm","repo_kind":"official","path":"model.py","file_url":"https://github.com/engelhard-lab/dnn_treepgm/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8f3c00e6c1d9e951"}},{"code_sha256_prefix":"3599f178c703e331","entry":"sampling","repo":"engelhard-lab/dnn_treepgm","repo_kind":"official","path":"synthetic.py","file_url":"https://github.com/engelhard-lab/dnn_treepgm/blob/HEAD/synthetic.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3599f178c703e331"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}