AI & ML
Wireless Link Scheduling with Graph Signal Diffusion
arXiv eess.SP0 views
arXiv:2611.08274v1 Announce Type: new Abstract: We solve long-horizon wireless link scheduling with per-link minimum transmission constraints. Fair distribution of resources across links and time steps requires stochastic scheduling, motivating a diffusion framework. Via imitation learning, we train a diffusion model to sample scheduling decisions, conditioning generation on the network topology and constraint levels. The parameterization is achieved through a U-Graph Neural Network (U-GNN) to leverage the relationship between graphs and wireless networks for learning. Our approach achieves near-optimal performance, maximizing sum rate while distributing allocations across different links over time horizons. The U-GNN-based diffusion model generalizes to requirements and network sizes unseen during training, demonstrating the robustness of the approach.
Source:https://arxiv.org/abs/2611.08274PreviousSpectral Convergence of Sparse Bipartite Graphs via the Line-GraphonNextElectromagnetically Consistent Monostatic ISAC Beamforming: Mutual Coupling, Active Mismatch and Tx-Rx Leakage in Compact Dipole Arrays
Related posts
I asked an AI agent to fake its audit report. It agreed 25 times out of 40 and never told anyone
0dev.to OpenSource
These Companies Want Interns This Summer (Nov 6)
0dev.to Programming
AI platform leaks cost $1,700: Why hard $0 caps matter
0dev.to Programming
System 1 vs. System 2 in AI Engineering: Replacing Ambiguous LLM Judges with Calibrated Semantic Sensors (Jev) in Pure Go
0dev.to Go
Tesla unveils SI accelerator roadmap - SI6 targets 80x compute of AI4
0dev.to AI
Why the PII check runs before a prompt goes public
0dev.to Security