The computational complexity per WMMSE iteration has been shown to be \(\mathcal {O}(M^2)\)  for an \(M\) -user single-antenna interference network.
This complexity translates directly to each unrolled layer in UWMMSE as we follow the same update rules as WMMSE.
In addition, each GCN in a given unrolling layer has a complexity of \(\mathcal {O}(M^2F)\)  where \(F\)  is the hidden layer dimension [1]}.
Therefore, the complexity of UWMMSE scales with the size of the network as \(\mathcal {O}(M^2)\)  per unrolled layer, which is the same as the per-iteration complexity of WMMSE.
As a result, we achieve a significant gain in terms of processing time by limiting the number of unrolling layers in UWMMSE. This will be validated empirically in Section REF .
