Metraipolis › archive › dc_89997be17ba7
Estimating the generator of matrix exponential time-series — arXiv:2611.04521
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04521
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T19:01:50.574Z
- SHA-256 of the archived text
12c082147cd1f4bc46626d85513ac01939a5fbfa8ad8b5eda5b10c296d884525- Stable URL of this page
https://metraipolis.com/documento/dc_89997be17ba7
How to cite
Estimating the generator of matrix exponential time-series — arXiv:2611.04521 — arXiv (en), https://arxiv.org/abs/2611.04521 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_89997be17ba7 (Metraipolis archive dc_89997be17ba7, sha256 12c082147cd1f4bc46626d85513ac01939a5fbfa8ad8b5eda5b10c296d884525)
BibTeX
@misc{dc89997be17ba7,
title = {Estimating the generator of matrix exponential time-series — arXiv:2611.04521},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04521},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_89997be17ba7; sha256 12c082147cd1f4bc46626d85513ac01939a5fbfa8ad8b5eda5b10c296d884525},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04521. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The achievable precision in estimating the spectrum of a time-series signal that is promised to be sparse in Fourier space deteriorates rapidly as the spectral peaks get closer together, as soon as we introduce noise. Here, we study the related task of generator estimation: estimating the generator of a matrix exponential time-series and its eigenvalues. We obtain rigorous non-asymptotic precision guarantees on genESPRIT, a practical algorithm solving generator estimation, and show that this task can be solved with precision independent of the spectral spacing. The guarantees are complemented by a Cramér--Rao analysis of a relaxation of the problem. In particular, in the case of unitary data with bounded additive noise with effective entrywise variance $\sigma^2$, we show that genESPRIT estimates the associated propagator matrix in Frobenius norm with precision scaling as $\tilde{\mathcal{O}}(\sigma NL^{-\frac12})$ in the length of the time-series $L$ and matrix dimension $N$, matching the corresponding spectrum-independent Cramér--Rao standard deviation scaling up to logarithmic factors. We prove that the matching distance error in the spectrum estimated by genESPRIT scales as $\tilde{\mathcal{O}} (\sigma^2 N^3 L^{-1} + \sigma N^{\frac32} L^{-\frac32} )$, which we compare to the lower bound on the corresponding Cramér--Rao bound with the asymptotic standard deviation scaling $\mathcal{O}(\sigma L^{-\frac32})$. These guarantees provide the first rigorous bounds on solving the generator estimation problem. As the matrix exponential time-series can be obtained from linearly independent vector time-series by concatenation, this work opens up a new direction in spectral estimation, which circumvents the problem of crowded spectra, under the additional assumption of linear independence.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.04521 — 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-11-04T18:38:39.756Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).