Auto-Unrolled Proximal Gradient Descent: An AutoML Approach to Interpretable Waveform Optimization
Ahmet Kaplan

TL;DR
This paper introduces Auto-Unrolled PGD, combining AutoML with deep unfolding to optimize wireless waveforms efficiently and interpretably, reducing training data and inference costs.
Contribution
It presents a novel AutoML approach to optimize deep unfolded PGD for waveform design, achieving high spectral efficiency with fewer layers and training samples.
Findings
Achieves 98.8% spectral efficiency with only five unrolled layers.
Requires only 100 training samples for effective optimization.
Addresses gradient normalization for consistent training and evaluation.
Abstract
This study explores the combination of automated machine learning (AutoML) with model-based deep unfolding (DU) for optimizing wireless beamforming and waveforms. We convert the iterative proximal gradient descent (PGD) algorithm into a deep neural network, wherein the parameters of each layer are learned instead of being predetermined. Additionally, we enhance the architecture by incorporating a hybrid layer that performs a learnable linear gradient transformation prior to the proximal projection. By utilizing AutoGluon with a tree-structured parzen estimator (TPE) for hyperparameter optimization (HPO) across an expanded search space, which includes network depth, step-size initialization, optimizer, learning rate scheduler, layer type, and post-gradient activation, the proposed auto-unrolled PGD (Auto-PGD) achieves 98.8% of the spectral efficiency of a traditional 200-iteration PGD…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
