mlsanityData to 7 Oct 2026

Closed-Loop Transcription via Convolutional Sparse Coding

arXiv 2302.09347 ↗First posted 18 Feb 2023cs.CVcited by 4

Not on the map. Why?

Abstract (arXiv)

Autoencoding has achieved great empirical success as a framework for learning generative models for natural images. Autoencoders often use generic deep networks as the encoder or decoder, which are difficult to interpret, and the learned representations lack clear structure. In this work, we make the explicit assumption that the image distribution is generated from a multi-stage sparse deconvolution. The corresponding inverse map, which we use as an encoder, is a multi-stage convolution sparse coding (CSC), with each stage obtained from unrolling an optimization algorithm for solving the corresponding (convexified) sparse coding program. To avoid computational difficulties in minimizing distributional distance between the real and generated images, we utilize the recent closed-loop transcription (CTRL) framework that optimizes the rate reduction of the learned sparse representations. Conceptually, our method has high-level connections to score-matching methods such as diffusion models. Empirically, our framework demonstrates competitive performance on large-scale datasets, such as ImageNet-1K, compared to existing autoencoding and generative methods under fair conditions. Even with simpler networks and fewer computational resources, our method demonstrates high visual quality in regenerated images. More surprisingly, the learned autoencoder performs well on unseen datasets. Our method enjoys several side benefits, including more structured and interpretable representations, more stable convergence, and scalability to large datasets. Our method is arguably the first to demonstrate that a concatenation of multiple convolution sparse coding/decoding layers leads to an interpretable and effective autoencoder for modeling the distribution of large-scale natural image datasets.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 37 of its 68 references that are in the map. First posted on arXiv 18 Feb 2023.

Builds on

37 of 68 references.

References · 37

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  3. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  4. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  5. 2022Generative Adversarial Networkscited by 5,603
  6. 2019Analyzing and Improving the Image Quality of StyleGANcited by 3,580
  7. 2016Improved Techniques for Training GANscited by 2,938
  8. 2018Large Scale GAN Training for High Fidelity Natural Image Synthesiscited by 2,609
  9. 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
  10. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
  11. 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,539
  12. 2020NVAE: A Deep Hierarchical Variational Autoencodercited by 635
25 more
  1. 2019Residual Flows for Invertible Generative Modelingcited by 256
  2. 2020Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reductioncited by 141
  3. 2019Robust and interpretable blind image denoising via bias-free convolutional neural networkscited by 87
  4. 2021ReduNet: A White-box Deep Network from the Principle of Maximizing Rate Reductioncited by 84
  5. 2020Solving Linear Inverse Problems Using the Prior Implicit in a Denoisercited by 78
  6. 2020Dual Contradistinctive Generative Autoencodercited by 58
  7. 2022On the Principles of Parsimony and Self-Consistency for the Emergence of Intelligencecited by 50
  8. 2014Sparse Modeling for Image and Vision Processingcited by 48
  9. 2017Learned Convolutional Sparse Codingcited by 26
  10. 2014Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Methodcited by 22
  11. 2016Polynomial-time Tensor Decompositions with Sum-of-Squarescited by 22
  12. 2015Complete Dictionary Recovery over the Spherecited by 19
  13. 2018Subgradient Descent Learns Orthogonal Dictionariescited by 17
  14. 2021Closed-Loop Data Transcription to an LDR via Minimaxing Rate Reductioncited by 17
  15. 2022Incremental Learning of Structured Memory via Closed-Loop Transcriptioncited by 17
  16. 2021Convolutional Normalization: Improving Deep Convolutional Network Robustness and Trainingcited by 15
  17. 2017Fast and robust tensor decomposition with applications to dictionary learningcited by 14
  18. 2022Revisiting Sparse Convolutional Model for Visual Recognitioncited by 13
  19. 2023Unsupervised Manifold Linearizing and Clusteringcited by 12
  20. 2018Efficient Dictionary Learning with Gradient Descentcited by 10
  21. 2019Sparse Generative Adversarial Networkcited by 8
  22. 2020When and How Can Deep Generative Models be Inverted?cited by 8
  23. 2022Unsupervised Learning of Structured Representations via Closed-Loop Transcriptioncited by 7
  24. 2020Complete Dictionary Learning via ℓp-norm Maximizationcited by 6
  25. 2022Pursuit of a Discriminative Representation for Multiple Subspaces via Sequential Gamescited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 1; 2025: 0; 2026: 1.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Sample what you cant compress
  2. 2025Interpreting Large Text-to-Image Diffusion Models with Dictionary Learning
  3. 2024Deep Compression Autoencoder for Efficient High-Resolution Diffusion Models
  4. 2024One-Step is Enough: Sparse Autoencoders for Text-to-Image Diffusion Models
  5. 2026DC-SAE: Deep Compression Semantic Autoencoder for Faster Diffusion Convergence
  6. 2026SynthSAEBench: Evaluating Sparse Autoencoders on Scalable Realistic Synthetic Data
  7. 2025Sparse Autoencoders, Again?
  8. 2025DC-AE 1.5: Accelerating Diffusion Model Convergence with Structured Latent Space