Pith. sign in

REVIEW 1 cited by

On the Stability of Approximate Message Passing with Independent Measurement Ensembles

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.08754 v4 pith:GIGEF4AU submitted 2023-05-15 cs.IT eess.SPmath.IT

classification cs.ITeess.SPmath.IT
keywords measurementclassensemblessmoothnessassumedcontrolledfunctionfunctions
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Approximate message passing (AMP) is a scalable, iterative approach to signal recovery. For structured random measurement ensembles, including independent and identically distributed (i.i.d.) Gaussian and rotationally-invariant matrices, the performance of AMP can be characterized by a scalar recursion called state evolution (SE). The pseudo-Lipschitz (polynomial) smoothness is conventionally assumed. In this work, we extend the SE for AMP to a new class of measurement matrices with independent (not necessarily identically distributed) entries. We also extend it to a general class of functions, called controlled functions which are not constrained by the polynomial smoothness; unlike the pseudo-Lipschitz function that has polynomial smoothness, the controlled function grows exponentially. The lack of structure in the assumed measurement ensembles is addressed by leveraging Lindeberg-Feller. The lack of smoothness of the assumed controlled function is addressed by a proposed conditioning technique leveraging the empirical statistics of the AMP instances. The resultants grant the use of the SE to a broader class of measurement ensembles and a new class of functions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Convergence Guarantees of Gradient Descent for Neural Networks via Generalized Lipschitz Smoothness

    cs.LG 2026-08 conditional novelty 7.0 of 10

    Gradient descent on any feedforward network with Lipschitz-smooth, linearly bounded activations drives the minimum squared gradient norm to zero at rate O(1/T^(1/L)) without boundedness or overparameterization assumptions.

Pith tools