Sample Complexity Lower Bounds for Compressive Sensing with Generative Models

SPCOM, pp. 1-5, 2020.

Cited by: 0|Views0


Recently, it has been shown that for compressive sensing, significantly fewer measurements may be required if the sparsity assumption is replaced by the assumption the unknown vector lies near the range of a suitably-chosen generative model. In particular, in (Bora et at., 2017) it was shown roughly O(k log L) random Gaussian measurements...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 250 coins

Wechat's Red Packet

Upload 200 articles

for 1000 coins

Wechat's Red Packet

Upload 500 articles

for 2500 coins

Wechat's Red Packet

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :