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"

6 / 6 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
93
6
0
18 Feb 2025
Information-Theoretic Lower Bounds for Compressive Sensing with
  Generative Models
Information-Theoretic Lower Bounds for Compressive Sensing with Generative Models
Zhaoqiang Liu
Jonathan Scarlett
61
40
0
28 Aug 2019
Fast and Provable ADMM for Learning with Generative Priors
Fast and Provable ADMM for Learning with Generative Priors
Fabian Latorre Gómez
Armin Eftekhari
Volkan Cevher
GAN
42
43
0
07 Jul 2019
Modeling Sparse Deviations for Compressed Sensing using Generative
  Models
Modeling Sparse Deviations for Compressed Sensing using Generative Models
Manik Dhar
Aditya Grover
Stefano Ermon
30
79
0
04 Jul 2018
Robust 1-bit compressed sensing and sparse logistic regression: A convex
  programming approach
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
Y. Plan
Roman Vershynin
143
457
0
06 Feb 2012
On the Fundamental Limits of Adaptive Sensing
On the Fundamental Limits of Adaptive Sensing
E. Arias-Castro
Emmanuel J. Candes
Mark A. Davenport
86
137
0
20 Nov 2011
1