<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Perturbation: A simple and efficient adversarial tracer for representation learning in language models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2603.23821/</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/2603.23821/feed.xml" rel="self" type="application/rss+xml" /><item><title>Perturbation: A simple and efficient adversarial tracer for representation learning in language models — mentioned by jsrozner</title><link>https://news.ycombinator.com/item?id=49533463</link><guid isPermaLink="false">urn:hackerpapers:mention:2603.23821:49533463</guid><pubDate>Wed, 02 Sep 2026 08:33:05 GMT</pubDate><description>&lt;p&gt;A big problem with some of these supervised* interpretability approaches is that they can find spurious structure. (There are lots of ways to make the model do what you want; which is roughly what Hewitt and Liang 2019 showed). This paper draws a contrast to a previous method, DAS (distributed alignment search) on page 20. These and related methods rest on theories of causal abstraction, which are great in theory, but harder in practice. DAS, for example, has faced numerous recent criticisms (Makelov 2024, Meloux 2025, Sutter 2025, Grant 2026, Kumon 2026). My favorite is the quite…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2603.23821/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
