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
KI-Agenten bauen Labore – aber wer versteht noch das Molekül?
0dev.to
llm-compressor for vLLM: The FP8/AWQ Deployment Tradeoff
0dev.to
Jensen Huang’s Troubles Leave the AI Industry Reeling
0Wired

Here’s what Trump said he knew about Jensen Huang
0The Verge

What could China get from Jensen Huang?
0The Verge

David Ellison says AI could be the ‘biggest creative unlock in modern history’
0The Verge