Thirdly, probability density map – 10 runs at a lower evaluation budget (24 iterations x 8 points per batch) are plotted together in objective space, and colored with a Gaussian kernel density estimate to illustrate the probability distribution of solutions. This is an alternative to optimization trajectory, where instead we consider the consistency and robustness during optimization for different random starts.