Deep Active Learning Approach to Adaptive Beamforming for mmWave Initial Alignment
Bibliographic record
Abstract
This paper proposes a deep learning approach to the adaptive and sequential beamforming design problem for the initial access phase in a mmWave environment with a single-path channel model. In particular, for a single-user scenario where the problem is equivalent to designing the sequence of sensing beamformers to learn the angle of arrival (AoA) of the dominant path, we propose a novel deep neural network (DNN) that designs a sequence of adaptive sensing vectors based on the available information so far at the base station (BS). By recognizing that the posterior distribution of the AoA provides sufficient statistic for solving the initial access problem, we consider the AoA posterior distribution as the main component of the input to the proposed DNN for designing the adaptive beamforming strategy. However, computing the AoA posterior distribution can be computationally challenging when the fading coefficient is unknown. To address this issue, this paper proposes to use the minimum mean squared error (MMSE) estimate of the fading coefficient to compute an approximation of the posterior distribution. Numerical results demonstrate that as compared to the existing adaptive beamforming schemes utilizing predesigned hierarchical codebooks, the proposed deep learning-based adaptive beamforming achieves a higher AoA detection performance.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".