Low-Rank Toeplitz Matrix Restoration: Descent Cone Analysis and Structured Random Matrix (2407.03175v1)
Abstract: This note demonstrates that we can stably recover rank $r$ Toeplitz matrix $\pmb{X}\in\mathbb{R}{n\times n}$ from a number of rank one subgaussian measurements on the order of $r\log{2} n$ with an exponentially decreasing failure probability by employing a nuclear norm minimization program. Our approach utilizes descent cone analysis through Mendelson's small ball method with the Toeplitz constraint. The key ingredient is to determine the spectral norm of the random matrix of the Topelitz structure, which may be of independent interest.This improves upon earlier analyses and resolves the conjecture in Chen et al. (IEEE Transactions on Information Theory, 2015).
- Matrix concentration inequalities and free probability. Inventiones mathematicae, 234(1):419–487, 2023.
- Rop: Matrix recovery via rank-one projections. The Annals of Statistics, 43(1):102–138, 2015.
- Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming. Communications on Pure and Applied Mathematics, 66(8):1241–1274, 2013.
- Conjugate gradient methods for toeplitz systems. SIAM Review, 38(3):427–482, 1996.
- The convex geometry of linear inverse problems. Foundations of Computational mathematics, 12(6):805–849, 2012.
- Robust spectral compressed sensing via structured matrix completion. IEEE Transactions on Information Theory, 60(10):6576–6601, 2014.
- Exact and stable covariance estimation from quadratic sampling via convex programming. IEEE Transactions on Information Theory, 61(7):4034–4059, 2015.
- Bounding the smallest singular value of a random matrix without concentration. International Mathematics Research Notices, 2015(23):12991–13008, 2015.
- On the convex geometry of blind deconvolution and matrix completion. Communications on Pure and Applied Mathematics, 74(4):790–832, 2021.
- Low rank matrix recovery from rank one measurements. Applied and Computational Harmonic Analysis, 42(1):88–116, 2017.
- On sparse reconstruction from fourier and gaussian measurements. Communications on Pure and Applied Mathematics, 61(8):1025–1045, 2008.
- Joel A Tropp. Convex recovery of a structured signal from independent random linear measurements. Sampling Theory, a Renaissance: Compressive Sensing and Other Developments, pages 67–101, 2015.
- Roman Vershynin. High-Dimensional Probability: An Introduction with Applications in Data Science, volume 47. Cambridge University Press, 2018.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.