We propose a randomized greedy search algorithm to find point estimate for random partition based on loss function and posterior Monte Carlo samples. Given the large size awkward discrete nature of space, minimization expected is challenging. Our approach stochastic series optimizations performed in order embarrassingly parallel. consider several functions, including Binder variation informatio...
