Appendix: AmortizedMixingCouplingProcessesfor Clustering

M-step mainly consists of the weighted sum of partial derivative. Thus the complexity of regular E-step takes O(Nkd), and O(Nk(L+d)) for OT-based E step where L is the number of iterations of Sinkhorn's algorithm. The complexity of M-step takes O(Nkd).