Power spectrum optimization for interference mitigation via iterative function evaluation
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
Abstract Power spectrum optimization is a well-known difficult nonconvex optimization problem for which only local optimality can typically be assured. This paper unifies several classes of local optimization methods and proposes efficient and new methods for power spectrum optimization by observing that methods for reaching the local optimal points can often be expressed in the form of an iterative function evaluation. This proposed new approach is based on the fact that the gradient of the objective function is zero at a local optimum, and that different manipulations of the optimality condition can then lead to different power update equations. As a practical application, this paper examines the benefit of dynamic power spectrum optimization for interference mitigation in a wireless backhaul network in which remote radio units are deployed to serve mobile users in areas with high data traffic demand. The remote radio units, called remote terminals (RT), are connected to access nodes (AN) via orthogonal frequency division multiple access (OFDMA) over a fixed bandwidth with one RT active in each frequency tone. The system performance is thus limited by internode interference solely, and no intranode interference. This paper shows that iterative function evaluation based methods provide a significant improvement in the overall network throughput in this setting as compared to a conventional network with fixed transmit power spectrum. The proposed methods have computationally fast convergence and can be implemented in a distributed fashion assuming reasonable amount of internode information exchange. Further, some of the proposed methods can be implemented asynchronously at each AN, which makes them amenable to practical utilization.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it