# Sparse Recovery for Orthogonal Polynomial Transforms

@inproceedings{Gilbert2020SparseRF,
title={Sparse Recovery for Orthogonal Polynomial Transforms},
author={Anna C. Gilbert and Albert Gu and Christopher R{\'e} and Atri Rudra and Mary Wootters},
booktitle={ICALP},
year={2020}
}
• Anna C. Gilbert, +2 authors Mary Wootters
• Published in ICALP 2020
• Computer Science, Mathematics
• In this paper we consider the following sparse recovery problem. We have query access to a vector $\vx \in \R^N$ such that $\vhx = \vF \vx$ is $k$-sparse (or nearly $k$-sparse) for some orthogonal transform $\vF$. The goal is to output an approximation (in an $\ell_2$ sense) to $\vhx$ in sublinear time. This problem has been well-studied in the special case that $\vF$ is the Discrete Fourier Transform (DFT), and a long line of work has resulted in sparse Fast Fourier Transforms that run in time… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

## Sparse Harmonic Transforms II: Best s-Term Approximation Guarantees for Bounded Orthonormal Product Bases in Sublinear-Time

• Computer Science, Mathematics
• ArXiv
• 2019
VIEW 1 EXCERPT
CITES BACKGROUND

## Survey on Automated Machine Learning

• Mathematics, Computer Science
• ArXiv
• 2019

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES

## Improved Lower Bounds for the Restricted Isometry Property of Subsampled Fourier Matrices

VIEW 1 EXCERPT

## Dimension-independent Sparse Fourier Transform

• Mathematics, Computer Science
• SODA
• 2019
VIEW 1 EXCERPT

## Sparse Harmonic Transforms: A New Class of Sublinear-time Algorithms for Learning Functions of Many Variables

• Mathematics, Computer Science
• 2018
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

## Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs

• Mathematics, Computer Science
• SIAM J. Comput.
• 1997
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

## Nearly optimal sparse fourier transform

• Mathematics, Computer Science
• STOC '12
• 2012
VIEW 2 EXCERPTS

## Near-optimal sparse fourier representations via sampling

• Mathematics, Computer Science
• STOC '02
• 2002
VIEW 1 EXCERPT

## On sparse reconstruction from Fourier and Gaussian measurements

• Mathematics
• 2008
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

## Sparse Legendre expansions via l1-minimization

• Computer Science, Mathematics
• J. Approx. Theory
• 2012
VIEW 1 EXCERPT

## Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data

• Computer Science
• IEEE Signal Processing Magazine
• 2014
VIEW 2 EXCERPTS

## Rapidly computing sparse Legendre expansions via sparse Fourier transforms

• Mathematics, Computer Science
• Numerical Algorithms
• 2016
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL