<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fundamental Linear Algebra Problem of Gaussian Inference · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2010.08022/</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/2010.08022/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fundamental Linear Algebra Problem of Gaussian Inference — mentioned by shoo</title><link>https://news.ycombinator.com/item?id=28368529</link><guid isPermaLink="false">urn:hackerpapers:mention:2010.08022:28368529</guid><pubDate>Tue, 31 Aug 2021 14:27:09 GMT</pubDate><description>&lt;p&gt;&amp;gt; Theoretical grounds for applying the same update rules to loopy graphs were later developed that explain loopy BP as an approximate variational inference method in which inference is cast as an optimization problem. Instead of directly minimizing the factor energies (as is done in MAP inference), loopy BP minimizes the KL divergence between the posterior and a variational distribution which we use as a proxy for the marginals after optimization &amp;gt; As the Bethe free energy is non-convex, loopy BP is not guaranteed to converge and even when it does it may converge to the wrong marginals.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2010.08022/"&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>
