paper-with-me

홈 › Papers

Lipschitz Learning for Signal Recovery

2019-10-04 · Hong Jiang, Jong-Hoon Ahn, Xiaoyang Wang

We consider the recovery of signals from their observations, which are samples of a transform of the signals rather than the signals themselves, by using machine learning (ML). We will develop a theoretical framework to characterize the signals that can be robustly recovered from their observations by an ML algorithm, and establish a Lipschitz condition on signals and observations that is both necessary and sufficient for the existence of a robust recovery. We will compare the Lipschitz condition with the well-known restricted isometry property of the sparse recovery of compressive sensing, and show the former is more general and less restrictive. For linear observations, our work also suggests an ML method in which the output space is reduced to the lowest possible dimension.

📄 PDF Abstract BibTeX arXiv:1910.02142

Code (0)

등록된 구현이 없습니다.

Tasks

Compressive Sensing

Similar Papers 제목 키워드 기반

Signal Recovery from Pooling Representations

2013-11-16 · Joan Bruna, Arthur Szlam, Yann Lecun

In this work we compute lower Lipschitz bounds of $\ell_p$ pooling operators for $p=1, 2, \infty$ as well as $\ell_p$ pooling operators preceded by half-rectification layers. These give sufficient conditions for the desi…

regression

Deep generative demixing: Recovering Lipschitz signals from noisy subgaussian mixtures

2020-10-13 · Aaron Berk

Generative neural networks (GNNs) have gained renown for efficaciously capturing intrinsic low-dimensional structure in natural images. Here, we investigate the subgaussian demixing problem for two Lipschitz signals, wit…

compressed sensing

Active Learning for Conditional Generative Compressed Sensing

2026-05-06 · Alexander DeLise, Nick Dexter arxiv

Generative compressed sensing uses the range of a pretrained generator as a nonlinear model for recovering structured signals from limited measurements. We study a conditional version of this problem for image recovery f…

Active Learning

Constant-Expansion Suffices for Compressed Sensing with Generative Priors

2020-06-07 · NeurIPS 2020 12 · Constantinos Daskalakis, Dhruv Rohatgi, Manolis Zampetakis

Generative neural networks have been empirically found very promising in providing effective structural priors for compressed sensing, since they can be trained to span low-dimensional data manifolds in high-dimensional …

compressed sensingRetrieval

Recovering Hölder smooth functions from noisy modulo samples

2021-12-02 · Michaël Fanuel, Hemant Tyagi

In signal processing, several applications involve the recovery of a function given noisy modulo samples. The setting considered in this paper is that the samples corrupted by an additive Gaussian noise are wrapped due t…

Denoising