ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2008.10579
  4. Cited By
Compressive Phase Retrieval: Optimal Sample Complexity with Deep
  Generative Priors

Compressive Phase Retrieval: Optimal Sample Complexity with Deep Generative Priors

24 August 2020
Paul Hand
Oscar Leong
V. Voroninski
ArXiv (abs)PDFHTML

Papers citing "Compressive Phase Retrieval: Optimal Sample Complexity with Deep Generative Priors"

4 / 4 papers shown
Title
A Recovery Theory for Diffusion Priors: Deterministic Analysis of the Implicit Prior Algorithm
A Recovery Theory for Diffusion Priors: Deterministic Analysis of the Implicit Prior Algorithm
Oscar Leong
Yann Traonmilin
72
0
0
24 Sep 2025
The Star Geometry of Critic-Based Regularizer Learning
The Star Geometry of Critic-Based Regularizer LearningNeural Information Processing Systems (NeurIPS), 2024
Oscar Leong
Eliza O'Reilly
Yong Sheng Soh
AAML
199
2
0
29 Aug 2024
Signal Recovery with Non-Expansive Generative Network Priors
Signal Recovery with Non-Expansive Generative Network PriorsNeural Information Processing Systems (NeurIPS), 2022
Jorio Cocola
112
1
0
24 Apr 2022
Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via
  Non-Lipschitz Matrix Concentration
Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via Non-Lipschitz Matrix ConcentrationCommunications in Mathematical Sciences (CMS), 2020
Paul Hand
Oscar Leong
V. Voroninski
107
1
0
31 Oct 2020
1