ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2303.05582
97
0
v1v2v3 (latest)

Generalization analysis of an unfolding network for analysis-based Compressed Sensing

9 March 2023
Vicky Kouni
Yannis Panagakis
    MLT
ArXiv (abs)PDFHTML
Main:24 Pages
2 Figures
Bibliography:7 Pages
2 Tables
Abstract

Unfolding networks have shown promising results in the Compressed Sensing (CS) field. Yet, the investigation of their generalization ability is still in its infancy. In this paper, we perform generalization analysis of a state-of-the-art ADMM-based unfolding network, which jointly learns a decoder for CS and a sparsifying redundant analysis operator. To this end, we first impose a structural constraint on the learnable sparsifier, which parametrizes the network's hypothesis class. For the latter, we estimate its Rademacher complexity. With this estimate in hand, we deliver generalization error bounds for the examined network. Finally, the validity of our theory is assessed and numerical comparisons to a state-of-the-art unfolding network are made, on synthetic and real-world datasets. Our experimental results demonstrate that our proposed framework complies with our theoretical findings and outperforms the baseline, consistently for all datasets.

View on arXiv
@article{kouni2025_2303.05582,
  title={ Generalization analysis of an unfolding network for analysis-based Compressed Sensing },
  author={ Vicky Kouni and Yannis Panagakis },
  journal={arXiv preprint arXiv:2303.05582},
  year={ 2025 }
}
Comments on this paper