{"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/geometry-of-the-restricted-boltzmann-machine","title":"Geometry of the restricted Boltzmann machine","arxiv_id":"0908.4425","date":"2009-08-30","proceeding":null,"authors":["Maria Angelica Cueto","Jason Morton","Bernd Sturmfels"],"abstract":"The restricted Boltzmann machine is a graphical model for binary random\nvariables. Based on a complete bipartite graph separating hidden and observed\nvariables, it is the binary analog to the factor analysis model. We study this\ngraphical model from the perspectives of algebraic statistics and tropical\ngeometry, starting with the observation that its Zariski closure is a Hadamard\npower of the first secant variety of the Segre variety of projective lines. We\nderive a dimension formula for the tropicalized model, and we use it to show\nthat the restricted Boltzmann machine is identifiable in many cases. Our\nmethods include coding theory and geometry of linear threshold functions.","url_abs":"http://arxiv.org/abs/0908.4425v1","url_pdf":"http://arxiv.org/pdf/0908.4425v1.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":"geometry-of-the-restricted-boltzmann-machine","repo_url":"https://github.com/Kevin-Sean-Chen/Restriced_Boltzmann_Machine","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"geometry-of-the-restricted-boltzmann-machine","repo_url":"https://github.com/echen/restricted-boltzmann-machines","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"restricted-boltzmann-machine","method_name":"Restricted Boltzmann Machine"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Kevin-Sean-Chen/Restriced_Boltzmann_Machine","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"echen/restricted-boltzmann-machines","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":"d47517ab25d24da0d6a77d189ec28cfd68309433005b8052bbd2d30f9b562742","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}