atlas

Research map / Optimization / Implicit bias and generalization

Convolutional Phase Retrieval

NeurIPS 2017 · Optimization › Implicit bias and generalization · approach: Low-rank and single-index recovery

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 changedWhereMeasuredEffect
Increase ||Cx|| (signal sparser/flatter in Fourier domain) for fixed n (ablation)Gradient descent with spectral initialization · Synthetic signals, n=1000sample complexity needed for exact recoveryHurt
Use smoothing weight b = zeta_sigma2(y) (Gaussian smoothing) in the objectiveAnalysis of convolutional phase retrieval objective · Theoretical analysisapproximation error ||h - zeta*psi||_inf in decoupling boundHelped
Replace generic i.i.d. Gaussian measurements with random circulant convolution measurementsPhase retrieval sample complexity · Theorysample complexity scalingMixed
Use fast FFT-based matrix-vector products instead of dense Gaussian matricesGradient descent for convolutional phase retrieval · Real image experiment, 200x300, m=5n log nmemory and per-iteration computationHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy