Multi-Layer Sparse Coding: The Holistic Way
Not on the map. Why?
Abstract (arXiv)
The recently proposed multi-layer sparse model has raised insightful connections between sparse representations and convolutional neural networks (CNN). In its original conception, this model was restricted to a cascade of convolutional synthesis representations. In this paper, we start by addressing a more general model, revealing interesting ties to fully connected networks. We then show that this multi-layer construction admits a brand new interpretation in a unique symbiosis between synthesis and analysis models: while the deepest layer indeed provides a synthesis representation, the mid-layers decompositions provide an analysis counterpart. This new perspective exposes the suboptimality of previously proposed pursuit approaches, as they do not fully leverage all the information comprised in the model constraints. Armed with this understanding, we address fundamental theoretical issues, revisiting previous analysis and expanding it. Motivated by the limitations of previous algorithms, we then propose an integrated - holistic - alternative that estimates all representations in the model simultaneously, and analyze all these different schemes under stochastic noise assumptions. Inspired by the synthesis-analysis duality, we further present a Holistic Pursuit algorithm, which alternates between synthesis and analysis sparse coding steps, eventually solving for the entire model as a whole, with provable improved performance. Finally, we present numerical results that demonstrate the practical advantages of our approach.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Apr 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 0; 2024: 3; 2025: 1; 2026: 1.
9 papers.
- 2021Learning to Optimize: A Primer and A Benchmarkcited by 208
- 2022Revisiting Sparse Convolutional Model for Visual Recognitioncited by 14
- 2024SPAC: Sampling-based Progressive Attribute Compression for Dense Point Cloudscited by 11
- 2024Convergence Analysis for Deep Sparse Coding via Convolutional Neural Networkscited by 2
- 2024Pivotal Auto-Encoder via Self-Normalizing ReLUcited by 1
- 2025FD-LSCIC: Frequency Decomposition-based Learned Screen Content Image Compressioncited by 1
- 2021Learned Interpretable Residual Extragradient ISTA for Sparse Codingcited by 0
- 2022WSEBP: A Novel Width-depth Synchronous Extension-based Basis Pursuit Algorithm for Multi-Layer Convolutional Sparse Codingcited by 0
- 2026Accelerating Hierarchical Sparse Predictive Coding with Hybrid Amortized Inferencecited by 0
- 2026Accelerating Hierarchical Sparse Predictive Coding with Hybrid Amortized Inference26 Jun 2026
- 2025FD-LSCIC: Frequency Decomposition-based Learned Screen Content Image Compression21 Feb 2025
- 2024SPAC: Sampling-based Progressive Attribute Compression for Dense Point Clouds16 Sep 2024
- 2024Convergence Analysis for Deep Sparse Coding via Convolutional Neural Networks10 Aug 2024
- 2024Pivotal Auto-Encoder via Self-Normalizing ReLU23 Jun 2024
- 2022Revisiting Sparse Convolutional Model for Visual Recognition24 Oct 2022
- 2022WSEBP: A Novel Width-depth Synchronous Extension-based Basis Pursuit Algorithm for Multi-Layer Convolutional Sparse Coding28 Mar 2022
- 2021Learned Interpretable Residual Extragradient ISTA for Sparse Coding22 Jun 2021
- 2021Learning to Optimize: A Primer and A Benchmark23 Mar 2021