2019/12/06 by Akshay Kamath, Kamath, Akshay, Sushrut Karmalkar +3
Computer Science · Earth and Planetary Sciences · Engineering · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Image and Signal Denoising Methods #Information Theory (cs.IT) #Machine Learning (cs.LG) #Seismic Imaging and Inversion Techniques #Sparse and Compressive Sensing Techniques
paper · pdf · doi:10.48550/arxiv.1912.02938
openalex publication_date 2019/12/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The goal of compressed sensing is to learn a structured signal x from a limited number of noisy linear measurements y ≈ Ax. In traditional compressed sensing, "structure" is represented by sparsity in some known basis. Inspired by the success of deep learning in modeling images, recent work starting with~\citeBJPD17 has instead considered structure to come from a generative model G: ℝk → ℝn. We present two results establishing the difficulty of this latter task, showing that existing bounds are tight. First, we provide a lower bound matching the~\citeBJPD17 upper bound for compressed sensing from L-Lipschitz generative models G. In particular, there exists such a function that requires roughly Ω(k log L) linear measurements for sparse recovery to be possible. This holds even for the more relaxed goal of nonuniform recovery. Second, we show that generative models generalize sparsity as a representation of structure. In particular, we construct a ReLU-based neural network G: ℝ2k → ℝn with O(1) layers and O(kn) activations per layer, such that the range of G contains all k-sparse vectors.