         Tij 0

In this case \(C\) , the 'cost matrix', contains how far each
element in \(A\)  is from each element in \(B\) . \(\textsc {EMD}(A,B)\)  captures
the distance between sets \(A\)  and \(B\) , but finding the optimal \(T\)  costs \(O(\max (m,n)^3)\) , and is therefore untenable for gradient descent based style
transfer (where it would need to be computed at each update
step). Instead we will use the Relaxed EMD [1]}. To
define this we will use two auxiliary distances, essentially each is
the EMD with only one of the constraints  (REF ) or (REF ):

RA(A,B)=T0 ij TijCij   s.t. j Tij = 1/m
