High-Dimensional Estimation of Structured Signals from Non-Linear Observations with General Convex Loss Functions
Martin Genzel

TL;DR
This paper establishes that structured signals can be accurately estimated from non-linear, noisy Gaussian observations using convex loss functions, with error rates influenced only by the non-linearity as a multiplicative factor.
Contribution
It extends existing results to a broad class of convex loss functions and includes adversarial noise, providing a unified framework for high-dimensional signal reconstruction.
Findings
Accurate recovery when observations exceed the effective dimension of the signal set.
Non-linearity affects error rate only by a multiplicative constant.
Framework applies to compressed sensing, signal processing, and statistical learning.
Abstract
In this paper, we study the issue of estimating a structured signal from non-linear and noisy Gaussian observations. Supposing that is contained in a certain convex subset , we prove that accurate recovery is already feasible if the number of observations exceeds the effective dimension of , which is a common measure for the complexity of signal classes. It will turn out that the possibly unknown non-linearity of our model affects the error rate only by a multiplicative constant. This achievement is based on recent works by Plan and Vershynin, who have suggested to treat the non-linearity rather as noise which perturbs a linear measurement process. Using the concept of restricted strong convexity, we show that their results for the generalized Lasso can be extended to a fairly large class of convex loss functions. Moreover, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
