By Viraj Nayak

This packet contains an overview of different hyperparameter tuning methods in the Scikit-Optimize and Hyperopt libraries.

This project contains an overview of different Sequential model-based optimization methods in the **Scikit-Optimize** and **Hyperopt** libraries.

**Hyperparameters** are parameters that are defined before training and are not directly learned by the learning algorithm. Hyperparameters constrain the algorithm by controlling how flexible the model is.

**Hyperparameter Tuning** is** **the method of choosing the best combination of hyperparameters for a given dataset.

Different types of hyperparameter tuning methods are:

**Manual Search:**Essentially, we input the hyperparameters based on our judgment and update them based on model performance. The process repeats till desired performance is achieved.**Grid Search:**We define a hyperparameter search space, and models are trained on all the points randomly sampled in that space.**Random Search:**We define a hyperparameter search space, and models are trained on randomly sampled points in that space.**Bayesian Optimization:**Bayesian optimization is a sequential strategy for global optimization of black-box functions, which does not assume any functional forms.

Manual search is an example of informed search as we choose parameters based on the previous set of hyperparameters and model performance. Whereas, Grid and Random Search are examples of uninformed search where the next set of hyperparameters are chosen at random from the search space.

Sequential search techniques pick a few hyperparameter settings, evaluate their quality, then decide where to sample next. In other words, SMBO looks back at the result of the last runs to focus future searches on areas that look more promising.

The optimization process has three parts:

**Objective function:**The function that we want to minimize.**Search/Hyperparameter Space****Hyperparameter optimization function:**constructs

SMBO methods are a formalization of Bayesian optimization that update the probability model sequentially. Every evaluation of the objective function with a set of values updates the model with the idea that eventually the model will come to represent the true objective function.

Scikit-Optimize is a simple and efficient library to minimize expensive and noisy black-box functions. It implements several methods for sequential model-based optimization.

The scikit-optimize models discussed in the project are:

- Randomized Search
- Bayesian Search with Gaussian Process
- Bayesian Search with Random Forests
- Bayesian Search with Gradient Boosting Machine (GBM)
- BayeSearchCV: Scikit-learn hyperparameter search wrapper

**Installing Scikit-Optimize:**

- Via pip: pip install scikit-optimize
- Via conda: conda install -c conda-forge scikit-optimize

The hyperopt models discussed in the project are:

- Randomized Search
- Anneal
- Tree of Parzen Estimators (TPE)

**Installing Hyperopt:**

- pip install hyperopt

Submitted by Viraj Nayak (nayakviraj21)

- College Enquiry System using Flask in Python
- ATM Project using Java-Beginner level
- Bank Application in Java
- Age Calculator using Java
- BitMasking basic operations in Java
- Authentication with Firebase in Android Studio using a Phone Number in Java
- Card Number Detailer using C++
- Basic calculator using C++

Download packets of source code on Coders Packet