Generalization analysis of an unfolding network for analysis-based compressed sensing

DOI10.1016/J.ACHA.2025.101787MaRDI QIDQ6932290zbMATH OpenFDO

Authors Vicky Kouni, Yannis Panagakis

Publication date 9 September 2025

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ACHA.2025.101787

zbMATH Keywords

analysis sparsitycompressed sensingdeep unfoldinggeneralization error boundsRademacher complexityunfolding network

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites work

• 10.1162/153244303321897690
• \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Vector-Contraction Inequality for Rademacher Complexities
• An introduction to frames and Riesz bases
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Analysis _1-recovery with frames and Gaussian measurements
• Compressed sensing with coherent and redundant dictionaries
• Compressive sensing and neural networks from a statistical learning perspective
• DECONET: an unfolding network for analysis-based compressed sensing with generalization error bounds
• Foundations of machine learning
• High-dimensional probability. An introduction with applications in data science
• Introduction to finite frame theory
• Robust analysis ℓ₁-recovery from Gaussian measurements and total variation minimization
• The cosparse analysis model and algorithms
• Understanding machine learning. From theory to algorithms

This page was built for publication: Generalization analysis of an unfolding network for analysis-based compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932290)