Source-linked AI summary
The LASSO with Non-linear Measurements is Equivalent to One With Linear Measurements
Chrtistos Thrampoulidis, Ehsan Abbasi, Babak Hassibi
TL;DR
The paper asks whether the regularized Generalized LASSO can estimate structured signals from nonlinear measurements. It derives asymptotic error results and relates nonlinear-measurement performance to corresponding scaled, noisy linear measurements.
Problem
The paper asks whether the Generalized LASSO remains a good estimator of x0 when measurements use a nonlinear link function.
Source: 4) Using the LASSO for Non-linear… · p. 2Method
The paper analyzes the regularized Generalized LASSO asymptotically and compares its nonlinear-measurement error with that under corresponding linear measurements.
Source: C. Discussion of Relevant Literature · pp. 4–5, B. General Result · p. 7Results
Theorem 2.1 precisely relates Generalized LASSO error under nonlinear measurements to its error under appropriately scaled noisy linear measurements.
Source: B. General Result · p. 7Takeaways & Limitations
The paper provides asymptotically precise nonlinear-measurement LASSO results, including for regularizers beyond the ℓ1-norm.
Source: C. Discussion of Relevant Literature · p. 5
Abstract
from arXiv · showhide
Consider estimating an unknown, but structured, signal $x_0\in R^n$ from $m$ measurement $y_i=g_i(a_i^Tx_0)$, where the $a_i$'s are the rows of a known measurement matrix $A$, and, $g$ is a (potentially unknown) nonlinear and random link-function. Such measurement functions could arise in applications where the measurement device has nonlinearities and uncertainties. It could also arise by design, e.g., $g_i(x)=\text{sign}(x+z_i)$, corresponds to noisy 1-bit quantized measurements. Motivated by the classical work of Brillinger, and more recent work of Plan and Vershynin, we estimate $x_0$ via solving the Generalized-LASSO for some regularization parameter $\lambda>0$ and some (typically non-smooth) convex structure-inducing regularizer function. While this approach seems to naively ignore the nonlinear function $g$, both Brillinger (in the non-constrained case) and Plan and Vershynin have shown that, when the entries of $A$ are iid standard normal, this is a good estimator of $x_0$ up to a constant of proportionality $\mu$, which only depends on $g$. In this work, we considerably strengthen these results by obtaining explicit expressions for the squared error, for the \emph{regularized} LASSO, that are asymptotically \emph{precise} when $m$ and $n$ grow large. A main result is that the estimation performance of the Generalized LASSO with non-linear measurements is \emph{asymptotically the same} as one whose measurements are linear $y_i=\mu a_i^Tx_0 + \sigma z_i$, with $\mu = E\gamma g(\gamma)$ and $\sigma^2 = E(g(\gamma)-\mu\gamma)^2$, and, $\gamma$ standard normal. To the best of our knowledge, the derived expressions on the estimation performance are the first-known precise results in this context. One interesting consequence of our result is that the optimal quantizer of the measurements that minimizes the estimation error of the LASSO is the celebrated Lloyd-Max quantizer.
I. INTRODUCTION
The introduction frames structured-signal recovery from nonlinear measurements and asks whether the Generalized LASSO remains useful despite its linear-model objective. It presents asymptotically precise results relating nonlinear-measurement performance to that of corresponding noisy linear measurements.
A. Problem Setup
- The paper studies estimating an unknown signal x0 from m measurements.Source: 1) Non-linear Measurements · p. 1
1) Non-linear Measurements:
- Each measurement applies a possibly random link function g to a known measurement vector’s inner product with x0; examples include noisy 1-bit measurements and censored Tobit observations.Source: 1) Non-linear Measurements · p. 1
2) Structured Signals:
- Structured signals may be sparse or low-rank, and convex nonsmooth regularizers such as the ℓ1-norm or nuclear norm encode these structures.Source: 2) Structured Signals · p. 2
3) An Algorithm for Linear Measurements: The Generalized LASSO:
- The Generalized LASSO fits Ax to y with a regularization parameter λ and a structure-inducing function f.The introduction identifies ℓ1, group, and fused LASSO as examples of this formulation.Source: 3) An Algorithm for Linear… · p. 2, 2) Structured Signals · p. 2
4) Using the LASSO for Non-linear Measurements?:
- Brillinger analyzed unregularized least squares, while Plan and Vershynin [PV15] gave upper bounds for constrained LASSO in structured high-dimensional settings.The introduction characterizes the earlier bounds as not tight.Source: 4) Using the LASSO for Non-linear… · pp. 2–3
B. Summary of Contributions
- For iid Gaussian A, nonlinear-measurement LASSO has the same asymptotic performance as linear measurements scaled by μ and corrupted by Gaussian noise of variance σ².The predictions capture x0, f, and λ for all λ over a wide class of f and g.Source: B. Summary of Contributions · p. 3
C. Discussion of Relevant Literature
The paper places its nonlinear-measurement analysis alongside prior precise LASSO results for linear measurements and constrained-LASSO bounds. It extends precise error analysis to regularized LASSO under specified Gaussian-design and asymptotic assumptions.
C. Discussion of Relevant Literature
- The least-squares result of Brillinger is extended from fixed n to m/n=δ∈(1,∞) with both dimensions growing.The paper also considers the Generalized LASSO rather than only least squares.Source: C. Discussion of Relevant Literature · p. 4
- For the Generalized LASSO, the error analysis captures the roles of x0, f, and λ and allows finite error when δ<1.The paper notes that least squares is a special case of this estimator.Source: C. Discussion of Relevant Literature · p. 4
- Relative to Plan and Vershynin [PV15], the work analyzes regularized LASSO asymptotically and replaces loose upper bounds with precise error expressions.Their result is non-asymptotic, provides only an upper bound, and has unknown absolute proportionality constants.Source: C. Discussion of Relevant Literature · p. 5
- Prior precise LASSO analyses concern linear measurements, using AMP for ℓ1-regularized cases and GMT for broader convex-regularizer analyses.The paper positions its nonlinear-measurement results as a first precise counterpart in this context.Source: C. Discussion of Relevant Literature · p. 5
- For nonlinear measurements, the paper reports the first asymptotically precise performance results for any LASSO-type algorithm; its linear-measurement results also cover regularizers beyond ℓ1.Examples include the ℓ1,2-norm and nuclear norm.Source: C. Discussion of Relevant Literature · p. 5
A. Modeling Assumptions
- The analysis assumes iid standard-Gaussian measurement entries, a convex regularizer, m=δn, and nonzero bounded link-function parameters μ and σ².The stated regularizer conditions include a normalization assumption.Source: A. Modeling Assumptions · p. 6
B. General Result
The section establishes precise asymptotic error results for the Generalized LASSO with nonlinear measurements. Its error is related to that for scaled noisy linear measurements and characterized by a deterministic convex optimization.
B. General Result
- The paper's main contribution is precise evaluation of the asymptotic squared error for structured-signal recovery.The stated probability is over the randomness of A, x0, and g.Source: B. General Result · p. 6
- The nonlinear-measurement Generalized LASSO has asymptotically the same estimation error as the model with linear measurements ylin = A(μx0) + σz.The comparison holds under the stated assumptions as n grows, with probability one.Source: B. General Result · p. 7
- The LASSO's optimal cost converges to the optimal cost of the deterministic program.The error limit and this cost convergence are established under the same assumptions as the nonlinear-to-linear result.Source: B. General Result · p. 7
- The limiting error is the unique solution of a deterministic convex optimization involving three scalar variables.The normalized measurement count δ, regularization parameter λ, and link function through μ and σ² enter explicitly; signal structure and regularizer enter through F.Source: B. General Result · p. 7
C. Examples
The examples apply the general error analysis to sparse recovery and illustrate its use for structured signals. For sparse recovery, the characterization identifies distinct regularization regimes when measurements are compressed.
C. Examples
- The examples formulate sparse recovery using an ℓ1 regularizer and examine signal distributions specified through X0.The provided setup gives X0 a probability density with second moment normalized to 1/ρ.Source: 1) Sparse Recovery · p. 7
1) Sparse Recovery:
- The sparse-recovery error characterization is validated for Gaussian and Bernoulli signal distributions.Figure 2(a) illustrates the theorem for sign measurements; its simulation points average 20 realizations.Source: 1) Sparse Recovery · p. 8, Figure 2 · p. 8
- For compressed measurements, the sparse-recovery characterization distinguishes regimes λ ≤ λcrit and λ ≥ λcrit.The theorem defines λcrit and κcrit through a unique pair of equations when δ ≤ 1; when δ > 1, λcrit = 0.Source: 1) Sparse Recovery · p. 8
- The ℓ2-LASSO analysis covers a generality beyond the previously studied Gaussian distribution of nonzero signal entries.The passage identifies this as the first precise analysis result for the ℓ2-LASSO in that stated generality, while noting earlier Gaussian analysis [TPGH15].Source: 1) Sparse Recovery · p. 8
2) Group-Sparse Recovery:
The section applies the paper’s prediction framework to group-sparse recovery, using an ℓ1,2 regularizer and vector soft thresholding. Theorem 2.2 applies in this setting, with Figure 2(b) illustrating the prediction’s accuracy.
2) Group-Sparse Recovery:
- The signal’s blocks are described as sampled i.i.d. from a probability density in R^b.Source: 2) Group-Sparse Recovery · p. 9
- The signal is assumed to be ρt-block-sparse on average, with m/n = δ in the linear-measurement regime.Source: 2) Group-Sparse Recovery · p. 9
- The ℓ1,2 norm is used to induce block sparsity, yielding the group-LASSO formulation.Source: 2) Group-Sparse Recovery · p. 9
- The analysis uses vector soft thresholding, η, with h distributed as N(0, I_b).Source: 2) Group-Sparse Recovery · p. 9
- Theorem 2.2 applies to this setting, and Figure 2(b) illustrates the accuracy of its prediction.Source: 2) Group-Sparse Recovery · p. 9
3) Low-rank Matrix Recovery:
For low-rank recovery, the analysis uses nuclear-norm regularization and leaves evaluation of its limiting expression for future work. For q-bit compressive sensing, precise error prediction reduces quantizer design to optimizing the noise-to-signal ratio, with Lloyd-Max stationary points of that objective.
3) Low-rank Matrix Recovery:
- The low-rank recovery setup uses nuclear-norm regularization for rank-r matrices with n=d^2, but leaves evaluating F and further details for future work.The limiting analysis assumes X0=USV^t with singular values having a marginal distribution with bounded moments independent of d.Source: 3) Low-rank Matrix Recovery · p. 9
D. An Application to q-bit Compressive Sensing
- q-bit measurements use symmetric decision thresholds and corresponding representation levels, and the LASSO estimates the structured signal from those measurements.The setup considers optimizing thresholds and levels for fixed bit count and measurement count; 1-bit quantization is given as a sign-function example.Source: 1) Setup · pp. 9–10
2) Consequences of Precise Error Prediction:
- The q-bit LASSO error matches that for linear measurements with noise, and lower σ^2/μ^2 corresponds to lower estimation error.Thus, choosing thresholds and quantization levels to reduce error becomes an explicit optimization of σ^2/μ^2.Source: 2) Consequences of Precise Error… · p. 10
- Lloyd-Max algorithm convergence points are stationary points of the quantizer-design objective, although its classical objective is different.The design varies thresholds and quantization levels while keeping the number of bits and measurements fixed.Source: 2) Consequences of Precise Error… · p. 10, 1) Setup · p. 10
APPENDIX PROOF OF THEOREMS 2.1 & 2.2
The proof reduces the nonlinear-measurement error analysis to a Gaussian auxiliary optimization. Its optimizer converges to a unique deterministic scalar characterization, which yields the theorem’s limit.
1) A Key Decomposition:
- Projecting each Gaussian measurement vector onto x0 and its orthogonal complement makes the complement independent of the link-function residual, allowing an equivalent independent-Gaussian replacement.The decomposition is the first proof step; the independence follows from Gaussianity of the measurement matrix.Source: 1) A Key Decomposition · p. 12
2) Applying the cGMT:
- The convex Gaussian min-max theorem converts the primary optimization to an auxiliary one, assuming the error minimizer has a norm bounded independently of n.The proof then targets a deterministic optimization over three scalar variables and convergence of its unique optimizer.Source: 2) Applying the cGMT · p. 13, 3) Analysis of the Auxiliary… · p. 13
3) Analysis of the Auxiliary Optimization:
- The limiting optimization is strongly convex in α and jointly concave in β and τ, and its unique α* is the limit of the auxiliary optimizer.The auxiliary optimization’s optimal cost converges to that of the deterministic problem, and the resulting α* characterizes the error norm.Source: 3) Analysis of the Auxiliary… · pp. 13, 15, 17
- The auxiliary objective’s random norm term converges pointwise by the law of large numbers, while strong convexity supports convergence of its minimizers.Uniform convergence is also needed to transfer convergence from the objective to its min-max value and optimizer.Source: 3) Analysis of the Auxiliary… · pp. 13–15
B. Theorem 2.1
The theorem establishes that nonlinear and matched linear measurements have the same asymptotic error because the limit depends on the link function only through μ and σ^2.
B. Theorem 2.1
- The nonlinear and linear cases have the same asymptotic error because the limiting value depends on g only through μ and σ^2.The two cases share those parameters by definition.Source: B. Theorem 2.1 · p. 17
APPENDIX PROOF OF THEOREM 2.3
The proof specializes Theorem 2.2 to the setup of Section II-C1 and analyzes the limiting optimization’s optimality conditions.
APPENDIX PROOF OF THEOREM 2.3
- In the specialized setup, the error converges in probability to the unique minimizer α* of a max-min problem.The proof analyzes the optimality conditions of H, which is jointly concave in β and p and strongly convex in α.Source: APPENDIX PROOF OF THEOREM 2.3 · p. 17
A. First Order Optimality Conditions.
The appendix characterizes first-order optimality through equations for the optimizer variables and derives conditions for their solutions. In the β=1 case, it also states a uniqueness result above λmin.
A. First Order Optimality Conditions.
- The first-order optimality conditions characterize κ and β through a pair of equations.The appendix obtains these conditions from the optimization problem’s derivatives.Source: A. First Order Optimality Conditions · p. 18
- Differentiating the optimization objective with respect to α and τ and setting the derivatives to zero yields further optimality relations.The proof substitutes these relations into the first-order conditions for β and κ.Source: A. First Order Optimality Conditions · p. 18
- When β*=1 and λ>λmin, κ* is the unique solution to the β=1 equation.The cited fixed-point equation is associated with [BM12, Eqn. (1.9)]; uniqueness is attributed to [DMM11] and [BM12, Prop. 1.3].Source: A. First Order Optimality Conditions · pp. 18–19
B. The Regions of Operation
The appendix divides LASSO operation into a bad regime with 0<β*<1 and a β*=1 regime. For δ<1, a unique critical regularization value separates them; for δ≥1, the bad regime is absent.
B. The Regions of Operation
- For δ<1, a unique λcrit separates Rbad from the β*=1 regime; for δ≥1, Rbad is absent.For δ>1, κ*(λ) is the unique solution to the β=1 equation for every λ≥0.Source: B. The Regions of Operation · pp. 19–20
- Rbad consists of regularization values with an optimal β* strictly between 0 and 1.For δ<1, each λ<λcrit lies in Rbad.Source: B. The Regions of Operation · p. 19
- For δ<1, every λ≤λcrit has α*(λ)=α*(λcrit), so the squared error is constant across this range.The appendix identifies λ<λcrit as Rbad and states the equality of the error parameter throughout that regime.Source: B. The Regions of Operation · pp. 19–20
- For δ<1, there is a unique critical pair (κ, λ) satisfying the equations defining Rcrit.This establishes existence and uniqueness of λcrit in Rcrit.Source: B. The Regions of Operation · pp. 19–20
- For δ<1 and λ>λcrit, κ*(λ) is the unique solution to the β=1 equation.At λ=λcrit, the appendix identifies the transition value delimiting the regimes.Source: B. The Regions of Operation · p. 20
APPENDIX PROOFS FOR SECTION II-D
The appendix describes the Lloyd-Max algorithm and its stationary points, then connects its converging points to an objective for q-bit compressive sensing. In the Gaussian case, the quantizer objective is expressed using τ² and μ.
A. The LM Algorithm
- The Lloyd-Max algorithm alternates between optimizing quantization thresholds and representation levels to minimize scalar mean-square error.Its converging points are stationary points of the objective.Source: A. The LM Algorithm · p. 21
1) Gaussian case:
- For standard Gaussian inputs, the quantizer objective is written as τ²−2μ+1.The Gaussian case sets g to the q-bit quantizer when defining μ and σ².Source: 1) Gaussian case · p. 21
B. q-Bit Compressive Sensing
- For q-bit quantized linear measurements, the Lloyd-Max algorithm is considered for minimizing LASSO reconstruction error.Its converging points are stationary points of the corresponding objective.Source: B. q-Bit Compressive Sensing · p. 22