mlsanityData to 14 Oct 2026

Perfect reconstruction of sparse signals using nonconvexity control and one-step RSB message passing

arXiv 2512.17426 ↗First posted 19 Dec 2025stat.ML cond-mat.dis-nn cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We consider sparse signal reconstruction via minimization of the smoothly clipped absolute deviation (SCAD) penalty, and develop one-step replica-symmetry-breaking (1RSB) extensions of approximate message passing (AMP), termed 1RSB-AMP. Starting from the 1RSB formulation of belief propagation, we derive explicit update rules of 1RSB-AMP together with the corresponding state evolution (1RSB-SE) equations. A detailed comparison shows that 1RSB-AMP and 1RSB-SE agree remarkably well at the macroscopic level, even in parameter regions where replica-symmetric (RS) AMP, termed RS-AMP, diverges and where the 1RSB description itself is not expected to be thermodynamically exact. Fixed-point analysis of 1RSB-SE reveals a phase diagram consisting of success, failure, and diverging phases, as in the RS case. However, the diverging-region boundary now depends on the Parisi parameter due to the 1RSB ansatz, and we propose a new criterion---minimizing the size of the diverging region---rather than the conventional zero-complexity condition, to determine its value. Combining this criterion with the nonconvexity-control (NCC) protocol proposed in a previous RS study improves the algorithmic limit of perfect reconstruction compared with RS-AMP. Numerical solutions of 1RSB-SE and experiments with 1RSB-AMP confirm that this improved limit is achieved in practice, though the gain is modest and remains slightly inferior to the Bayes-optimal threshold. We also report the behavior of thermodynamic quantities---overlaps, free entropy, complexity, and the non-self-averaging susceptibility---that characterize the 1RSB phase in this problem.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 30 references that are in the map. First posted on arXiv 19 Dec 2025.

Builds on

7 of 30 references.

References · 7

  1. 2015Statistical physics of inference: Thresholds and algorithmscited by 128
  2. 2018Optimization of the Sherrington-Kirkpatrick Hamiltoniancited by 20
  3. 2015The backtracking survey propagation algorithm for solving random K-SAT problemscited by 14
  4. 2018Approximate Survey Propagation for Statistical Inferencecited by 6
  5. 2019Generalized Approximate Survey Propagation for High-Dimensional Estimationcited by 4
  6. 2018L1-Penalized Censored Gaussian Graphical Modelcited by 2
  7. 2019Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity controlcited by 2

Built on by

Not cited yet.