theoretical computer science

Improved RIP Bounds for Gaussian Partial Circulant Matrices

arXiv:2607.27676

summary

The paper establishes a tighter restricted isometry property bound for Gaussian partial circulant matrices with any fixed sampling set, improving previous results by refining entropy and moment arguments.

Abstract

We prove an improved restricted isometry bound for Gaussian partial circulant matrices with arbitrary prescribed sampling sets. There is a universal constant such that the following holds. Let be positive integers, let be any fixed set with , and let . For every , the normalized partial circulant matrix generated by has the RIP of order with constant at most , with probability at least over the draw of , provided \[ m\geq Cδ^{-2}K \max\{\log^2(eK)\log(2N)\log(em),\log(2/η)\}. \] The proof refines the Maurey entropy step in the chaos-process argument by combining a noncommutative Khintchine inequality with a Schatten moment estimate controlled by , replacing one factor in the Krahmer--Mendelson--Rauhut bound by .

Topics & keywords

#restricted isometry property#gaussian partial circulant matrices#random matrix theory#compressed sensing#entropy methodsrestricted isometry propertypartial circulant matrixMaurey entropynoncommutative Khintchine inequalitySchatten moment estimateKrahmer-Mendelson-Rauhut bound
Improved RIP Bounds for Gaussian Partial Circulant Matrices · wovepaper