Provides an AMP-based asymptotic analysis of SLOPE, characterizing iterate dynamics via state evolution and proving asymptotic convergence to the SLOPE solution.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Dense random combinatorial matrices have smallest singular value typically of order n^{-1/2}.
citing papers explorer
-
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing
Provides an AMP-based asymptotic analysis of SLOPE, characterizing iterate dynamics via state evolution and proving asymptotic convergence to the SLOPE solution.
-
An upper bound on the smallest singular value of dense random combinatorial matrices
Dense random combinatorial matrices have smallest singular value typically of order n^{-1/2}.