Overview

Sparse coding studies how to represent signals or model activations using a small number of active elements from a dictionary, supporting compression, denoising, and interpretation. Methods include dictionary learning with LASSO or nonnegative penalties, convolutional and structured codes, and fast inference through algorithms such as FISTA and LISTA; sparse autoencoders extend these ideas to neural-network representations. In language and vision models, researchers use learned features to probe and intervene on internal computations, while also applying sparse codes to retrieval, scientific imaging, and compositional learning. A central tension is that stronger sparsity can improve compactness or interpretability but harm reconstruction, and performance often depends on learning a good dictionary rather than merely improving inference.

Latest papers

CardsList

54 papers6 papers in the last four weeks, down 14% on the four weeks before. 0.0% of all new papers.

  1. Beyond the Grid: Continuous Dictionary Pursuit for Interpretable Signal Decomposition

    Nov 6, 2026Nick Janssen, Melanie Schaller, Bodo RosenhahnTime Series DecompositionSparse Coding

  2. User Embeddings are Superpositions of Interpretable Behavioral Modes

    Nov 5, 2026Jonathan Kozaczuk, Zheng Dong, Noyan Evirgen +7User ModelingSparse Coding

  3. ISBC: Interpretable Sparse Binary Coding of Pretrained Text Embeddings

    Oct 31, 2026Stefano Maria Iacus, Haodong QiSparse CodingRepresentation Learning

  4. Binary Sparse Codes: Where are we on Energy Efficient Representations?

    Oct 30, 2026Jose Miguel Ramos, Luis SaCouto, Andreas WichertSparse CodingRepresentation Learning

  5. Sparse Autoencoders as Implicit Diversification Regularisers for Cross-Sectional Cryptocurrency Returns

    Oct 29, 2026Weijia Han, Lisha QuFinancePortfolio Optimization

  6. FAD-KV: Adaptive Dictionary KV Caching for Efficient Reasoning Decoding

    Oct 27, 2026Yuxuan Zhu, David H. Yang, Parisa Shiravani +5KV-Cache CompressionLLM Inference Acceleration

  7. Beyond SAEs: Consistent Concept Discovery with Sparse Coding

    Oct 16, 2026Jinho Choi, Hyesu Lim, Jaegul Choo +1Sparse AutoencodersSparse Coding

  8. Complete or Sparse: A Tale of Two Identifiabilities

    Oct 14, 2026Junze Zhou, David KlindtSparse CodingRepresentation Identifiability

  9. How Many Ranks Does a Token Need? A Noise-Floor Squelch for Rank-One LoRA Experts

    Oct 13, 2026Mei Okonkwo, Owen Castellanos, Ingrid Solberg +1Low-Rank AdaptationAdaptive Rank Allocation

  10. Sparse Dictionary Learning for Measure-Valued Data via Linearized Optimal Transport: Efficient Algorithms and Sample Complexity

    Oct 9, 2026Brendan Mallery, Shuchin Aeron, James MurphyRepresentation LearningSparse Coding

  11. Inference and learning in sparse autoencoders as natural gradient flow

    Oct 5, 2026Hadi Vafaii, Tejas Rao, David Chanin +6Gradient DescentSparse Autoencoders

  12. NeuronEye: Query-Guided Visual Concept Activation for Vision-Language Reasoning

    Sep 29, 2026Ruiyu Yan, Bowen Chen, Shaowen Wan +1VLM InterpretabilityVLM Reasoning

  13. Invariant Atoms: Sparse Coordinates of Local Semantic Geometry in Language Model Representations

    Sep 29, 2026Muhammad Ahtesham, Xin ZhongRepresentation Geometry in Language ModelsInvariant Representation Learning

  14. Iterative Atom Refinement: A Monotonicity Principle for Dictionary Learning

    Sep 20, 2026Alexander Christie, Miguel Moscoso, Alexei Novikov +2Sparse RecoveryDictionary Learning

  15. Training-Adaptive Convolutional Sparse Coding via Information Bottleneck for Robust Visual Representation

    Sep 16, 2026Meng'en Qin, Yinchen Liu, Mingxuan Cui +1Representation LearningTest-Time Adaptation

  16. Conducting Stylistic Analysis of Paintings through an Art-History Agent

    Aug 30, 2026Marc S. Walton, Astrid HarthExplainable Artificial IntelligenceStylometry

  17. Closed-Form Nonlocal Shrinkage for Multiplicative Image Denoising and SAR Despeckling

    Aug 15, 2026Xuran Hu, Mingzhe Zhu, Djordje Stanković +4Image DenoisingSparse Coding

  18. PE-CSNet: An equivariant network architecture with learnable patch-based sparse representation

    Aug 11, 2026Kai Li, Haitao Long, Bo Zhang +2Deep UnfoldingCompressed Sensing

  19. Toward a mechanistic understanding of inference in visual cortex and diffusion models

    Jul 17, 2026Zeyu Yun, Alexander Belsten, Dasheng Bi +3Mechanistic InterpretabilityVisual Neuroscience

  20. Accelerating Hierarchical Sparse Predictive Coding with Hybrid Amortized Inference

    Jun 26, 2026Kazuhisa FujitaSparse RecoveryEfficient Inference

  21. Beyond the Hard Budget: Sparsity Regularizers for More Interpretable Top-k Sparse Autoencoders

    Jun 25, 2026Nathanaël Jacquier, Maria Vakalopoulou, Mahdi S. HosseiniActivation SparsitySparse Autoencoders

  22. Non-negative Elastic Net Decoding for Information Retrieval

    Jun 16, 2026Koki Okajima, Yasutoshi Ida, Tsukasa Yoshida +1Representation LearningInformation Retrieval

  23. Size Doesn't Matter: Cosine-Scored Sparse Autoencoders

    Jun 13, 2026Silen Naihin, Lev StamblerRepresentation LearningSparse Autoencoders

  24. Rational Sparse Autoencoder

    Jun 12, 2026Naiyu Yin, Yue YuActivation SparsityLLM Interpretability

  25. Decompose Sparsely Where You Should, Absorb Densely Where You Should No

    Jun 12, 2026Ruixuan Deng, Zehao Jin, Zekun Wang +1Transformer InterpretabilityRepresentation Learning

  26. Convolutional Sparse Coding via the Locally Competitive Algorithm on Loihi 2

    Jun 7, 2026Geoffrey Kasenbacher, Daniel Ruepp, Gerrit A. EckeRepresentation LearningNeuromorphic Computing