Bibliographic record
Abstract
Consider a multi-user wireless information transfer system where a multiple-antenna access point (AP) aims to sell its downlink radio access to the end users in an auction premise so that the social welfare is maximized. To this end, the AP holds auctions in which each user bids for its desired minimum signal-to-interference-plus-noise power ratio. Based on the user's channel state information, bids, and service demands, the AP seeks the optimal set of users for which information streams are to be allocated through beamforming. We formulate the optimization problem of finding the optimal allocation rule, apply brute-force search approach to find all the feasible allocation sets using uplink-downlink duality-based algorithm (UDD), and obtain the optimal allocation rule. To circumvent the time-greediness of conventional optimization methods such as semi-definite relaxation or UDD, we propose a deep neural network architecture, and use it to solve the optimization problem with a good accuracy. The training data is collected by solving offline plenty of network realizations via the application of the UDD algorithm.
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 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.000 | 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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".