<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Predictive Coding Approximates Backprop along Arbitrary Computation Graphs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.04182/</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/2006.04182/feed.xml" rel="self" type="application/rss+xml" /><item><title>Predictive Coding Approximates Backprop along Arbitrary Computation Graphs — mentioned by macrolime</title><link>https://news.ycombinator.com/item?id=40334249</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.04182:40334249</guid><pubDate>Sun, 12 May 2024 13:24:55 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s not really all that useful for AI training. The reason why energy is a problem for AI training is that you need a lot of compute at one place, distributing backpropagation doesn&amp;#x27;t work that well. When the energy problems hit, it&amp;#x27;s when the datacenter need exceeds the capacity of nearby power plants. If we want an alternative I think we&amp;#x27;d need to try alternative training algorithms that are easier to distribute. Predictive coding for example can approximate backprop, but requires more compute. Something in that direction might work https://arxiv.org/abs/2006.04182&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.04182/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Predictive Coding Approximates Backprop along Arbitrary Computation Graphs — mentioned by kelseyfrog</title><link>https://news.ycombinator.com/item?id=37468856</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.04182:37468856</guid><pubDate>Mon, 11 Sep 2023 15:36:51 GMT</pubDate><description>&lt;p&gt;To add, there is a whole field of biologically-plausible learning. Predictive coding is one such method. It is isomorphic to SGD[1], and doesn&amp;#x27;t require global computation. ie it&amp;#x27;s backprop-free optimization. Although slower than SGD on silicon, it&amp;#x27;s massively parallelizible which ends up making it more biologically plausible rather than less. 1. 2020 PREDICTIVE CODING APPROXIMATES BACKPROP ALONG ARBITRARY COMPUTATION GRAPHS https://arxiv.org/pdf/2006.04182.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.04182/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Predictive Coding Approximates Backprop along Arbitrary Computation Graphs — mentioned by canjobear</title><link>https://news.ycombinator.com/item?id=36265467</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.04182:36265467</guid><pubDate>Fri, 09 Jun 2023 22:59:42 GMT</pubDate><description>&lt;p&gt;Approximately, via predictive coding https://arxiv.org/abs/2006.04182&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.04182/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Predictive Coding Approximates Backprop along Arbitrary Computation Graphs — HN submission</title><link>https://news.ycombinator.com/item?id=27015415</link><guid isPermaLink="false">urn:hackerpapers:submission:2006.04182:27015415</guid><pubDate>Sun, 02 May 2021 14:06:44 GMT</pubDate><description>&lt;p&gt;Predictive Coding Approximates Backprop Along Arbitrary Computation Graphs (2020)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;65 points; 9 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2006.04182/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Predictive Coding Approximates Backprop along Arbitrary Computation Graphs — mentioned by etienne618</title><link>https://news.ycombinator.com/item?id=26983191</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.04182:26983191</guid><pubDate>Thu, 29 Apr 2021 16:28:19 GMT</pubDate><description>&lt;p&gt;It seems that backpropagation might be a good abstraction for biological learing rules after all: &amp;quot;local predictive coding converges asymptotically (and in practice rapidly) to exact backprop gradients on arbitrary computation graphs using only local learning rules&amp;quot; from https://arxiv.org/abs/2006.04182&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.04182/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Predictive Coding Approximates Backprop along Arbitrary Computation Graphs — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=26915698</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.04182:26915698</guid><pubDate>Fri, 23 Apr 2021 15:26:06 GMT</pubDate><description>&lt;p&gt;&amp;gt; from a longer term perspective Yes. Longer term, new hardware will also make it practical to train large models in a fully parallelized, fully distributed manner -- i.e., without having to backpropagate gradients, which requires a lot of complex bookkeeping and plumbing for distributed training. Recent progress suggests this will happen. See, for example: https://arxiv.org/abs/2006.04182 https://arxiv.org/abs/2103.03725 https://arxiv.org/abs/2010.01047 I for one am excited to see what happens over the next decade as it becomes trivial to train/use models with 1K, 1M, or 1B times more dense…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.04182/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Predictive Coding Approximates Backprop along Arbitrary Computation Graphs — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=26701754</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.04182:26701754</guid><pubDate>Mon, 05 Apr 2021 17:17:49 GMT</pubDate><description>&lt;p&gt;EDIT: Before you read my comment below, please see https://news.ycombinator.com/item?id=26702815 and https://openreview.net/forum?id=PdauS7wZBfC for a different view. -- If the results hold, they seem significant enough to me that I&amp;#x27;d go as far as saying the authors of the paper would end up getting an important award at some point, not just for unifying the fields of biological and artificial intelligence, but also for making it trivial to train models in a fully distributed manner, with all learning done locally -- if the results hold. Here&amp;#x27;s the paper: &amp;quot;Predictive Coding Approximates…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.04182/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Predictive Coding Approximates Backprop along Arbitrary Computation Graphs — mentioned by canjobear</title><link>https://news.ycombinator.com/item?id=26207121</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.04182:26207121</guid><pubDate>Sat, 20 Feb 2021 19:41:39 GMT</pubDate><description>&lt;p&gt;Backprop isn&amp;#x27;t biologically plausible but predictive coding is and it approximates backprop. https://arxiv.org/abs/2006.04182&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.04182/"&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>
