Hint: a Clue as to Where to Start an Iterative Massive MIMO Detection Process
Bibliographic record
Abstract
Massive multiple-input multiple-output (MIMO) systems, wherein a massive number of antennas are deployed at the base stations, are expected to play a significant role in 5G networks. The drawback of using the massive MIMO technique is the need for advanced and complex signal processing schemes. In recent years, several iterative and learning-based techniques have been introduced to address the need for low-complexity signal detection in the uplink of a massive MIMO system. The complexity of the iterative methods is highly affected by the number of needed iterations. On the other hand, although the performance of low-complexity learning-based techniques is close to optimal, they need retraining after major changes in the wireless communication channel. In this paper, we introduce Hint, a robust learning-based technique that finds an initial vector tailored for the current realization of the wireless channel; this vector initializes the iterative detector to complete the task of massive MIMO detection.
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.003 | 0.020 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.004 | 0.008 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.004 | 0.007 |
| Insufficient payload (model declined to judge) | 0.009 | 0.008 |
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".