A Comprehensive Survey of Knowledge-Driven Deep Learning for Intelligent Wireless Network Optimization in 6G
Bibliographic record
Abstract
The sixth generation (6G) wireless networks are envisioned to feature wide-area coverage, diversified full-scenario services, massive connections and dynamic heterogeneity, resulting in large-scale and complex network optimization problems. Traditional model-based methods, while effective in simple scenarios with precise mathematical models, struggle with high computational intensity and long processing times in the realistic and intricate applications of 6G. Pure data-driven deep learning (DL) methods offer powerful approximation capabilities and fast online inference but are hindered by insufficient datasets and poor interpretability. To address these issues, knowledge-driven DL integrates domain knowledge into neural networks, combining the strengths of both model-based and data-driven approaches. This survey systematically reviews knowledge-driven DL in wireless networks from a novel perspective of the knowledge integration approach. It provides a comprehensive definition of domain knowledge in wireless networks and clarifies the types of knowledge and their representations that can be integrated into neural networks. Furthermore, a leading taxonomy of knowledge integration approaches in wireless networks is proposed, encompassing the integration of domain knowledge into neural network model selection, neural network model customization, knowledge and data fusion architecture construction, loss function design, and hyperparameter configuration. Based on this taxonomy, literature on knowledge-driven resource allocation and signal processing is thoroughly reviewed. This survey aims to provide an insightful guideline for effectively incorporating domain knowledge into neural networks in the field of wireless communications, ultimately advancing efficient and reliable intelligent 6G networks.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), 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".