正交多项式变换的稀疏恢复
Sparse Recovery for Orthogonal Polynomial Transforms
摘要:
在本文中,我们考虑以下稀疏恢复问题。我们可以查询访问向量$\vx \in \R^N$,使得对于某个正交变换$\vF$,$\vhx = \vF \vx$是$k$ -稀疏的(或接近$k$ -稀疏的)。目标是在次线性时间内输出对$\vhx$的近似(在$\ell_2$意义上)。在$\vF$是离散傅立叶变换(DFT)的特殊情况下,这个问题已经得到了很好的研究,并且长时间的工作已经产生了在时间上运行的稀疏快速傅立叶变换$O(k \cdot \mathrm{polylog} N)$。然而,对于DFT以外的变换$\vF$(或类似离散余弦变换的密切相关的变换),这个问题就不那么确定了。在本文中,我们给出了次线性时间算法-运行在时间$\poly(k \log(N))$ -用于解决由正交多项式引起的正交变换$\vF$的稀疏恢复问题。更准确地说,我们的算法适用于任何$\vF$,这是一个正交多项式变换从雅可比多项式。雅可比多项式是经典正交多项式的一大类(包括Chebyshev多项式和Legendre多项式作为特例),广泛应用于数值分析和信号处理等领域。我们的工作的一个警告是,我们需要一个假设的稀疏向量的稀疏结构,虽然我们注意到,随机支持向量有这个属性的概率很高。我们的方法是给一个非常普遍的减少从$k$稀疏稀疏恢复问题的$1$稀疏恢复问题,适用于任何平坦的正交多项式变换,然后我们解决这个一个稀疏恢复问题的变换来自雅可比多项式。
英文摘要:
In this paper we consider the following sparse recovery problem. We have query access to a vector $\vx \in \R^N$ such that $\vhx = \vF \vx$ is $k$-sparse (or nearly $k$-sparse) for some orthogonal transform $\vF$. The goal is to output an approximation (in an $\ell_2$ sense) to $\vhx$ in sublinear time. This problem has been well-studied in the special case that $\vF$ is the Discrete Fourier Transform (DFT), and a long line of work has resulted in sparse Fast Fourier Transforms that run in time $O(k \cdot \mathrm{polylog} N)$. However, for transforms $\vF$ other than the DFT (or closely related transforms like the Discrete Cosine Transform), the question is much less settled. In this paper we give sublinear-time algorithms---running in time $\poly(k \log(N))$---for solving the sparse recovery problem for orthogonal transforms $\vF$ that arise from orthogonal polynomials. More precisely, our algorithm works for any $\vF$ that is an orthogonal polynomial transform derived from Jacobi polynomials. The Jacobi polynomials are a large class of classical orthogonal polynomials (and include Chebyshev and Legendre polynomials as special cases), and show up extensively in applications like numerical analysis and signal processing. One caveat of our work is that we require an assumption on the sparsity structure of the sparse vector, although we note that vectors with random support have this property with high probability. Our approach is to give a very general reduction from the $k$-sparse sparse recovery problem to the $1$-sparse sparse recovery problem that holds for any flat orthogonal polynomial transform; then we solve this one-sparse recovery problem for transforms derived from Jacobi polynomials.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。