Research map / Learning theory and algorithms / Sample complexity
Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use a generative prior instead of sparsity-based reconstruction | MNIST 1-bit reconstruction · MNIST | reconstruction error | Helped |
| Use 1-bit measurements instead of linear measurements | Generative-prior reconstruction · MNIST | average per-pixel reconstruction error | Hurt |
Closest papers by meaning
- On the Power of Compressed Sensing with Generative Models (ICML 2020 · similarity 0.93)
- Compressed Sensing using Generative Models (ICML 2017 · similarity 0.93)
- Robust One-Bit Recovery via ReLU Generative Networks: Near-Optimal Statistical Rate and Global Landscape Analysis (ICML 2020 · similarity 0.92)
- Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing (NeurIPS 2026 · similarity 0.91)
- Sparse Bayesian Generative Modeling for Compressive Sensing (NeurIPS 2024 · similarity 0.89)
- How many measurements are enough? Bayesian recovery in inverse problems with general distributions (NeurIPS 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.