Masters Theses
Random Search Plus: A more effective random search for machine learning hyperparameters optimization
Date of Award
12-2020
Degree Type
Thesis
Degree Name
Master of Science
Major
Computer Science
Major Professor
Bruce J.MacLennan
Committee Members
Bruce J.MacLennan, Audris Mockus, Amir Sadovnik
Abstract
Machine learning hyperparameter optimization has always been the key to improve model performance. There are many methods of hyperparameter optimization. The popular methods include grid search, random search, manual search, Bayesian optimization, population-based optimization, etc. Random search occupies less computations than the grid search, but at the same time there is a penalty for accuracy. However, this paper proposes a more effective random search method based on the traditional random search and hyperparameter space separation. This method is named random search plus. This thesis empirically proves that random search plus is more effective than random search. There are some case studies to do a comparison between them, which consists of four different machine learning algorithms including K-NN, K-means, Neural Networks and Support Vector Machine as optimization objects with three different size datasets including Iris flower, Pima Indians diabetes and MNIST handwritten dataset. Compared to traditional random search, random search plus can find a better hyperparameters or do an equivalent optimization as random search but with less time at most cases. With a certain hyperparameter space separation strategy, it can only need 10% time of random search to do an equivalent optimization or it can increase both the accuracy of supervised leanings and the silhouette coefficient of a supervised learning by 5%-30% in a same runtime as random search. The distribution of the best hyperparameters searched by the two methods in the hyperparameters space shows that random search plus is more global than random search. The thesis also discusses about some future works like the feasibility of using genetic algorithm to improve the local optimization ability of random search plus, space division of non-integer hyperparameters, etc.
Recommended Citation
Li, Bohan, "Random Search Plus: A more effective random search for machine learning hyperparameters optimization. " Master's Thesis, University of Tennessee, 2020.
https://trace.tennessee.edu/utk_gradthes/5849
Included in
Artificial Intelligence and Robotics Commons, Statistical Methodology Commons, Theory and Algorithms Commons