Fetching the paper…
Reading the bibliography…
The goal of compressed sensing is to learn a structured signal $x$ from a limited number of noisy linear measurements $y \approx Ax$.
On data structures and asymmetric communication complexity
Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson · 1998
Earlier work this paper cites.
Stable signal recovery from incomplete and inaccurate measurements
E. J. Candès, J. Romberg, and T. Tao · 2006
Earlier work this paper cites.
Constructing small-bias sets from algebraic-geometric codes
Avraham Ben-Aroya and Amnon Ta-Shma · 2009
Earlier work this paper cites.
Lower bounds for sparse recovery
K. Do Ba, P. Indyk, E. Price, and D. Woodruff · 2010
Cited alongside, same era.
Generative adversarial nets
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
Cited alongside, same era.
Auto-encoding variational bayes
Diederik P. Kingma and Max Welling · 2014
Cited alongside, same era.
Compressed sensing using generative models
Ashish Bora, Ajil Jalal, Eric Price, and Alexandros G. Dimakis · 2017
Later among the works it cites.
Information-theoretic lower bounds for compressive sensing with generative models, 2019
Zhaoqiang Liu and Jonathan Scarlett · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…