An $O(k\log n)$ Time Fourier Set Query Algorithm

Abstract

Fourier transformation is an extensively studied problem in many research fields. It has many applications in machine learning, signal processing, compressed sensing, and so on. In many real-world applications, approximated Fourier transformation is sufficient and we only need to do the Fourier transform on a subset of coordinates. Given a vector $x\in {\mathbb{C}}^n$, an approximation parameter $\epsilon$ and a query set $S\subset [n]$ of size $k$, we propose an algorithm to compute an approximate Fourier transform result $x^{\prime }$ which uses $O({\epsilon }^{-1}k\log (n/\delta ))$ Fourier measurements, runs in $O({\epsilon }^{-1}k\log (n/\delta ))$ time and outputs a vector $x^{\prime }$ such that $\Vert (x^{\prime }-\hat{x}{)}_S{\Vert }_2^2\le \epsilon \Vert {\hat{x}}_{\bar{S}}{\Vert }_2^2+\delta \Vert \hat{x}{\Vert }_1^2$ holds with probability of at least $9/10$.