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
AI Writing Tools Roundup 2026: Assistants, Generators, and When to Use Which
0dev.to

从一句话到一套 SOP:普通人如何逐步提高 AI 使用效率
0dev.to
Which AI Agent for Workflow Automation Should You Buy?
0dev.to
What I learned shipping a read-only MCP server on Next.js and Vercel
0dev.to
F1 in Brazil: You’ve got to keep your tires alive
0Ars Technica
Nvidia CEO's affair becomes a national security problem
0Ars Technica