Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors (Q6334166)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors |
preprint article from arXiv |
Statements
5 February 2020
0 references
stat.ML
0 references
cs.IT
0 references
cs.LG
0 references
math.IT
0 references
Zhaoqiang Liu
0 references
Selwyn Gomes
0 references
Avtansh Tiwari
0 references
Jonathan Scarlett
0 references
