arXiv (All)
open access
Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing
We study the sample complexity of noisy one-bit compressed sensing for signals drawn from a prior distribution. By characterizing the effective distributional complexity of the prior via its approximate covering number, we prove that posterior sampling achieves accurate recovery with high probabilit
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Full-Model Optimality for Tunable Linear Generative Priors in Compressed Sensing#924919
- Full-Model Optimality for Tunable Linear Generative Priors in Compressed Sensing#920685
- On Unbiased Parameter Estimation and Signal Reconstruction#1035484
- Sampling bias corrections for discrete and Gaussian partial information decompositions.#975473
- Instance Optimal Sparse Recovery from Nonlinear Observations: A Unified Framework#822520
Record · ID 1249114
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive