Zhaoqiang Liu, Selwyn Gomes, Avtansh Tiwari, Jonathan Scarlett
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binaryvalued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances in compressive sensing with generative models, where a generative modeling assumption replaces the usual sparsity assumption, we study the problem of 1-bit compressive sensing with generative models. We first consider noiseless 1-bit measurements, and provide sample complexity bounds for approximate recovery under i.i.d. Gaussian measurements and a Lipschitz continuous generative prior, as well as a near-matching algorithm-independent lower bound. Moreover, we demonstrate that the Binary -Stable Embedding property, which characterizes the robustness of the reconstruction to measurement errors and noise, also holds for 1-bit compressive sensing with Lipschitz continuous generative models with sufficiently many Gaussian measurements. In addition, we apply our results to neural network generative models, and provide a proof-of-concept numerical experiment demonstrating significant improvements over sparsity-based approaches.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.01697")
get_code_for_paper("2002.01697")
have("2002.01697")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.01697.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.01697)
Connect an agent — have() is free.