{"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/a-factor-graph-approach-to-automated-design","title":"A Factor Graph Approach to Automated Design of Bayesian Signal Processing Algorithms","arxiv_id":"1811.03407","date":"2018-11-08","proceeding":null,"authors":["Marco Cox","Thijs van de Laar","Bert de Vries"],"abstract":"The benefits of automating design cycles for Bayesian inference-based\nalgorithms are becoming increasingly recognized by the machine learning\ncommunity. As a result, interest in probabilistic programming frameworks has\nmuch increased over the past few years. This paper explores a specific\nprobabilistic programming paradigm, namely message passing in Forney-style\nfactor graphs (FFGs), in the context of automated design of efficient Bayesian\nsignal processing algorithms. To this end, we developed \"ForneyLab\"\n(https://github.com/biaslab/ForneyLab.jl) as a Julia toolbox for message\npassing-based inference in FFGs. We show by example how ForneyLab enables\nautomatic derivation of Bayesian signal processing algorithms, including\nalgorithms for parameter estimation and model comparison. Crucially, due to the\nmodular makeup of the FFG framework, both the model specification and inference\nmethods are readily extensible in ForneyLab. In order to test this framework,\nwe compared variational message passing as implemented by ForneyLab with\nautomatic differentiation variational inference (ADVI) and Monte Carlo methods\nas implemented by state-of-the-art tools \"Edward\" and \"Stan\". In terms of\nperformance, extensibility and stability issues, ForneyLab appears to enjoy an\nedge relative to its competitors for automated inference in state-space models.","url_abs":"http://arxiv.org/abs/1811.03407v1","url_pdf":"http://arxiv.org/pdf/1811.03407v1.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":"a-factor-graph-approach-to-automated-design","repo_url":"https://github.com/biaslab/ForneyLab.jl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"},{"task_slug":"probabilistic-programming","task_name":"Probabilistic Programming"},{"task_slug":"state-space-models","task_name":"State Space Models"},{"task_slug":"variational-inference","task_name":"Variational Inference"},{"task_slug":"parameter-estimation","task_name":"parameter estimation"}],"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":"biaslab/ForneyLab.jl","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":"3eed4f4a53f00b298b64f11a4fc493b9ca5adddff776d1dcec7b5d4d227138c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}