A High-dimensional Sparse Fourier Transform in the Continuous Setting

02/22/2021
by   Liang Chen, et al.
0

In this paper, we theoretically propose a new hashing scheme to establish the sparse Fourier transform in high-dimension space. The estimation of the algorithm complexity shows that this sparse Fourier transform can overcome the curse of dimensionality. To the best of our knowledge, this is the first polynomial-time algorithm to recover the high-dimensional continuous frequencies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2019

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

In this paper, we consider the extensively studied problem of computing ...
research
05/13/2020

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

Sparse Fourier transform (Sparse FT) is the problem of learning an unkno...
research
06/23/2020

A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

In this paper a sublinear time algorithm is presented for the reconstruc...
research
10/20/2020

Grouped Transformations in High-Dimensional Explainable ANOVA Approximation

Many applications are based on the use of efficient Fourier algorithms s...
research
02/01/2023

Sparse Spectral Methods for Solving High-Dimensional and Multiscale Elliptic PDEs

In his monograph Chebyshev and Fourier Spectral Methods, John Boyd claim...
research
11/19/2019

Low-Rank Toeplitz Matrix Estimation via Random Ultra-Sparse Rulers

We study how to estimate a nearly low-rank Toeplitz covariance matrix T ...
research
03/30/2018

An efficient high dimensional quantum Schur transform

The Schur transform is a unitary operator that block diagonalizes the ac...

Please sign up or login with your details

Forgot password? Click here to reset