<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hopfield Networks is All You Need · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2008.02217/</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/2008.02217/feed.xml" rel="self" type="application/rss+xml" /><item><title>Hopfield Networks is All You Need — mentioned by vatsachak</title><link>https://news.ycombinator.com/item?id=46536653</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:46536653</guid><pubDate>Thu, 08 Jan 2026 03:01:09 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2008.02217 They derive Q, K, V as a continuous analog of a hopfield network&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — HN submission</title><link>https://news.ycombinator.com/item?id=44789750</link><guid isPermaLink="false">urn:hackerpapers:submission:2008.02217:44789750</guid><pubDate>Mon, 04 Aug 2025 18:34:22 GMT</pubDate><description>&lt;p&gt;Hopfield Networks Is All You Need (2020)&lt;/p&gt;&lt;p&gt;https://github.com/ml-jku/hopfield-layers&lt;/p&gt;&lt;p&gt;41 points; 6 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — mentioned by korbip</title><link>https://news.ycombinator.com/item?id=43055517</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:43055517</guid><pubDate>Sat, 15 Feb 2025 03:04:16 GMT</pubDate><description>&lt;p&gt;There is a LOT of effort in the research community currently: 1. Improving the Self-Attention in the Transformer as is, keeping the quadratic complexity, which has some theoretical advantage in principle[1]: The most hyped one probably DeepSeek&amp;#x27;s Multi-Latent Attention[15], which kind of is Attention still - but also somehow different. 2. Linear RNNs: This starts from Linear Attention[2], DeltaNet[3], RKWV[4], Retention[5], Gated Linear Attention[6], Mamba[7], Griffin[8], Based[9], xLSTM[10], TTT[11], Gated DeltaNet[12], Titans[13]. They all have an update like: C_{t} = F_{t} C_{t-1} + i_{t}…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — mentioned by igleria</title><link>https://news.ycombinator.com/item?id=43047364</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:43047364</guid><pubDate>Fri, 14 Feb 2025 11:41:20 GMT</pubDate><description>&lt;p&gt;This immediately makes my mind bring up Hopfield networks https://arxiv.org/abs/2008.02217 when I worked with them circa 2012 they were practically toys. Maybe we are in a better place now?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — mentioned by adamnemecek</title><link>https://news.ycombinator.com/item?id=39586482</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:39586482</guid><pubDate>Mon, 04 Mar 2024 02:26:55 GMT</pubDate><description>&lt;p&gt;This is not surprising considering the paper &amp;quot;Hopfield Networks is All You Need&amp;quot; https://arxiv.org/abs/2008.02217. Hopfield networks learn via Hebbian learning.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — mentioned by whimsicalism</title><link>https://news.ycombinator.com/item?id=36832776</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:36832776</guid><pubDate>Sun, 23 Jul 2023 05:26:41 GMT</pubDate><description>&lt;p&gt;&amp;gt; 1) there are a lot of papers claiming to be the successor to the Transformer, and not all of them are cited; e.g., the MetaFormer is missing https://arxiv.org/abs/2111.11418. Another candidate that wasn&amp;#x27;t compares against (or at least argued why it wouldn&amp;#x27;t make sense to compare against) are the Hopfield Networks https://arxiv.org/abs/2008.02217. Neither of those papers are NLP applicable? And I think it&amp;#x27;s perfectly fair to focus on the alternatives (ie. like H3 and RWKV) that have been able to scale up to LLM levels and perplexity, which neither of the alternatives you mention have. Should…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — mentioned by sfriedr</title><link>https://news.ycombinator.com/item?id=36832653</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:36832653</guid><pubDate>Sun, 23 Jul 2023 04:55:58 GMT</pubDate><description>&lt;p&gt;I only spent a few minutes skimming thr paper, but: 1) there are a lot of papers claiming to be the successor to the Transformer, and not all of them are cited; e.g., the MetaFormer is missing https://arxiv.org/abs/2111.11418. Another candidate that wasn&amp;#x27;t compares against (or at least argued why it wouldn&amp;#x27;t make sense to compare against) are the Hopfield Networks https://arxiv.org/abs/2008.02217. So until a more solid Related Work section is written (their section is actually called &amp;quot;Relation to and Differences from Previous Methods&amp;quot;) I reserve the right to be skeptical whether their model…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — mentioned by macrolocal</title><link>https://news.ycombinator.com/item?id=32839857</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:32839857</guid><pubDate>Wed, 14 Sep 2022 16:52:04 GMT</pubDate><description>&lt;p&gt;More accessible references: https://mcbal.github.io/post/an-energy-based-perspective-on-... (Modern continuous Hopfield networks section) https://arxiv.org/abs/2008.02217 Note that the connection to Hebbian learning hinges on the softmax function, in particular its exponential!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — mentioned by flowtheorist</title><link>https://news.ycombinator.com/item?id=30231242</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:30231242</guid><pubDate>Sun, 06 Feb 2022 10:39:18 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s definitely in a gray area because the AI models are essentially compression engines that encode the code samples/data into the weights of the matrices that represent the ML model and then &amp;quot;uncompress&amp;quot; it to serve queries. I think it would be easy to argue that a compressed data set no matter how illegible would need to conform to the same license as the data set it was encoding but I don&amp;#x27;t think any lawyer is smart enough to make that case. So at the moment it remains a very convenient loophole for companies that have enough compute to mangle the data set beyond recognition and then use…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — mentioned by sillysaurusx</title><link>https://news.ycombinator.com/item?id=28068264</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:28068264</guid><pubDate>Thu, 05 Aug 2021 00:32:59 GMT</pubDate><description>&lt;p&gt;&amp;gt; If I recall correctly, it was a Hopfield thingie, so I&amp;#x27;m pretty off topic here. Actually, you’re spot on. Hopfield networks were once popular, and are now popular again: https://arxiv.org/abs/2008.02217 (Hopularity leads to popularity, as they say.) I wish there was some way to track down that spreadsheet. :) It’d be neat to read. Thanks for sharing.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — HN submission</title><link>https://news.ycombinator.com/item?id=27531948</link><guid isPermaLink="false">urn:hackerpapers:submission:2008.02217:27531948</guid><pubDate>Wed, 16 Jun 2021 18:39:54 GMT</pubDate><description>&lt;p&gt;Transformers Connected to Hopfield Networks&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — mentioned by KhoomeiK</title><link>https://news.ycombinator.com/item?id=25351541</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.02217:25351541</guid><pubDate>Tue, 08 Dec 2020 21:24:03 GMT</pubDate><description>&lt;p&gt;Discovering Symbolic Models from Deep Learning with Inductive Biases [1] trains graph neural nets on astrophysical phenomena and then performs symbolic regression to generate algebraic formulae to elegantly model the phenomena in a classical physics framework. It&amp;#x27;s largely gone under the radar but has pretty interesting implications for NLP and language theory in my opinion. Direct Feedback Alignment Scales to Modern Deep Learning Tasks and Architectures [2] applies DFA, an approach to training neural nets without backprop, to modern architectures like the Transformer. It does surprisingly…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — HN submission</title><link>https://news.ycombinator.com/item?id=24308368</link><guid isPermaLink="false">urn:hackerpapers:submission:2008.02217:24308368</guid><pubDate>Fri, 28 Aug 2020 18:28:33 GMT</pubDate><description>&lt;p&gt;Hopfield Networks Is All You Need&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — HN submission</title><link>https://news.ycombinator.com/item?id=24280759</link><guid isPermaLink="false">urn:hackerpapers:submission:2008.02217:24280759</guid><pubDate>Wed, 26 Aug 2020 09:34:02 GMT</pubDate><description>&lt;p&gt;Hopfield Networks Is All You Need&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — HN submission</title><link>https://news.ycombinator.com/item?id=24158649</link><guid isPermaLink="false">urn:hackerpapers:submission:2008.02217:24158649</guid><pubDate>Fri, 14 Aug 2020 14:51:21 GMT</pubDate><description>&lt;p&gt;Hopfield Networks Is All You Need&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Hopfield Networks is All You Need — HN submission</title><link>https://news.ycombinator.com/item?id=24069404</link><guid isPermaLink="false">urn:hackerpapers:submission:2008.02217:24069404</guid><pubDate>Thu, 06 Aug 2020 09:29:25 GMT</pubDate><description>&lt;p&gt;Hopfield Networks Is All You Need&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2008.02217/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
