Quantitative Universality of Approximate Message Passing for Rank-One Quadratic Sensing
cs.IT, math.IT, stat.ML
Submitted: 2026-10-04
Updated: 2026-10-04
Sources
- Universality of first-order methods on random and deterministic matrices
- On Universality of Non-Separable Approximate Message Passing Algorithms
- When does Gaussian equivalence fail and how to fix it: Non-universal behavior of random features with quadratic scaling
Related papers
- Language Modeling is Monotone Compression
- Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
- Discrepancy for Random Linear Codes
- A New Approach to Code Smoothing Bounds
- Contextual Memory-Enhanced Source Coding for Low-SNR Communications
- Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels