Testing IOPS's BO search against random sampling using cached HPC results

Sat, 24 Jan 2026 00:00:00 +0000

IOPS can use Bayesian Optimization when the objective is to find the parameter combination that yields the maximum (or minimum) metric value in a search space. In this article, we decided to test the efficiency of IOPS’s BO search by comparing it against IOPS’s random search. The idea is simple: given a search space, run both IOPS BO and Random, then compare the results to see which one reaches the optimal first. And of course, it should not be a surprise at this point that we used an I/O benchmark to do it.

Bayesian-Optimization on IOPS

Testing IOPS's BO search against random sampling using cached HPC results