Dynamic Conjugate Gradient Unfolding for Symbol Detection in Time-Varying Massive MIMO
Bibliographic record
Abstract
This work addresses symbol detection in timevarying Massive Multiple-Input Multiple-Output (M-MIMO) systems. While conventional symbol detection techniques often exhibit subpar performance or impose significant computational burdens in such systems, learning-based methods have shown potential in stationary scenarios but often struggle to adapt to nonstationary conditions. To address these challenges, we introduce a hierarchy of extensions to the Learned Conjugate Gradient Network (LcgNet) M-MIMO detector. Firstly, we present Preconditioned LcgNet (PrLcgNet), which incorporates a preconditioner during training to enhance the uplink M-MIMO detectorâ\euro™s filter matrix. This enhancement enables the detector to achieve faster convergence with fewer layers compared to the original, nonpreconditioned approach. Secondly, we introduce an extension of PrLcgNet, known as the Dynamic Conjugate Gradient Network (DyCoGNet), specifically designed for time-varying environments. DyCoGNet leverages self-supervised learning with forward error correction, enabling autonomous adaptation without the need for explicit labeled data during training. It also employs metalearning, facilitating rapid adaptation to unforeseen channel conditions. Our simulation results demonstrate that PrLcgNet achieves faster convergence, lower residual error, and comparable symbol error rate (SER) performance to LcgNet in stationary scenarios. Furthermore, in the time-varying context, DyCoGNet exhibits swift and efficient adaptation, achieving significant SER performance gains compared to baseline cases without metalearning and online self-supervised learning.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".