Metraipolis › archive › dc_ebad82daf994
Non-asymptotic Analysis of Expected Reconstruction Risk for Trigonometric Polynomial Models — arXiv:2609.29286
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29286
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:43:03.811Z
- SHA-256 of the archived text
7e92d9b1acd8c9cf80da85ad2da1486aa1131d9633ddecf566f282971762356b- Stable URL of this page
https://metraipolis.com/documento/dc_ebad82daf994
How to cite
Non-asymptotic Analysis of Expected Reconstruction Risk for Trigonometric Polynomial Models — arXiv:2609.29286 — arXiv (en), https://arxiv.org/abs/2609.29286 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ebad82daf994 (Metraipolis archive dc_ebad82daf994, sha256 7e92d9b1acd8c9cf80da85ad2da1486aa1131d9633ddecf566f282971762356b)
BibTeX
@misc{dcebad82daf994,
title = {Non-asymptotic Analysis of Expected Reconstruction Risk for Trigonometric Polynomial Models — arXiv:2609.29286},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29286},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ebad82daf994; sha256 7e92d9b1acd8c9cf80da85ad2da1486aa1131d9633ddecf566f282971762356b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29286. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We investigate the expected reconstruction risk of trigonometric polynomial models under different sampling schemes. Through numerical experiments, we observe that when the sampling nodes $\{t_l\}_{l=1}^m$ are i.i.d. random variables uniformly distributed over $[0,1)$, the associated structured random matrix $\pmb{A} \in \mathbb{C}^{m \times N}$ with $A_{l,k} = e^{2\pi \mathrm{i} kt_l}, k \in \Gamma = \{-q, \dots, q\}, N = 2q+1$ frequently becomes nearly singular or severely ill-conditioned. As a consequence, the expected reconstruction risk exhibits divergent behavior. In contrast, when the sampling nodes $t_l$ are either equidistant points or small random perturbations of an equidistant grid, the expected reconstruction risk undergoes a sharp phase transition at the interpolation threshold $m=N$. To better understand the underlying mechanisms behind these different phenomena, we characterize the expected reconstruction risk through the spectral quantity $\sum_{i=1}^{r} \frac{1}{\sigma_i^2(\pmb{A})}$, where $\sigma_i(\pmb{A})$ denotes the singular values of the sampling matrix. Based on this spectral representation, we theoretically prove that the expected reconstruction risk diverges under uniformly distributed random sampling. Furthermore, we derive an explicit formula for the expected reconstruction risk in the equidistant sampling case and establish upper and lower bounds for the expected reconstruction risk under jittered sampling.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.29286 — 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-08T06:08:02.454Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).