Joint Design for RIS-Aided ISAC via Deep Unfolding Learning
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
Integrated sensing and communication (ISAC) has become a promising technique to alleviate the spectrum congestion via sharing the same spectrum for communication and sensing. Nevertheless, many ISAC schemes encounter the challenges of high computational complexity. Thanks to the powerful non-linear fitting capabilities and fast inference speed, deep learning is expected to facilitate the online deployment of ISAC. In this paper, we propose a dual-functional waveform design scheme for reconfigurable intelligent surface (RIS) aided ISAC based on deep unfolding learning. Specifically, the weighted sum of multi-user interference energy and waveform discrepancy is minimized via the joint waveform and phase-shift design. We first develop an alternating direction method of multipliers (ADMM) based iterative algorithm to handle the non-convex optimization problem. Then, we develop a deep unfolding neural network (NN), named ADMM-NET, which unfolds the proposed ADMM-based iterative algorithm to a layer-wise architecture and replaces the matrix inversions with low-complexity approximations. In addition, we present a black-box NN for performance comparison. Simulation results verify that the ADMM-NET outperforms the black-box NN in performance, interpretability and training samples. Moreover, the ADMM-NET is superior to the ADMM-based iterative algorithm in both computational complexity and performance, facilitating the online deployment.
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.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.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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