TY - GEN
T1 - Learning Precoding Policy
T2 - 2022 IEEE Wireless Communications and Networking Conference, WCNC 2022
AU - Zhao, Baichuan
AU - Guo, Jia
AU - Yang, Chenyang
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Optimizing precoding with deep learning enables its real-time implementation. In addition to the learning perfor-mance such as sum rate, training complexity is also important since neural networks (NNs) have to be re-trained in time-varying channels. By leveraging the prior-known property for a policy to be learned, inductive biases can be introduced to the structure of NNs to balance the learning performance and training com-plexity. Most existing works use convolutional neural networks for learning precoding policy, without considering whether their inductive biases match the precoding task. In this paper, we first show that full-digital precoding policy exhibits permutation equivariance property and introduce graph NN (GNN) to learn the policy. We then analyze and show the connections between the structures and inductive biases of several NNs. Simulation results show that the inductive bias of the GNN is well-matched to the precoding policy, and hence achieves higher sum-rate with given number of training samples and needs lower training complexity to achieve the same sum-rate than other NNs.
AB - Optimizing precoding with deep learning enables its real-time implementation. In addition to the learning perfor-mance such as sum rate, training complexity is also important since neural networks (NNs) have to be re-trained in time-varying channels. By leveraging the prior-known property for a policy to be learned, inductive biases can be introduced to the structure of NNs to balance the learning performance and training com-plexity. Most existing works use convolutional neural networks for learning precoding policy, without considering whether their inductive biases match the precoding task. In this paper, we first show that full-digital precoding policy exhibits permutation equivariance property and introduce graph NN (GNN) to learn the policy. We then analyze and show the connections between the structures and inductive biases of several NNs. Simulation results show that the inductive bias of the GNN is well-matched to the precoding policy, and hence achieves higher sum-rate with given number of training samples and needs lower training complexity to achieve the same sum-rate than other NNs.
KW - Precoding
KW - convolutional neural networks
KW - graph neural network
KW - inductive bias
KW - permutation equivariance
UR - https://www.scopus.com/pages/publications/85130733493
U2 - 10.1109/WCNC51071.2022.9771688
DO - 10.1109/WCNC51071.2022.9771688
M3 - 会议稿件
AN - SCOPUS:85130733493
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 1027
EP - 1032
BT - 2022 IEEE Wireless Communications and Networking Conference, WCNC 2022
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 10 April 2022 through 13 April 2022
ER -