sink: A variational approximation of an expected permutation matrix
Description
Computes an approximate expected permutation matrix and marginal likelihood from a matrix of assignment likelihoods. The approximation minimizes a constrained KL divergence from the likelihood, and is computed via the repeated renormalization of the input's rows and columns.
An integer specifying the maximum number of steps used in the optimization.
return.permanent.bound
A logical value indicating whether the function should also return an upper bound on the permanent of A, which is then added to the output as an attribute.
Value
E(P), the expected permutation matrix corresponding to A.