Abstract:Exploiting mathematical properties of wireless policies in deep neural network (DNN) design can improve learning performance and generalizability while reducing training complexity. Permutation equivariance and permutation invariance have been incorporated into DNN architectures. In this paper, we investigate conjugation equivariance (CE) and propose a general conjugation-equivariant neural network (CENN) framework for precoder learning. We first establish that the optimal policies for a unified class of precoding problems satisfy CE, i.e., when the channel matrices are conjugated, the conjugate of an optimal precoder remains optimal. We then show that, for DNNs with linear processing functions, enforcing CE restricts their ability to learn optimal precoding policies. To overcome this limitation, we develop a general nonlinear construction and prove that it converts an arbitrary base function into a CE processing function while preserving the base function's original equivariance properties. This construction enables existing equivariant networks to incorporate CE without adding learnable parameters. Simulations for fully digital and RIS-aided precoding show that the resulting CE-enhanced networks improve learning and generalization performance while requiring fewer training samples and shorter training time than their original counterparts.
Abstract:Deep learning has been widely recognized as a promising approach for optimizing multi-user multi-antenna precoders in traditional cellular systems. However, a critical distinction between cell-free and cellular systems lies in the flexibility of user equipment (UE)-access point (AP) associations. Consequently, the optimal precoder depends not only on channel state information but also on the dynamic UE-AP association status. In this paper, we propose an association-aware graph neural network (AAGNN) that explicitly incorporates association status into the precoding design. We leverage the permutation equivariance properties of the cell-free precoding policy to reduce the training complexity of AAGNN and employ an attention mechanism to enhance its generalization performance. Simulation results demonstrate that the proposed AAGNN outperforms baseline learning methods in both learning performance and generalization capabilities while maintaining low training and inference complexity.
Abstract:Weighted sum rate maximization (WSRM) for precoder optimization effectively balances performance and fairness among users. Recent studies have demonstrated the potential of deep learning in precoder optimization for sum rate maximization. However, the WSRM problem necessitates a redesign of neural network architectures to incorporate user weights into the input. In this paper, we propose a novel deep neural network (DNN) to learn the precoder for WSRM. Compared to existing DNNs, the proposed DNN leverage the joint unitary and permutation equivariant property inherent in the optimal precoding policy, effectively enhancing learning performance while reducing training complexity. Simulation results demonstrate that the proposed method significantly outperforms baseline learning methods in terms of both learning and generalization performance while maintaining low training and inference complexity.