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, Albert Gu, +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.

    References

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

    Nearly optimal sparse fourier transform

    VIEW 2 EXCERPTS

    Sparse Legendre expansions via l1-minimization

    VIEW 1 EXCERPT

    Rapidly computing sparse Legendre expansions via sparse Fourier transforms

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL