Metraipolis › archive › dc_ca35e877f35a
Restricted isometry of sampled Fourier and Hadamard matrices via entropic descent — arXiv:2609.22568
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22568
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:55:23.061Z
- SHA-256 of the archived text
6307b23ec95d9248f3af4fa4b83ee9c642835d1d8892c350084758528b8579bd- Stable URL of this page
https://metraipolis.com/documento/dc_ca35e877f35a
How to cite
Restricted isometry of sampled Fourier and Hadamard matrices via entropic descent — arXiv:2609.22568 — arXiv (en), https://arxiv.org/abs/2609.22568 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ca35e877f35a (Metraipolis archive dc_ca35e877f35a, sha256 6307b23ec95d9248f3af4fa4b83ee9c642835d1d8892c350084758528b8579bd)
BibTeX
@misc{dcca35e877f35a,
title = {Restricted isometry of sampled Fourier and Hadamard matrices via entropic descent — arXiv:2609.22568},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22568},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ca35e877f35a; sha256 6307b23ec95d9248f3af4fa4b83ee9c642835d1d8892c350084758528b8579bd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22568. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this second paper on descent methods as proof mechanisms in harmonic analysis (the first treated Bourgain's $\Lambda(p)$ selection theorem), entropic mirror descent gives an improved restricted isometry bound, improving sampling and recovery bounds in the Fourier Ratio program. Let $H$ be a complex $n\times n$ matrix with $H^*H=nI$ and $|H_{ij}|=1$. For fixed $0<\varepsilon<\frac14$ and $A_0>0$, independent Bernoulli row selection with expected cardinality $C_{\varepsilon,A_0}r\log\frac{2en}{r}\log(2r)\leq m\leq n/2$ preserves, after normalization by $\sqrt m$, the squared norm of every complex vector $y$ with $\|y\|_1\leq\sqrt r\|y\|_2$ within a factor $1\pm\varepsilon$, with failure probability at most $Cn^{-A_0}$. This includes every $r$-sparse vector and also fully supported ones; support size enters only through this inequality. For $y=\widehat f$ the condition is exactly $\operatorname{FR}(f)^2\leq r$, where $\operatorname{FR}(f)=\|\widehat f\|_1/\|\widehat f\|_2$, giving uniform energy sampling and approximate recovery even for signals with full Fourier support. The same holds for a uniform subset of prescribed cardinality, and for discrete Fourier and real Hadamard matrices. At fixed accuracy the bound removes one sparsity logarithm from the earlier count and replaces $\log n$ by $\log\frac{2en}{r}$; for Walsh matrices it matches, up to constants, the lower bound of Błasiok et al.\ in their range. One relative-entropy potential controls the corrections of an amplitude predictor at every scale; counting them on the symmetric difference of two samples gives the uniform estimate. We also prove the sufficient bound $C_{A_0}\varepsilon^{-5}r\log\frac{2en}{r}\log\frac{2r}{\varepsilon}$, and stable sparse recovery from $Cs\log\frac{2en}{s}\log(2s)$ measurements, with error controlled by the noise and the best $s$-term approximation.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.IT).
Categorie arXiv: Information Theory (cs.IT) ; Classical Analysis and ODEs (math.CA).
Pagina del lavoro: https://arxiv.org/abs/2609.22568 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T21:44:07.451Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).