{"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-probabilistic-model-for-the-numerical","title":"A probabilistic model for the numerical solution of initial value problems","arxiv_id":"1610.05261","date":"2016-10-17","proceeding":null,"authors":["Michael Schober","Simo Särkkä","Philipp Hennig"],"abstract":"Like many numerical methods, solvers for initial value problems (IVPs) on\nordinary differential equations estimate an analytically intractable quantity,\nusing the results of tractable computations as inputs. This structure is\nclosely connected to the notion of inference on latent variables in statistics.\nWe describe a class of algorithms that formulate the solution to an IVP as\ninference on a latent path that is a draw from a Gaussian process probability\nmeasure (or equivalently, the solution of a linear stochastic differential\nequation). We then show that certain members of this class are connected\nprecisely to generalized linear methods for ODEs, a number of Runge--Kutta\nmethods, and Nordsieck methods. This probabilistic formulation of classic\nmethods is valuable in two ways: analytically, it highlights implicit prior\nassumptions favoring certain approximate solutions to the IVP over others, and\ngives a precise meaning to the old observation that these methods act like\nfilters. Practically, it endows the classic solvers with `docking points' for\nnotions of uncertainty and prior information about the initial value, the value\nof the ODE itself, and the solution of the problem.","url_abs":"http://arxiv.org/abs/1610.05261v3","url_pdf":"http://arxiv.org/pdf/1610.05261v3.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-probabilistic-model-for-the-numerical","repo_url":"https://github.com/MPI-IS/pfos","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1610.05261","atlas_url":"https://app.syntology.ai/?focus=1610.05261","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":"1610.05261"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1610.05261\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1610.05261"},"call":"get_concepts_for_paper(arxiv_id=\"1610.05261\")"}],"by_repo":[{"repo":"MPI-IS/pfos","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":"807b8667eac76ad2778349efee2f0a3cc592fa298e8ceca6a537ce381e6c07f8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}