<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Dissecting Recall of Factual Associations in Auto-Regressive Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2304.14767/</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/2304.14767/feed.xml" rel="self" type="application/rss+xml" /><item><title>Dissecting Recall of Factual Associations in Auto-Regressive Language Models — mentioned by numeri</title><link>https://news.ycombinator.com/item?id=38285084</link><guid isPermaLink="false">urn:hackerpapers:mention:2304.14767:38285084</guid><pubDate>Thu, 16 Nov 2023 02:03:48 GMT</pubDate><description>&lt;p&gt;This post isn&amp;#x27;t a scientific investigation. It&amp;#x27;s someone playing around with a black-box model with few to little controls – which is unfortunately the only thing we can do when experimenting with GPT-4, which does excuse this partially. Unfortunately, though, the author seems unaware of the actual state of research on the actual mechanics of how LLMs store knowledge and specifically binary relations. The ROME paper[1], among others, shows that the feed-forward layers function as a key-value store, where the feed-forward&amp;#x27;s up projection of the last token in a noun phrase (say, &amp;quot;the Eiffel…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2304.14767/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Dissecting Recall of Factual Associations in Auto-Regressive Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=35797974</link><guid isPermaLink="false">urn:hackerpapers:submission:2304.14767:35797974</guid><pubDate>Wed, 03 May 2023 04:21:27 GMT</pubDate><description>&lt;p&gt;Dissecting Recall of Factual Associations in Auto-Regressive Language Models&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/2304.14767/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Dissecting Recall of Factual Associations in Auto-Regressive Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=35772341</link><guid isPermaLink="false">urn:hackerpapers:submission:2304.14767:35772341</guid><pubDate>Mon, 01 May 2023 13:14:08 GMT</pubDate><description>&lt;p&gt;Dissecting Recall of Factual Associations in Auto-Regressive Language Models&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/2304.14767/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
