<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2402.19427/</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/2402.19427/feed.xml" rel="self" type="application/rss+xml" /><item><title>Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models — mentioned by korbip</title><link>https://news.ycombinator.com/item?id=43055517</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.19427: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/2402.19427/"&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>Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=39993608</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.19427:39993608</guid><pubDate>Wed, 10 Apr 2024 17:45:59 GMT</pubDate><description>&lt;p&gt;Griffin: RNN for Efficient Language Models&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/2402.19427/"&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>Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=39986815</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.19427:39986815</guid><pubDate>Wed, 10 Apr 2024 03:59:32 GMT</pubDate><description>&lt;p&gt;Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient LMs&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;9 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.19427/"&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>Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=39981049</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.19427:39981049</guid><pubDate>Tue, 09 Apr 2024 16:23:12 GMT</pubDate><description>&lt;p&gt;Griffin: Mixing Gated Linear Recurrences with Local Attention&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;6 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.19427/"&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>Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=39719872</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.19427:39719872</guid><pubDate>Fri, 15 Mar 2024 19:44:29 GMT</pubDate><description>&lt;p&gt;Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient LMs&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.19427/"&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>Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=39558514</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.19427:39558514</guid><pubDate>Fri, 01 Mar 2024 04:23:39 GMT</pubDate><description>&lt;p&gt;Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient LMs&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;6 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.19427/"&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>
