傅里叶子空间、托普利兹矩阵和指数和的最优结构逼近
Optimal structured approximation of Fourier subspaces, Toeplitz matrices, and exponential sums
AI总结:
研究傅里叶矩阵范围恢复、低秩托普利兹/汉克尔矩阵恢复及有限指数和恢复三个问题,核心方法是应用梯度 - MUSIC算法,贡献是给出在多方面极小极大最优的算法及定量转移原理。
摘要:
本文研究三个结构逼近问题:从单个观测中恢复傅里叶矩阵的范围;恢复被破坏的低秩托普利兹/汉克尔矩阵;从噪声样本中恢复有限指数和。由于难以直接施加结构约束,这三个问题计算上具有挑战性。我们表明应用谱估计的梯度 - MUSIC算法可有效且最优地解决所有三个任务。以满足正则性假设且被任意\(E\in {\mathbb C}^{n\times n}\)破坏且\(\|E\|_2\leq \alpha n\)的秩为\(r\)的托普利兹矩阵\(T\in {\mathbb C}^{n\times n}\)为例,算法输出秩恰好为\(r\)的托普利兹矩阵\(T_\sharp\)使得\(\|T - T_\sharp\|_2 \leq C \|E\|_2\),其中\(C,\alpha>0\)为绝对常数。此性能保证在\(n\)、\(r\)和\(\|E\|_2\)方面是极小极大最优的。对于其他两个结构逼近问题,也提供了在样本数量、秩/稀疏度和噪声水平方面极小极大最优的算法。本文核心是定量转移原理,展示如何将谱估计的计算方法和理论转换为其他三个问题的相应方法和理论。
英文摘要:
This paper studies three structured approximation problems: (1) Recovering the range of a Fourier matrix from a single observation, (2) Recovering a corrupted low-rank Toeplitz/Hankel matrix, and (3) Recovering a finite exponential sum from noisy samples. All three problems are computationally challenging because their structural constraints are difficult to enforce directly. We show that all three tasks can be solved efficiently and optimally by applying the Gradient-MUSIC algorithm for spectral estimation. To provide an example, for a rank-$r$ Toeplitz matrix $T\in {\mathbb C}^{n\times n}$ that satisfies a regularity assumption and is corrupted by an arbitrary $E\in {\mathbb C}^{n\times n}$ such that $\|E\|_2\leq αn$, our algorithm outputs a Toeplitz matrix $T_\sharp$ of rank exactly $r$ such that $\|T-T_\sharp\|_2 \leq C \|E\|_2$, where $C,α>0$ are absolute constants. This performance guarantee is minimax optimal in $n$, $r$, and $\|E\|_2$. For the other two structured approximation problems, we also provide algorithms that are minimax optimal in the number of samples, rank/sparsity, and noise level. At the heart of this paper is a quantitative transference principle which shows how to convert computational methods and theory for spectral estimation into corresponding methods and theory for the other three problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。