<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning unknown ODE models with Gaussian processes · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1803.04303/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1803.04303/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning unknown ODE models with Gaussian processes — mentioned by duvenaud</title><link>https://news.ycombinator.com/item?id=18678251</link><guid isPermaLink="false">urn:hackerpapers:mention:1803.04303:18678251</guid><pubDate>Fri, 14 Dec 2018 03:35:18 GMT</pubDate><description>&lt;p&gt;Ooo, great question. In both cases, we define a function using a sum over an infinite number of infinitesimal things. In the GP case, those things are random and independent of each other, so the central limit theorem applies and we get a simple Gaussian. In the ODE case, the infinitesimals are deterministic and depend on the previous ones in the sequence, so the final answer is deterministic and impossible to compute exactly in general. You could also use a GP to model the dynamics of an ODE, and this was done recently: [https://arxiv.org/abs/1803.04303] although the drawback was that they…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1803.04303/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
