mlsanityData to 7 Oct 2026

The Generalized Lasso with Nonlinear Observations and Generative Priors

arXiv 2006.12415 ↗First posted 22 Jun 2020stat.ML cs.IT cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

In this paper, we study the problem of signal estimation from noisy non-linear measurements when the unknown n-dimensional signal is in the range of an L-Lipschitz continuous generative model with bounded k-dimensional inputs. We make the assumption of sub-Gaussian measurements, which is satisfied by a wide range of measurement models, such as linear, logistic, 1-bit, and other quantized models. In addition, we consider the impact of adversarial corruptions on these measurements. Our analysis is based on a generalized Lasso approach (Plan and Vershynin, 2016). We first provide a non-uniform recovery guarantee, which states that under i.i.d.~Gaussian measurements, roughly Oleft(frackε2log Lright) samples suffice for recovery with an ℓ2-error of ε, and that this scheme is robust to adversarial noise. Then, we apply this result to neural network generative models, and discuss various extensions to other models and non-i.i.d.~measurements. Moreover, we show that our result can be extended to the uniform recovery guarantee under the assumption of a so-called local embedding property, which is satisfied by the 1-bit and censored Tobit models.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 6; 2023: 2; 2024: 1; 2025: 3.

15 papers.

Sort:

By area: