<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Studying Large Language Model Generalization with Influence Functions · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2308.03296/</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/2308.03296/feed.xml" rel="self" type="application/rss+xml" /><item><title>Studying Large Language Model Generalization with Influence Functions — mentioned by 986aignan</title><link>https://news.ycombinator.com/item?id=49041688</link><guid isPermaLink="false">urn:hackerpapers:mention:2308.03296:49041688</guid><pubDate>Fri, 24 Jul 2026 21:17:28 GMT</pubDate><description>&lt;p&gt;&amp;gt; LLMs (I believe) _can_ be trained to not plagiarize. They do not have to be original, nor to use public domain training-data, they just have to give attribution (which, as far as I can tell, requires little more than a corpus and a stack of similarity-measures). And something like attributions can be determined even if the LLM is paraphrasing, if I&amp;#x27;m understanding Cosma Shalizi correctly[1]. He gives Grosse et al.[2] as a reference for doing so in a scalable manner. [1] https://bactra.org/research/2026-03-10.html [2] https://arxiv.org/abs/2308.03296&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2308.03296/"&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>Studying Large Language Model Generalization with Influence Functions — HN submission</title><link>https://news.ycombinator.com/item?id=39968292</link><guid isPermaLink="false">urn:hackerpapers:submission:2308.03296:39968292</guid><pubDate>Mon, 08 Apr 2024 10:37:11 GMT</pubDate><description>&lt;p&gt;Studying Large Language Model Generalization with Influence Functions&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/2308.03296/"&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>Studying Large Language Model Generalization with Influence Functions — mentioned by sebzim4500</title><link>https://news.ycombinator.com/item?id=38532482</link><guid isPermaLink="false">urn:hackerpapers:mention:2308.03296:38532482</guid><pubDate>Tue, 05 Dec 2023 15:54:19 GMT</pubDate><description>&lt;p&gt;And ideally if someone is proposing new prompting techniques they should test it across both the most capable models (which are unfortunately proprietary) and the best open models. The problem is that what works on small LLMs does not necessarily scale to larger ones. See page 35 of [1] for example. A researcher only using the models of a few years ago (where the open models had &amp;lt;1B parameters) could come to a completely incorrect conclusion: that language models are incapable of generalising facts learned in one language to another. [1] https://arxiv.org/pdf/2308.03296.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2308.03296/"&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>Studying Large Language Model Generalization with Influence Functions — mentioned by JoshuaDavid</title><link>https://news.ycombinator.com/item?id=38505042</link><guid isPermaLink="false">urn:hackerpapers:mention:2308.03296:38505042</guid><pubDate>Sun, 03 Dec 2023 05:20:27 GMT</pubDate><description>&lt;p&gt;Some work, yeah. It&amp;#x27;s still an open problem to do it well, but I think the folks at Anthropic have made a reasonable start with their work[1] on influence functions (&amp;quot;tracing model outputs to the training data&amp;quot;). Basically their work attempts to answer the question &amp;quot;what particular training data most strongly influenced the model to give the answer it did&amp;quot;, by doing some fancy math that I think is equivalent to taking the gradient produced by each piece of training data, computing the derivative of loss on the output of interest as the gradient is applied to the model, and then using that as…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2308.03296/"&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>Studying Large Language Model Generalization with Influence Functions — mentioned by sebzim4500</title><link>https://news.ycombinator.com/item?id=38151531</link><guid isPermaLink="false">urn:hackerpapers:mention:2308.03296:38151531</guid><pubDate>Sun, 05 Nov 2023 14:42:43 GMT</pubDate><description>&lt;p&gt;Anthropic has a recent paper that talks about this [1]. See figure 16 in particular. The larger the model, the more it generalizes between languages. On the other hand, no matter how large the model they struggle to generalize between sentences of the form &amp;quot;George Washington was the first US president&amp;quot; and &amp;quot;The first US president was George Washington&amp;quot;. Clearly generalization behavior is unintuitive, you can come up with a post hoc explanation (weights are independent between early and late layers) but I doubt anyone would have thought ahead of time that models would have an easier time…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2308.03296/"&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>
