# Deep Unfolding: Recent Developments, Theory, and Design Guidelines

arXiv: https://arxiv.org/abs/2512.03768 · HTML: https://mlsanity.com/paper/2512.03768/

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- Builds on 38 of its 68 references that are in the map.
- First posted on arXiv 3 Dec 2025.

## Builds on (most cited first, 30 of 38)

- [Convex optimization](https://mlsanity.com/paper/2106.01946/) (2021)
- [Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processing](https://mlsanity.com/paper/1912.10557/) (2019)
- [Learning to Optimize: A Primer and A Benchmark](https://mlsanity.com/paper/2103.12828/) (2021)
- [Handbook of Convergence Theorems for (Stochastic) Gradient Methods](https://mlsanity.com/paper/2301.11235/) (2023)
- [Model-Based Deep Learning](https://mlsanity.com/paper/2012.08405/) (2020)
- [On the Implicit Bias in Deep-Learning Algorithms](https://mlsanity.com/paper/2208.12591/) (2022)
- [Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds](https://mlsanity.com/paper/1808.10038/) (2018)
- [Deep Unfolding: Model-Based Inspiration of Novel Deep Architectures](https://mlsanity.com/paper/1409.2574/) (2014)
- [Learning to Detect](https://mlsanity.com/paper/1805.07631/) (2018)
- [Unfolding WMMSE using Graph Neural Networks for Efficient Power Allocation](https://mlsanity.com/paper/2009.10812/) (2020)
- [Model-Based Deep Learning: On the Intersection of Deep Learning and Optimization](https://mlsanity.com/paper/2205.02640/) (2022)
- [Fast Algorithms for Robust PCA via Gradient Descent](https://mlsanity.com/paper/1605.07784/) (2016)
- [Wireless Networks Design in the Era of Deep Learning: Model-Based, AI-Based, or Both?](https://mlsanity.com/paper/1902.02647/) (2019)
- [Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection](https://mlsanity.com/paper/2110.05649/) (2021)
- [Learning Convex Optimization Control Policies](https://mlsanity.com/paper/1912.09529/) (2019)
- [Adaptive Neural Signal Detection for Massive MIMO](https://mlsanity.com/paper/1906.04610/) (2019)
- [DeepSIC: Deep Soft Interference Cancellation for Multiuser MIMO Detection](https://mlsanity.com/paper/2002.03214/) (2020)
- [Safeguarded Learned Convex Optimization](https://mlsanity.com/paper/2003.01880/) (2020)
- [Hyperparameter Tuning is All You Need for LISTA](https://mlsanity.com/paper/2110.15900/) (2021)
- [Theoretical Perspectives on Deep Learning Methods in Inverse Problems](https://mlsanity.com/paper/2206.14373/) (2022)
- [Learning Convex Optimization Models](https://mlsanity.com/paper/2006.04248/) (2020)
- [Compressive Sensing and Neural Networks from a Statistical Learning Perspective](https://mlsanity.com/paper/2010.15658/) (2020)
- [LoRD-Net: Unfolded Deep Detection Network with Low-Resolution Receivers](https://mlsanity.com/paper/2102.02993/) (2021)
- [RTSNet: Learning to Smooth in Partially Known State-Space Models (Preprint)](https://mlsanity.com/paper/2110.04717/) (2021)
- [Generalization Error Bounds for Iterative Recovery Algorithms Unfolded as Neural Networks](https://mlsanity.com/paper/2112.04364/) (2021)
- [Learn to Rapidly and Robustly Optimize Hybrid Precoding](https://mlsanity.com/paper/2301.00369/) (2023)
- [Deep Distributed Optimization for Large-Scale Quadratic Programming](https://mlsanity.com/paper/2412.12156/) (2024)
- [Online Meta-Learning For Hybrid Model-Based Deep Receivers](https://mlsanity.com/paper/2203.14359/) (2022)
- [Robust Stochastically-Descending Unrolled Networks](https://mlsanity.com/paper/2312.15788/) (2023)
- [Deep Graph Unfolding for Beamforming in MU-MIMO Interference Networks](https://mlsanity.com/paper/2304.00446/) (2023)

## Built on by (most cited first, 7 of 7)

- [Auto-Unrolled Proximal Gradient Descent: An AutoML Approach to Interpretable Waveform Optimization](https://mlsanity.com/paper/2603.17478/) (2026)
- [Physics-Aware Linearized ADMM and Its Unrolling](https://mlsanity.com/paper/2606.01652/) (2026)
- [Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery](https://mlsanity.com/paper/2606.12740/) (2026)
- [A Drift Stable Quantum Federated Learning for Intelligent Services](https://mlsanity.com/paper/2607.21647/) (2026)
- [Generative Learning for Ambisonic Upscaling](https://mlsanity.com/paper/2609.23479/) (2026)
- [Learning to Replace MCMC in Split-Gibbs Diffusion Posterior Sampling via Deep Unfolding](https://mlsanity.com/paper/2609.30539/) (2026)
- [MANET-GNN: Learned Decentralized Optimization of Power Allocation in Multi-Channel MANETs](https://mlsanity.com/paper/2609.40170/) (2026)

## Abstract (arXiv)

Optimization methods play a central role in signal processing, serving as the mathematical foundation for inference, estimation, and control. While classical iterative optimization algorithms provide interpretability and theoretical guarantees, they often rely on surrogate objectives, require careful hyperparameter tuning, and exhibit substantial computational latency. Conversely, machine learning (ML ) offers powerful data-driven modeling capabilities but lacks the structure, transparency, and efficiency needed for optimization-driven inference. Deep unfolding has recently emerged as a compelling framework that bridges these two paradigms by systematically transforming iterative optimization algorithms into structured, trainable ML architectures. This article provides a tutorial-style overview of deep unfolding, presenting a unified perspective of methodologies for converting optimization solvers into ML models and highlighting their conceptual, theoretical, and practical implications. We review the foundations of optimization for inference and for learning, introduce four representative design paradigms for deep unfolding, and discuss the distinctive training schemes that arise from their iterative nature. Furthermore, we survey recent theoretical advances that establish convergence and generalization guarantees for unfolded optimizers, and provide comparative qualitative and empirical studies illustrating their relative trade-offs in complexity, interpretability, and robustness.