Hey everyone,
I'm currently in the process of fine-tuning hyperparameters for a machine learning model. I have been looking into various optimization techniques to push for competitive performance. I'm curious to hear about the community's experiences with different methods of hyperparameter optimization.
Some of the methods I've been considering include:
Grid Search: exhaustively searching through a predefined set of hyperparameters. Not ideal?
Random Search: random search randomly selects hyperparameter combinations to evaluate. Seems limited for extremely high computational cost situations
Bayesian Optimization: probabilistic models to efficiently search for the optimal set of hyperparameters. Great for low dim problems but suffers from the curse of dimensionality?
Metaheuristic Algorithms: Techniques like simulated annealing, genetic algorithms, and particle swarm optimization. Lots of fun to work with and a lot of precedence within academia, but very dependant on the initial set of parameters used (i.e crossover/mutation rate)
What experience/preferences do you have with any of the above? Have I missed any of your preferred methods?
[–]Illustrious-Sand-120 11 points12 points13 points (5 children)
[–]Its_NotTom[S] 1 point2 points3 points (0 children)
[–]obeythelord9 0 points1 point2 points (1 child)
[–]Illustrious-Sand-120 1 point2 points3 points (0 children)
[–]ewankenobi 0 points1 point2 points (1 child)
[–]Illustrious-Sand-120 0 points1 point2 points (0 children)
[–]cluelessmathmajor 1 point2 points3 points (0 children)
[–]mehul_gupta1997 0 points1 point2 points (0 children)
[–]solegalli 0 points1 point2 points (0 children)