{"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/scalable-variational-inference-for-dynamical","title":"Scalable Variational Inference for Dynamical Systems","arxiv_id":"1705.07079","date":"2017-05-19","proceeding":"NeurIPS 2017 12","authors":["Nico S. Gorbach","Stefan Bauer","Joachim M. Buhmann"],"abstract":"Gradient matching is a promising tool for learning parameters and state\ndynamics of ordinary differential equations. It is a grid free inference\napproach, which, for fully observable systems is at times competitive with\nnumerical integration. However, for many real-world applications, only sparse\nobservations are available or even unobserved variables are included in the\nmodel description. In these cases most gradient matching methods are difficult\nto apply or simply do not provide satisfactory results. That is why, despite\nthe high computational cost, numerical integration is still the gold standard\nin many applications. Using an existing gradient matching approach, we propose\na scalable variational inference framework which can infer states and\nparameters simultaneously, offers computational speedups, improved accuracy and\nworks well even under model misspecifications in a partially observable system.","url_abs":"http://arxiv.org/abs/1705.07079v2","url_pdf":"http://arxiv.org/pdf/1705.07079v2.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":"scalable-variational-inference-for-dynamical","repo_url":"https://github.com/ngorbach/Variational_Gradient_Matching_for_Dynamical_Systems","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"numerical-integration","task_name":"Numerical Integration"},{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.07079","atlas_url":"https://app.syntology.ai/?focus=1705.07079","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":"1705.07079"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.07079\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.07079"},"call":"get_concepts_for_paper(arxiv_id=\"1705.07079\")"}],"by_repo":[{"repo":"ngorbach/Variational_Gradient_Matching_for_Dynamical_Systems","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":"4229b95ec02d9d5ac27aa4366b5bf031cfff95ecf8e01497efac5e98ad0da84b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}