Question:
Question:
Hardness:
For an optimal transport from a measure which marginal distributions are independent to another measure is #P-hard with the input bits. That means, for a Cartesian product of $K$ independent distribution, although the input is $O(K)$ while the complexity will be $O(n^K)$.
While, usually the point may not very large:
A potential direction: maintain $K$ discretized marginal distribution, then update the potential function whenever a particle comes.
entropy: Independent marginal distribution has largest entropy
To create another independent case, and calculate the posterior