Source enumeration in large arrays using moments of eigenvalues and relatively few samples
Bibliographic record
Abstract
This study presents a method based on minimum description length criterion to enumerate the incident waves impinging on a large array using a relatively small number of samples. The proposed scheme exploits the statistical properties of eigenvalues of the sample covariance matrix (SCM) of Gaussian processes. The authors use a number of moments of noise eigenvalues of the SCM in order to separate noise and signal subspaces more accurately. In particular, the authors assume a Marcenko–Pastur probability density function (pdf) for the eigenvalues of SCM associated with the noise subspace. We also use an enhanced noise variance estimator to reduce the bias leakage between the subspaces. Numerical simulations demonstrate that the proposed method estimates the true number of signals for large arrays and a relatively small number of snapshots. In particular, the proposed method requires less number of samples to achieve the same correct enumeration probability compared to the state-of-the-art methods. The authors evaluated the assumed pdf in order to justify the limitation and the behaviour of the proposed method for small number of snapshots and array sizes.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".