This paper proposes a novel positional attention-based GNN to learn permutation nonequivariant policies efficiently, and employs the proposed GNN to learn the policies, where the embedding function is designed based on the channel covariance matrix.
Abstract
Graph neural networks (GNNs) have emerged as a promising approach to learning wireless policies efficiently by leveraging topology prior and incorporating relational inductive biases. However, when the optimal policy is not permutation equivariant (PE), conventional GNNs suffer from mismatched inductive biases, leading to degraded performance or poor generalizability. This issue arises in wireless tasks with expected objectives, such as channel estimation and end-to-end (E2E) precoding, where the PE property of the optimal policy depends on the underlying channel distribution. In this paper, we propose a novel positional attention-based GNN to learn permutation nonequivariant policies efficiently. The core idea is to incorporate relative positions of vertices into the attention mechanism via an embedding function, enabling the GNNs to capture asymmetric relationships. Consequently, the proposed GNN can represent permutation non-equivariant functions, while retaining high learning efficiency and size generalizability through parameter sharing. We consider channel estimation and E2E precoding as case studies, and prove that their policies are PE to users but not to antennas under spatially correlated channels. We employ the proposed GNN to learn the policies, where the embedding function is designed based on the channel covariance matrix. Simulation results demonstrate that the proposed GNN outperforms existing channel estimation and E2E precoding methods, requires fewer samples for training, and can be generalized to systems with different numbers of antennas and users.
Graph neural networks (GNNs) are the standard tool for node representation learning and are increasingly used in high-stakes settings. Their message-passing backbone, however, can amplify topological bias, raising fairness concerns. We study group fairness at the level of downstream predictions for node classification,...
Topology-Aware Dynamic Reweighting (TAR+), a model-agnostic framework for node classification under strict graph distribution shifts and related robustness stressors, is proposed, supporting the broad applicability of topology-aware reweighting across heterogeneous graph learning conditions.
Jia-Xing Li, Jia-Shuo Liu, Wei-Huang Zheng et al.· IEEE Transactions on Pattern...· 0 citations
DeltaGNN is introduced, to the best of the authors' knowledge, among the first scalable (featuring linear computational and memory complexity overhead) and generalizable (capable of effectively handling graphs with diverse homophily, density, and topology) architectures for long-range and short-range interaction detect...
Kevin Mancini, Islem Rekik· IEEE Transactions on Pattern...· 2 citations
This paper proposes a spectral-based graph augmentation framework designed to investigate and improve generalization behavior in dynamic graphs under distribution shifts and develops a multi-encoder architecture in which each encoder targets a specific spectral shift component to generate referential representations.
Qian-Yu Song, Chao Li, Zhongying Zhao et al.· Proceedings of the Thirty-Fi...· 0 citations
This work proposes a novel Adaptive Dual-level Collaborative GNN associated with an adaptive dual-level collaborative mechanism, and shows that the ADC-GNN can inject the learned high-level information back into the node level, forming a closed-loop, bidirectional optimization process.
Wan Tang, Lu Bai, Li-Xin Cui et al.· Proceedings of the Thirty-Fi...· 0 citations
Subgraph Filtering for Fair Graph Neural Networks is proposed, a lightweight and architecture-agnostic framework that mitigates structural bias at its source and achieves consistent fairness improvements while maintaining competitive predictive performance, leading to a better fairness--accuracy trade-off than recent f...
Hao-Hui Lu, Ji-Yuan Tian, Fangyu Zhou et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.