Neural Combinatorial Optimization for Throughput Maximization in IRS-Aided Systems
Bibliographic record
Abstract
Intelligent reflecting surface (IRS) is a promising paradigm for enhancing the spectrum efficiency of wireless communication systems. In this paper, we study the joint uplink scheduling and phase shift control in IRS-aided systems. We formulate the throughput maximization problem as a combinatorial optimization problem. We decompose the problem into two subproblems for user scheduling and phase shift control, respectively. We propose a neural combinatorial optimization (NCO)-based algorithm, in which a near-optimal stochastic policy for user scheduling is learned by deep neural networks (DNNs) with attention mechanism, while the phase shifts of the IRS are optimized using fractional programming. Unlike alternating optimization-based approaches which obtain a suboptimal solution by iteratively solving two subproblems, the proposed NCO-based algorithm is capable of obtaining a near-optimal solution while each subproblem is required to be solved only once. Simulation results show that the proposed NCO-based algorithm achieves an aggregate throughput which is within 98% of the exhaustive search algorithm, and outperforms both greedy scheduling and random scheduling algorithms.
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".