Research map / Optimization / Nonconvex and smooth optimization
A statistical perspective on algorithm unrolling models for inverse problems
Yves Atchade, Xinru Liu, Qiuyun Zhu
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Unrolled denoising networks provably learn to perform optimal Bayesian inference (NeurIPS 2024 · similarity 0.88)
- Proximal Algorithm Unrolling: Flexible and Efficient Reconstruction Networks for Single-Pixel Imaging (CVPR 2025 · similarity 0.87)
- What's in a Prior? Learned Proximal Networks for Inverse Problems (ICLR 2024 · similarity 0.85)
- Understanding the Curse of Unrolling (NeurIPS 2026 · similarity 0.84)
- Time-Embedded Algorithm Unrolling for Computational MRI (NeurIPS 2025 · similarity 0.84)
- Untrained Neural Nets for Snapshot Compressive Imaging: Theory and Algorithms (NeurIPS 2024 · similarity 0.84)
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.
