<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernel · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1908.11775/</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.11775/feed.xml" rel="self" type="application/rss+xml" /><item><title>Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernel — mentioned by antics</title><link>https://news.ycombinator.com/item?id=50083057</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.11775:50083057</guid><pubDate>Wed, 14 Oct 2026 06:08:38 GMT</pubDate><description>&lt;p&gt;For those who are not math people, this comment is referring to the fact that &amp;quot;attention&amp;quot; is formally equivalent[1] to Nadaraya-Watson kernel smoothing, which is a kind of weighted average. Yes! Incredibly, attention is just a weighted average. Imagine you have a series of (x,y) coordinates. You receive a new x coordinate, and you&amp;#x27;d like to predict the corresponding y. So, the absolute dumbest thing you can do is find the nearest x, and then report its corresponding y as your prediction. The second dumbest thing you can do is find the n closest x coordinates, and then average their y values…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.11775/"&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>Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernel — mentioned by antics</title><link>https://news.ycombinator.com/item?id=43627220</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.11775:43627220</guid><pubDate>Tue, 08 Apr 2025 22:46:30 GMT</pubDate><description>&lt;p&gt;I just meant that there are lots of problems where I think TCS could have contributed but didn&amp;#x27;t, because the relevant analysis was not acceptable at FOCS or SODA (or whatever). A good example is the original transformers paper, which is vastly over-complicated relative to (say) a later treatment[1] by Ruslan Salakhutdinov&amp;#x27;s lab, which shows that attention is &amp;quot;just&amp;quot; plain-old Nadaraya-Watson kernel smoothing—which if you don&amp;#x27;t know is a weighted average of points covered in elementary grad stats. I&amp;#x27;m not saying it was TCS people would be &amp;quot;better&amp;quot; at discovering this or anything like that, I&amp;#x27;m…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.11775/"&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>Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernel — mentioned by jackblemming</title><link>https://news.ycombinator.com/item?id=39256519</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.11775:39256519</guid><pubDate>Mon, 05 Feb 2024 02:11:57 GMT</pubDate><description>&lt;p&gt;&amp;gt; the topics in the parent post should not be a major surprise to anyone who has read https://people.math.harvard.edu/~ctm/home/text/others/shanno... ! &amp;gt; which clearly explains it (and said emergent phenomena) Very smart information theory people have looked at neural networks through the lens of information theory and published famous papers about it years ago. It couldn&amp;#x27;t explain many things about neural networks, but it was interesting nonetheless. FWIW it&amp;#x27;s not uncommon for smart people to say &amp;quot;this mathematical structure looks like this other idea with [+/- some structure]!!&amp;quot; and that it…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.11775/"&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>
