<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Finite size corrections for neural network Gaussian processes · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1908.10030/</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/1908.10030/feed.xml" rel="self" type="application/rss+xml" /><item><title>Finite size corrections for neural network Gaussian processes — mentioned by antognini</title><link>https://news.ycombinator.com/item?id=21654928</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.10030:21654928</guid><pubDate>Thu, 28 Nov 2019 05:53:29 GMT</pubDate><description>&lt;p&gt;If you take the sum of a large, but finite number of random variates from a probability distribution you can show that the resulting distribution is approximately a Gaussian perturbed by Hermite polynomials. The size of these perturbations decays inversely with the order of the polynomial divided by two minus one. This is the so-called Edgeworth expansion. I found this chapter to have a good explanation of the Edgeworth expansion if you&amp;#x27;re interested in more detail: http://web.math.ku.dk/~erhansen/bootstrap_05/doku/noter/Edge... I had a little workshop paper earlier this year showing that you…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.10030/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
