<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Disentangling Dense Embeddings with Sparse Autoencoders · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2408.00657/</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/2408.00657/feed.xml" rel="self" type="application/rss+xml" /><item><title>Disentangling Dense Embeddings with Sparse Autoencoders — mentioned by jwuphysics</title><link>https://news.ycombinator.com/item?id=42210024</link><guid isPermaLink="false">urn:hackerpapers:mention:2408.00657:42210024</guid><pubDate>Fri, 22 Nov 2024 00:13:12 GMT</pubDate><description>&lt;p&gt;Incredible, well-documented work -- this is an amazing effort! Two things that caught my eye were (i) your loss curves and (ii) the assessment of dead latents. Our team also studied SAEs -- trained to reconstruct dense embeddings of paper abstracts rather than individual tokens [1]. We observed a power-law scaling of the lower bound of loss curves, even when we varied the sparsity level and the dimensionality of the SAE latent space. We also were able to totally mitigate dead latents with an auxiliary loss, and we saw smooth sinusoidal patterns throughout training iterations. Not sure if…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2408.00657/"&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>
