English

Robust Spectral Recovery for Dynamical Sampling

Information Theory 2026-04-13 v1 Numerical Analysis math.IT Numerical Analysis

Abstract

We study the spectral recovery problem for dynamical sampling on a finite cyclic grid. Given time snapshots obtained from a fixed uniform spatial subsampling of the orbit x=Afx_{\ell}=A^{\ell}f, we aim to recover the spectrum of the unknown circular convolution operator AA. However, in the presence of outliers, even in only a few snapshots, existing approaches often struggle to recover the spectrum. We address this challenge by proposing a novel robust spectral recovery model in the presence of time-sparse corruptions. We propose a robust pipeline that lifts the problem to a sequence of robust low-rank Hankel recovery and completion tasks, followed by Prony-type spectral estimation. Numerical experiments confirm the accurate spectral recovery of the proposed approach and exhibit its superior robustness against state-of-the-art under various settings.

Keywords

Cite

@article{arxiv.2604.09477,
  title  = {Robust Spectral Recovery for Dynamical Sampling},
  author = {HanQin Cai and Longxiu Huang and Tianming Wang and Juntao You},
  journal= {arXiv preprint arXiv:2604.09477},
  year   = {2026}
}

Comments

2026 IEEE International Symposium on Information Theory

R2 v1 2026-07-01T12:03:09.755Z