<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title>Bing: Sparse Autoencoder</title><link>http://www.bing.com:80/search?q=Sparse+Autoencoder</link><description>Search results</description><image><url>http://www.bing.com:80/s/a/rsslogo.gif</url><title>Sparse Autoencoder</title><link>http://www.bing.com:80/search?q=Sparse+Autoencoder</link></image><copyright>Copyright © 2026 Microsoft. All rights reserved. These XML results may not be used, reproduced or transmitted in any manner or for any purpose other than rendering Bing results within an RSS aggregator for your personal, non-commercial use. Any other use of these results requires express written permission from Microsoft Corporation. By accessing this web page or using these results in any manner whatsoever, you agree to be bound by the foregoing restrictions.</copyright><item><title>Sparse Autoencoders in Deep Learning - GeeksforGeeks</title><link>https://www.geeksforgeeks.org/deep-learning/sparse-autoencoders-in-deep-learning/</link><description>To learn efficient data representations with minimal redundancy, Sparse Autoencoders play an important role in deep learning. They are a special type of autoencoder that introduces a sparsity constraint on the hidden layer, forcing only a few neurons to activate at a time.</description><pubDate>Wed, 24 Jun 2026 12:00:00 GMT</pubDate></item><item><title>Sparse autoencoder - Stanford University</title><link>https://web.stanford.edu/class/cs294a/sparseAutoencoder.pdf</link><description>Sparse autoencoder 1 Introduction Supervised learning is one of the most powerful tools of AI, and has led to automatic zip code recognition, speech recognition, self-driving cars, and a continually improving understanding of the human genome. Despite its sig-ni cant successes, supervised learning today is still severely limited.</description><pubDate>Fri, 26 Jun 2026 10:10:00 GMT</pubDate></item><item><title>A gentle introduction to sparse autoencoders — LessWrong</title><link>https://www.lesswrong.com/posts/8YnHuN55XJTDwGPMr/a-gentle-introduction-to-sparse-autoencoders</link><description>We make an autoencoder sparse by adding an L1 penalty [5] to the loss term in order to align as many activations of the hidden layer to zero as possible. For our use case, →x is an internal activation of a LLM, the hidden layer's activations are the feature activations, and the decoder weights are the feature vectors.</description><pubDate>Sat, 27 Jun 2026 09:19:00 GMT</pubDate></item><item><title>A Survey on Sparse Autoencoders: Interpreting the Internal Mechanisms ...</title><link>https://arxiv.org/html/2503.05613v3</link><description>By training a sparse autoencoder to reconstruct the activations of a target network layer while enforcing sparsity constraints, SAEs can extract a larger set of monosemantic features that offer clearer insights into what information the LLM is processing.</description><pubDate>Thu, 18 Jun 2026 08:53:00 GMT</pubDate></item><item><title>Sparse Autoencoder Neural Networks - How to Utilise Sparsity for Robust ...</title><link>https://towardsdatascience.com/sparse-autoencoder-neural-networks-how-to-utilise-sparsity-for-robust-information-encoding-6aa9ff542bc9/</link><description>Neural Networks Sparse Autoencoder (SAE) featured image created by the author. Intro Autoencoders enable us to distil information by utilising a neural network architecture composed of an encoder and decoder. There are multiple types of autoencoders that vary based on their structure or the problems they are designed to solve. The four most commons ones are: Undercomplete Autoencoder (AE ...</description><pubDate>Wed, 24 Jun 2026 14:59:00 GMT</pubDate></item><item><title>An Intuitive Explanation of Sparse Autoencoders for LLM ...</title><link>https://adamkarvonen.github.io/machine_learning/2024/06/11/sae-intuitions.html</link><description>Sparse Autoencoder Explanation How Sparse Autoencoders Work A sparse autoencoder transforms the input vector into an intermediate vector, which can be of higher, equal, or lower dimension compared to the input. When applied to LLMs, the intermediate vector’s dimension is typically larger than the input’s.</description><pubDate>Fri, 26 Jun 2026 02:32:00 GMT</pubDate></item><item><title>Scaling and evaluating sparse autoencoders - OpenAI</title><link>https://cdn.openai.com/papers/sparse-autoencoders.pdf</link><description>However, studying the proper-ties of autoencoder scaling is dificult due to the need to balance reconstruction and sparsity objectives and the presence of dead latents. We propose using k-sparse autoencoders [Makhzani and Frey, 2013] to directly control sparsity, simplifying tuning and improving the reconstruction-sparsity frontier.</description><pubDate>Sat, 27 Jun 2026 19:56:00 GMT</pubDate></item><item><title>Mapping LLMs with Sparse Autoencoders - pair.withgoogle.com</title><link>https://pair.withgoogle.com/explorables/sae/</link><description>Training Sparse Autoencoders The goal of an SAE is to disentangle these polysemantic activations, separating them into monesmantic vectors that we can connect with individual features. To do this, SAEs use a specific type of neural network, called an autoencoder, which is tasked to try to modify and then reconstruct activations.</description><pubDate>Sun, 28 Jun 2026 05:07:00 GMT</pubDate></item><item><title>[2309.08600] Sparse Autoencoders Find Highly Interpretable Features in ...</title><link>https://arxiv.org/abs/2309.08600</link><description>Here, we attempt to identify those directions, using sparse autoencoders to reconstruct the internal activations of a language model. These autoencoders learn sets of sparsely activating features that are more interpretable and monosemantic than directions identified by alternative approaches, where interpretability is measured by automated ...</description><pubDate>Mon, 22 Jun 2026 13:28:00 GMT</pubDate></item><item><title>Sparse Autoencoder Features for Classifications and Transferability ...</title><link>https://aclanthology.org/2025.emnlp-main.1521/</link><description>Sparse Autoencoder Features for Classifications and Transferability. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing, pages 29939–29963, Suzhou, China.</description><pubDate>Wed, 24 Jun 2026 12:43:00 GMT</pubDate></item></channel></rss>