9 research outputs found

    An Adaptive Sublinear-Time Block Sparse Fourier Transform

    Get PDF
    The problem of approximately computing the kk dominant Fourier coefficients of a vector XX quickly, and using few samples in time domain, is known as the Sparse Fourier Transform (sparse FFT) problem. A long line of work on the sparse FFT has resulted in algorithms with O(klognlog(n/k))O(k\log n\log (n/k)) runtime [Hassanieh \emph{et al.}, STOC'12] and O(klogn)O(k\log n) sample complexity [Indyk \emph{et al.}, FOCS'14]. These results are proved using non-adaptive algorithms, and the latter O(klogn)O(k\log n) sample complexity result is essentially the best possible under the sparsity assumption alone: It is known that even adaptive algorithms must use Ω((klog(n/k))/loglogn)\Omega((k\log(n/k))/\log\log n) samples [Hassanieh \emph{et al.}, STOC'12]. By {\em adaptive}, we mean being able to exploit previous samples in guiding the selection of further samples. This paper revisits the sparse FFT problem with the added twist that the sparse coefficients approximately obey a (k0,k1)(k_0,k_1)-block sparse model. In this model, signal frequencies are clustered in k0k_0 intervals with width k1k_1 in Fourier space, and k=k0k1k= k_0k_1 is the total sparsity. Signals arising in applications are often well approximated by this model with k0kk_0\ll k. Our main result is the first sparse FFT algorithm for (k0,k1)(k_0, k_1)-block sparse signals with a sample complexity of O(k0k1+k0log(1+k0)logn)O^*(k_0k_1 + k_0\log(1+ k_0)\log n) at constant signal-to-noise ratios, and sublinear runtime. A similar sample complexity was previously achieved in the works on {\em model-based compressive sensing} using random Gaussian measurements, but used Ω(n)\Omega(n) runtime. To the best of our knowledge, our result is the first sublinear-time algorithm for model based compressed sensing, and the first sparse FFT result that goes below the O(klogn)O(k\log n) sample complexity bound. Interestingly, the aforementioned model-based compressive sensing result that relies on Gaussian measurements is non-adaptive, whereas our algorithm crucially uses {\em adaptivity} to achieve the improved sample complexity bound. We prove that adaptivity is in fact necessary in the Fourier setting: Any {\em non-adaptive} algorithm must use Ω(k0k1lognk0k1)\Omega(k_0k_1\log \frac{n}{k_0k_1}) samples for the (k0,k1(k_0,k_1)-block sparse model, ruling out improvements over the vanilla sparsity assumption. Our main technical innovation for adaptivity is a new randomized energy-based importance sampling technique that may be of independent interest

    An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation

    Get PDF
    Information theory plays an indispensable role in the development of algorithm-independent impossibility results, both for communication problems and for seemingly distinct areas such as statistics and machine learning. While numerous information-theoretic tools have been proposed for this purpose, the oldest one remains arguably the most versatile and widespread: Fano's inequality. In this chapter, we provide a survey of Fano's inequality and its variants in the context of statistical estimation, adopting a versatile framework that covers a wide range of specific problems. We present a variety of key tools and techniques used for establishing impossibility results via this approach, and provide representative examples covering group testing, graphical model selection, sparse linear regression, density estimation, and convex optimization.Comment: Chapter in upcoming book "Information-Theoretic Methods in Data Science" (Cambridge University Press) edited by Yonina Eldar and Miguel Rodrigues. (v2 & v3) Minor corrections and edit

    An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation

    Get PDF
    Information theory plays an indispensable role in the development of algorithm-independent impossibility results, both for communication problems and for seemingly distinct areas such as statistics and machine learning. While numerous information-theoretic tools have been proposed for this purpose, the oldest one remains arguably the most versatile and widespread: Fano's inequality. In this chapter, we provide a survey of Fano's inequality and its variants in the context of statistical estimation, adopting a versatile framework that covers a wide range of specic problems. We present a variety of key tools and techniques used for establishing impossibility results via this approach, and provide representative examples covering group testing, graphical model selection, sparse linear regression, density estimation, and convex optimization
    corecore