Converts a probabilistic cluster assignment to a unique cluster assignment using the
state of row i is assigned as the position of the maximum in that row (ties are broken at random).
state of row i is sampled from the discrete distribution where probabilities equal the weight vector in row i
an N \times K matrix
how do we choose the state given the weight
1 2 3 4 5 6 7 8