Reproduce “A Nonadaptive Sparse Fourier Transform in Every Dimension” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Mahdi Cheraghchi, Jingyi Lyu
The authors present a nonadaptive sparse Fourier recovery algorithm for complex signals on products of power-of-two cyclic groups. It searches frequency buckets using signal point queries fixed in advance, then fits and thresholds coefficients. Given a constant-factor estimate of the k-sparse tail, it achieves squared error at most (1+ε)σₖ² with probability 9/10; its operation bounds assume exact arithmetic, not measured runtime.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.