The stochastic MGD algorithm for fGOT is summarised in Algorithm REF . Note that its computational complexity boils down to that of the matrix multiplications for each iteration of the algorithm. These can be computed very efficiently in the presence of sparse graphs, which is a common case in practice. We implemented Algorithm REF  in PyTorch using the AMSGrad method [1]}.
