<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Formal Algorithms for Transformers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2207.09238/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Wed, 04 Nov 2026 05:35:47 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2207.09238/feed.xml" rel="self" type="application/rss+xml" /><item><title>Formal Algorithms for Transformers — mentioned by horseloverthin</title><link>https://news.ycombinator.com/item?id=50359159</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:50359159</guid><pubDate>Tue, 03 Nov 2026 22:29:54 GMT</pubDate><description>&lt;p&gt;formal algorithms for transformers provides perhaps the most succinct introduction to attention I can imagine https://arxiv.org/pdf/2207.09238&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by wren6991</title><link>https://news.ycombinator.com/item?id=48510295</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:48510295</guid><pubDate>Fri, 12 Jun 2026 22:50:28 GMT</pubDate><description>&lt;p&gt;If you want the actual maths instead of handwaving, I recommend: https://arxiv.org/abs/2207.09238 For something gentler, 3Blue1Brown: https://www.youtube.com/watch?v=eMlx5fFNoYc (this is part of a series)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by sharma-arjun</title><link>https://news.ycombinator.com/item?id=48422290</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:48422290</guid><pubDate>Sat, 06 Jun 2026 07:17:09 GMT</pubDate><description>&lt;p&gt;Not a core paper, but I found Formal Algorithms for Transformers [1] (a Google paper from 2022) to have a great pedagogical style. [1] https://arxiv.org/abs/2207.09238&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by rck</title><link>https://news.ycombinator.com/item?id=39050990</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:39050990</guid><pubDate>Fri, 19 Jan 2024 02:41:14 GMT</pubDate><description>&lt;p&gt;Tangential, but: the notes that this post refers to are probably not the best way to learn how transformers work. If you want mathematical precision, those notes are based on this paper from DeepMind: https://arxiv.org/abs/2207.09238 The paper provides mathematically precise definitions of all the parts of a transformers, though it&amp;#x27;s showing its age (ha!) in that it doesn&amp;#x27;t include some formalizations that are common in, for example, Llama.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by _giorgio_</title><link>https://news.ycombinator.com/item?id=38775893</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:38775893</guid><pubDate>Tue, 26 Dec 2023 20:47:57 GMT</pubDate><description>&lt;p&gt;&amp;gt; the paper that was most helpful for me was [Formal Algorithms for Transformers](https://arxiv.org/abs/2207.09238) Interesting but hard to read since it uses a quite unique notations for matrix indexing and multplication. Why???&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by svcrunch</title><link>https://news.ycombinator.com/item?id=38758413</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:38758413</guid><pubDate>Mon, 25 Dec 2023 00:26:10 GMT</pubDate><description>&lt;p&gt;While in Google Research, I worked with two of the authors of the &amp;quot;Attention is All you Need&amp;quot; paper, including the gentleman who chose that title. As others have pointed out, self-attention was already a known concept in the research community. They don&amp;#x27;t claim to have invented that. Rather, the authors began by looking at how to improve the power of feed-forward neural networks using a combination of techniques, obtained some exciting results, and then, in the course of ablation studies, discovered that attention was really all you needed! The title is a play on the Beatles song, &amp;quot;All You…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by dsubburam</title><link>https://news.ycombinator.com/item?id=36865328</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:36865328</guid><pubDate>Tue, 25 Jul 2023 16:50:02 GMT</pubDate><description>&lt;p&gt;&amp;#x27;Formal Algorithms for Transformers&amp;#x27;[1] is a proper account of the architectures and what tasks they naturally lend themselves to, by authors from DeepMind. See sections 3 (Transformers and Typical Tasks) and 6 (Transformer Architectures). Not much on empirical observations, though. [1]https://arxiv.org/abs/2207.09238&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by jstx1</title><link>https://news.ycombinator.com/item?id=36678966</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:36678966</guid><pubDate>Tue, 11 Jul 2023 10:29:42 GMT</pubDate><description>&lt;p&gt;For completeness - Formal Algorithms for Transformers - https://arxiv.org/pdf/2207.09238.pdf For accessibility - Let&amp;#x27;s Build GPT from Scratch, Andrej Karpathy - https://www.youtube.com/watch?v=kCc8FmEb1nY You can also read the PyTorch source code - https://pytorch.org/docs/stable/_modules/torch/nn/modules/tr...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by tomasff</title><link>https://news.ycombinator.com/item?id=36335015</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:36335015</guid><pubDate>Thu, 15 Jun 2023 00:52:15 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2207.09238 This is a great transparent and clear description of what is actually going on in attention layers. Alternatively, this article by Jay Alammar is also very popular http://jalammar.github.io/illustrated-transformer/&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by Buttons840</title><link>https://news.ycombinator.com/item?id=35981216</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:35981216</guid><pubDate>Wed, 17 May 2023 20:59:58 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve been working through [0]. Like a lot of math, the notation is daunting, but once you become familiar with it, it really is a nice tool for thought. [0]: https://arxiv.org/abs/2207.09238&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by dsubburam</title><link>https://news.ycombinator.com/item?id=35711789</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:35711789</guid><pubDate>Wed, 26 Apr 2023 10:54:01 GMT</pubDate><description>&lt;p&gt;An early explainer of transformers, which is a quicker read, that I found very useful when they were still new to me, is The Illustrated Transformer[1], by Jay Alammar. A more recent academic but high-level explanation of transformers, very good for detail on the different flow flavors (e.g. encoder-decoder vs decoder only), is Formal Algorithms for Transformers[2], from DeepMind. [1] https://jalammar.github.io/illustrated-transformer/ [2] https://arxiv.org/abs/2207.09238&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by Buttons840</title><link>https://news.ycombinator.com/item?id=35578303</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:35578303</guid><pubDate>Sat, 15 Apr 2023 06:59:58 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve been reading this paper with pseudocode for various transformers and finding it helfpul: https://arxiv.org/abs/2207.09238 &amp;quot;This document aims to be a self-contained, mathematically precise overview of transformer architectures and algorithms (not results). It covers what transformers are, how they are trained, what they are used for, their key architectural components, and a preview of the most prominent models.&amp;quot;&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by Buttons840</title><link>https://news.ycombinator.com/item?id=35508631</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:35508631</guid><pubDate>Mon, 10 Apr 2023 02:38:16 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve been reading this paper with pseudocode for various transformers and finding it helfpul: https://arxiv.org/abs/2207.09238 &amp;quot;This document aims to be a self-contained, mathematically precise overview of transformer architectures and algorithms (not results). It covers what transformers are, how they are trained, what they are used for, their key architectural components, and a preview of the most prominent models.&amp;quot;&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by bfg_damien</title><link>https://news.ycombinator.com/item?id=35415703</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:35415703</guid><pubDate>Sun, 02 Apr 2023 21:58:46 GMT</pubDate><description>&lt;p&gt;Here are a few resources that might help get you started: 1. A thread explaining the internal working of transformers: https://twitter.com/hippopedoid/status/1641432291149848576?s... 2. Paper by DeepMind which provides pseudo-code for important algorithms for Transformer models: https://arxiv.org/pdf/2207.09238.pdf 3. Another thread specifically on large language models: https://twitter.com/cwolferesearch/status/164044611134855577... Once again these are not courses per se, but do provide intuitive explanations for how transformers work. There is also the nanoGPT series of videos by Karpathy…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — mentioned by heyitsguay</title><link>https://news.ycombinator.com/item?id=34572007</link><guid isPermaLink="false">urn:hackerpapers:mention:2207.09238:34572007</guid><pubDate>Sun, 29 Jan 2023 19:55:10 GMT</pubDate><description>&lt;p&gt;For a while now, an answer I&amp;#x27;ve seen is to start with &amp;quot;Attention Is All You Need&amp;quot;, the original Transformers paper. It&amp;#x27;s still pretty good, but over the past year I&amp;#x27;ve led a few working sessions on grokking transformer computational fundamentals and they&amp;#x27;ve turned up some helpful later additions that simplify and clarify what&amp;#x27;s going on. You can quickly get overwhelmed by the million good resources out there so I&amp;#x27;ll keep it to these three. If you have a strong CS background, they&amp;#x27;ll take you a long way: (1) Transformers from Scratch: https://peterbloem.nl/blog/transformers (2) Attention Is…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&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>Formal Algorithms for Transformers — HN submission</title><link>https://news.ycombinator.com/item?id=32163324</link><guid isPermaLink="false">urn:hackerpapers:submission:2207.09238:32163324</guid><pubDate>Wed, 20 Jul 2022 09:28:58 GMT</pubDate><description>&lt;p&gt;Formal Algorithms for Transformers&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;106 points; 13 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2207.09238/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
