Fourier-Sparse Interpolation without a Frequency Gap

  title={Fourier-Sparse Interpolation without a Frequency Gap},
  author={Xue Chen and Daniel M. Kane and Eric Price and Zhao Song},
  journal={2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)},
  • Xue ChenD. Kane Zhao Song
  • Published 6 September 2016
  • Computer Science
  • 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
We consider the problem of estimating a Fourier-sparse signal from noisy samples, where the sampling is done over some interval [0, T] and the frequencies can be "off-grid". Previous methods for this problem required the gap between frequencies to be above 1/T, the threshold required to robustly identify individual frequencies. We show the frequency gap is not necessary to estimate the signal as a whole: for arbitrary k-Fourier-sparse signals under l2 bounded noise, we show how to estimate the… 

Figures from this paper

Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average

  • M. Kapralov
  • Computer Science
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
This paper proposes a new technique for analysing noisy hashing schemes that arise in Sparse FFT, which it refers to as isolation on average, and applies this technique to two problems in Sparser FFT: estimating the values of a list of frequencies using few samples and computing SparseFFT itself, achieving sample-optimal results in k\log^{O(1)} n time for both.

A universal sampling method for reconstructing signals with simple Fourier transforms

This work extends tools based on statistical leverage score sampling and column-based matrix reconstruction to the approximation of continuous linear operators that arise in the signal reconstruction problem, based on a novel connection between randomized linear algebra and the problem of reconstructing signals with constrained Fourier structure.

Sparsification for Sums of Exponentials and its Algorithmic Applications

The first algorithms for approximately (and robustly) determining the number of components in a Gaussian mixture model that work without a separation condition are given.

A robust multi-dimensional sparse Fourier transform in the continuous setting

A number of new techniques for constructing the filter functions, designing the permutation-then-hashing schemes, sampling the Fourier measurements, and locating the frequencies are developed and can find their applications in the future studies on the Sparse FT problem.

J ul 2 01 9 Reconstruction under outliers for Fourier-sparse functions

It is shown that over the torus, assuming that the Fourier transform satisfies a certain granularity condition, there is a sample efficient algorithm to tolerate ρ = Ω(1) fraction of outliers and further, that this is not possible without such a granular condition.

(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless

This algorithm uses O(k log k log n) samples, is dimension-free, operates for any universe size, and achieves the strongest ℓ_∞/ℓ-2 guarantee, while running in a time comparable to the Fast Fourier Transform.

Sublinear-Time Sparse Recovery, and Its Power in the Design of Exact Algorithms

Several new contributions to the field of sparse recovery are described, as well as how sparse recovery techniques can be of great significance in the design of exact algorithms, outside of the scope of the problems they first were created for.

Estimating the Frequency of a Clustered Signal

A new $\tilde{O}(k^3)$ bound on the ratio between the maximum and average value of continuous $k$-Fourier-sparse signals, which has independent application is provided.

Deterministic Sparse Fourier Transform with an l_{infinity} Guarantee

  • Yi Li
  • Computer Science, Mathematics
  • 2020
This paper revisits the deterministic version of the Sparse Fourier Transform problem, and gives new deterministic constructions of incoherent matrices that are row-sampled submatrices of the DFT matrix, via a derandomization of Bernstein's inequality and bounds on exponential sums considered in analytic number theory.

Reconstruction under outliers for Fourier-sparse functions

Over the torus, assuming that the Fourier transform satisfies a certain \emph{granularity} condition, there is a sample efficient algorithm to tolerate $\rho =\Omega(1)$ fraction of outliers and further, that this is not possible without such a granularity condition.



A Robust Sparse Fourier Transform in the Continuous Setting

  • Eric PriceZhao Song
  • Computer Science
    2015 IEEE 56th Annual Symposium on Foundations of Computer Science
  • 2015
An algorithm for robustly computing sparse Fourier transforms in the continuous setting and new results for how precisely the individual frequencies of x* can be recovered are given.

Simple and practical algorithm for sparse Fourier transform

This work considers the sparse Fourier transform problem, and proposes a new algorithm, which leverages techniques from digital signal processing, notably Gaussian and Dolph-Chebyshev filters, and is faster than FFT, both in theory and practice.

Super-Resolution Off the Grid

The number of measurements taken by and the computational complexity of the algorithm are bounded by a polynomial in both the number of points k and the dimension d, with no dependence on the separation Δ.

Nearly optimal sparse fourier transform

If one assumes that the Fast Fourier Transform is optimal, the algorithm for the exactly k-sparse case is optimal for any k = nΩ(1), and the first known algorithms that satisfy this property are shown.

On sparse reconstruction from Fourier and Gaussian measurements

This paper improves upon best‐known guarantees for exact reconstruction of a sparse signal f from a small universal sample of Fourier measurements by showing that there exists a set of frequencies Ω such that one can exactly reconstruct every r‐sparse signal f of length n from its frequencies in Ω, using the convex relaxation.

Compressed Sensing Off the Grid

This paper investigates the problem of estimating the frequency components of a mixture of s complex sinusoids from a random subset of n regularly spaced samples and proposes an atomic norm minimization approach to exactly recover the unobserved samples and identify the unknown frequencies.

Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time

This work considers the problem of computing a k-sparse approximation to the Fourier transform of a length N signal and proposes a randomized algorithm for computing such an approximation using Od(klogNloglogN) samples of the signal in time domain and Od( klogd+3 N) runtime.

(Nearly) Sample-Optimal Sparse Fourier Transform

A randomized algorithm that computes a k-sparse approximation to the discrete Fourier transform of an n-dimensional signal in time O(k log2 n(log log n)O(1)), assuming that the entries of the signal are polynomially bounded.

Improved time bounds for near-optimal sparse Fourier representations

A significantly improved algorithm for the problem of finding a Fourier representation R of m terms for a given discrete signal A of length N and a quadratic-in-m algorithm that works for any values of Ni's is given.

Near minimax line spectral estimation

This paper establishes that using atomic norm soft thresholding (AST), it can achieve near minimax optimal prediction error rate for line spectral estimation, in spite of having a highly coherent dictionary corresponding to arbitrarily close frequencies.