Decentralized spectrum learning and access adaptive to channel availability distribution in primary network
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We consider the effect of the mean availability distribution of primary channels on the performance of distributed learning and access policies, and develop a distributed learning and access policy that is effective in a wide range of primary channel conditions. We first extend the recently proposed BLA algorithm to distributed online learning of underlying primary channel availabilities, and modify the existing access policies to form BLA-ρ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RAND</sup> and BLA-DLF policies. By analyzing the distributed access collision mechanism offered by the ρ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RAND</sup> and DLF policies [1], [2], we identify how different mean channel availability distributions can impact the effectiveness of each policy. In light of this, we propose DSLA policy that adapts to different channel availability distribution conditions. Based on a closeness factor we propose, the DSLA policy automatically switches between the underlying learning policies, as well as the access policies, to determine which policy is most effective for a given primary channel condition. Simulation studies show that our proposed DSLA policy is effective in providing a good performance for a wide range of primary channel availability distributions.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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 it