ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.01697
  4. Cited By
Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable
  Embeddings with Generative Priors

Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors

5 February 2020
Zhaoqiang Liu
S. Gomes
Avtansh Tiwari
Jonathan Scarlett
ArXivPDFHTML

Papers citing "Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors"

4 / 4 papers shown
Title
One-bit Compressed Sensing using Generative Models
One-bit Compressed Sensing using Generative Models
Swatantra Kafle
Geethu Joseph
P. Varshney
DiffM
GAN
73
6
0
18 Feb 2025
QCM-SGM+: Improved Quantized Compressed Sensing With Score-Based
  Generative Models
QCM-SGM+: Improved Quantized Compressed Sensing With Score-Based Generative Models
Xiangming Meng
Y. Kabashima
30
1
0
02 Feb 2023
Misspecified Phase Retrieval with Generative Priors
Misspecified Phase Retrieval with Generative Priors
Zhaoqiang Liu
Xinshao Wang
Jiulong Liu
32
4
0
11 Oct 2022
Instance-Optimal Compressed Sensing via Posterior Sampling
Instance-Optimal Compressed Sensing via Posterior Sampling
A. Jalal
Sushrut Karmalkar
A. Dimakis
Eric Price
26
51
0
21 Jun 2021
1