Methods › Computer Vision › Generative Models › k-Sparse Autoencoder
k-Sparse Autoencoder
Introduced by Alireza Makhzani et al. in k-Sparse Autoencoders
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
k-Sparse Autoencoders are autoencoders with linear activation function, where in hidden layers only the k highest activities are kept. This achieves exact sparsity in the hidden representation. Backpropagation only goes through the the top k activated units. This can be achieved with a ReLU layer with an adjustable threshold.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: sparse autoencoders; Rational Sparse Autoencoder; Expander Sparse Autoencoders; Sparse, Geometric Autoencoder; BatchTopK sparse autoencoders; Chunk-Level Sparse Autoencoders; Aligned Sparse Autoencoder (SAE); Multilingual Sparse Autoencoders.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 3 · with a code link: 2 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 3 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 3 of 3, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Dissecting and Mitigating Diffusion Bias via Mechanistic Interpretability 26 Mar 2025 · 1 repository · arXiv:2503.20483Syntology 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result (of 1 harvested sample) · 1 pointer-only (licence)
-
PrivacyScalpel: Enhancing LLM Privacy via Interpretable Feature Intervention with Sparse Autoencoders 14 Mar 2025 · 0 repositories · arXiv:2503.11232
-
k-Sparse Autoencoders 19 Dec 2013 · 3 repositories · arXiv:1312.5663
Tasks archive 2025-07-28
10 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections