稀疏多参考比对:样本复杂度和计算难度
Sparse multi-reference alignment: sample complexity and computational hardness
摘要:
受使用单粒子冷冻电子显微镜(cryo-EM)确定大分子原子结构问题的启发,我们研究了稀疏多参考对齐(MRA)模型的样本和计算复杂性:从噪声中估计稀疏信号的问题,循环移位副本。基于其紧密连接的晶体学相位恢复问题,我们建立,如果观察的数量是成正比的噪声的方差的平方,那么稀疏MRA问题是统计上可行的足够稀疏的信号。为了研究其计算难度,我们考虑三种类型的计算框架:基于投影的算法,双谱反演,凸松弛。我们表明,一个国家的最先进的基于投影的算法实现了最佳的估计率,但其计算复杂性是指数的稀疏水平。双谱框架提供了一个计算-计算的折衷:它需要更多的观测(因此其估计率是次优的),但其计算负载在信号长度上是可证明的多项式。凸松弛方法提供了多项式时间算法(具有大指数),其以最佳估计速率恢复足够稀疏的信号。最后,我们讨论了潜在的统计和算法的影响,冷冻EM的文件。
英文摘要:
Motivated by the problem of determining the atomic structure of macromolecules using single-particle cryo-electron microscopy (cryo-EM), we study the sample and computational complexities of the sparse multi-reference alignment (MRA) model: the problem of estimating a sparse signal from its noisy, circularly shifted copies. Based on its tight connection to the crystallographic phase retrieval problem, we establish that if the number of observations is proportional to the square of the variance of the noise, then the sparse MRA problem is statistically feasible for sufficiently sparse signals. To investigate its computational hardness, we consider three types of computational frameworks: projection-based algorithms, bispectrum inversion, and convex relaxations. We show that a state-of-the-art projection-based algorithm achieves the optimal estimation rate, but its computational complexity is exponential in the sparsity level. The bispectrum framework provides a statistical-computational trade-off: it requires more observations (so its estimation rate is suboptimal), but its computational load is provably polynomial in the signal's length. The convex relaxation approach provides polynomial time algorithms (with a large exponent) that recover sufficiently sparse signals at the optimal estimation rate. We conclude the paper by discussing potential statistical and algorithmic implications for cryo-EM.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。