{"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/learning-graph-structured-sum-product","title":"Learning Graph-Structured Sum-Product Networks for Probabilistic Semantic Maps","arxiv_id":"1709.08274","date":"2017-09-24","proceeding":null,"authors":["Kaiyu Zheng","Andrzej Pronobis","Rajesh P. N. Rao"],"abstract":"We introduce Graph-Structured Sum-Product Networks (GraphSPNs), a\nprobabilistic approach to structured prediction for problems where dependencies\nbetween latent variables are expressed in terms of arbitrary, dynamic graphs.\nWhile many approaches to structured prediction place strict constraints on the\ninteractions between inferred variables, many real-world problems can be only\ncharacterized using complex graph structures of varying size, often\ncontaminated with noise when obtained from real data. Here, we focus on one\nsuch problem in the domain of robotics. We demonstrate how GraphSPNs can be\nused to bolster inference about semantic, conceptual place descriptions using\nnoisy topological relations discovered by a robot exploring large-scale office\nspaces. Through experiments, we show that GraphSPNs consistently outperform the\ntraditional approach based on undirected graphical models, successfully\ndisambiguating information in global semantic maps built from uncertain, noisy\nlocal evidence. We further exploit the probabilistic nature of the model to\ninfer marginal distributions over semantic descriptions of as yet unexplored\nplaces and detect spatial environment configurations that are novel and\nincongruent with the known evidence.","url_abs":"http://arxiv.org/abs/1709.08274v2","url_pdf":"http://arxiv.org/pdf/1709.08274v2.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":"learning-graph-structured-sum-product","repo_url":"https://github.com/zkytony/graphspn","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"structured-prediction","task_name":"Structured Prediction"}],"methods":[],"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":"zkytony/graphspn","kind":"official","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":"c4b8d5a792c967b982320b1b8b63c8c342dc04c92888158501e4740421244b3a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}