Random Search Optimization
In random search optimization, we overcome one of the disadvantages of grid search optimization, which is choosing the best set of optimal values within the candidate values for each hyperparameter in the grid. Here, we opt for random choices from a distribution (in case of a continuous value for hyperparameters), instead of a static list that we would define. In random search optimization, we have a wider gamut of options to search from, as the continuous values for a hyperparameter are chosen randomly from a distribution. This increases the chances of finding the best value for a hyperparameter to a great extent.
Some of us might have already started understanding how random choices can always have the possibility of incorporating the best values for a hyperparameter. The true answer is that it doesn't always have an absolute advantage over grid search, but with a fairly large number of iterations, the chances of finding a more optimal set of hyperparameter increases...