Hyper parameter tuning: Grid Search CV VS Randomized Search CV



Hyperparameters are the variables that is defined by the developer of the model in order to get the best model possible. For example, max_depth and n_estimators in Random Forest.

There are multiple ways to setup the these hyperparameters. Two basic methods are Grid and Random Search.


Grid Search

The way GS will work is such that it will take a combination of each and every hyperparameters that is decided to use. It is a very efficient method in terms of getting the best possible hyperparameters. But as there will be multiple combinations along with cross validation, it will be a time consuming and expensive business.


                                                                                                 Fig: encrypted-tbn0.gstatic

        

Some important arguments of Grid Search CV

1. estimator – A scikit-learn model
2. param_grid – A dictionary with parameter names as keys and lists of parameter values.
3. scoring – The performance measure. For example, ‘r2’ for regression models, ‘precision’ for classification models.
4. cv – An integer that is the number of folds for K-fold cross-validation.

5. verbose - Controls the verbosity:, the higher the more messages.

6. n_jobs- It will help in allocating the CPU for the model execution. Keep -1 as value in order to automate the process.


Random Search

Random search tries random combinations of a range of values (we have to define the number iterations). It is good in testing a wide range of values and normally it reaches a very good combination very fast, but the problem that it doesn’t guarantee to give the best parameters combination.




One thing that we can try doing is applying the random search CV first on the model and from that use the best parameters as param_grid for Grid search CV. In this way we can make use of both the methods and can come to a very good conclusion without taking enough time.




Quora: Mazen-Aly



Comments

Post a Comment

Popular posts from this blog

Euclidean Distance and Manhattan Distance

Image
  Euclidean and Manhattan Distance Euclidean Distance and Manhattan Distance are the two distances that we generally use to find distance between two data points. Use of this distance can be seen in algorithms like KNN, Kmean and Hierarchical clustering. We can check if there are any similarities between the two data points with the help of these distances. Euclidean distance The smallest possible distance between any two points is named as euclidean distance. This distance is calculated based on Pythagoras theorem as shown in the below figure. Source:  cdn-images-1.medium.com This is the case for 2-D data.  For higher dimensions we can add the additional dimension. This is case for any number of dimensions. Euclidean distance is used where we calculate the distance between any two points in a straight line irrespective of whether there are any other data points in between them. Ex. when we google to check distance between Cochin and Delhi in case of flight we get a straight point from
Read more

Ensemble Technique 2 : AdaBoost

Image
 AdaBoost AdaBoost or Adaptive Boosting is a boosting technique that is used as an Ensemble Method in Machine Learning. In this algorithm, the weights are re-assigned at each and every instances with higher weight for wrongly classified instances. The main motive behind this algorithm is to convert the weak learners to strong learners. Source:  miro.medium.com Boosting Technique As we can see from the above figure, suppose the original data is D1 and the trained classifier seen below is a base learner BL1(say). BL1 can be any model/algorithm provided with a sample of data to train. After training the model, when the original data is used to validate the model, the incorrectly classified records are further treated by moving them to a next base learner (BL2). Now the BL2 will be trained with those wrong classified records and further if they classify some more records incorrectly then again a new base learning is created (BL3) and this process continues till we specify some limits to th
Read more

Forecast Accuracy Metrics

Image
 Forecast Accuracy Metrics We will be discussing here about the most commonly used forecast accuracy metrics mentioned below: Forecast bias MAD MAPE MSE RMSE MPE Forecast Bias This metric will help us in understanding whether the model has over estimated or under estimated. If the value is positive then its overestimation and if its negative then underestimation.  In order to get bias as a % of sales, we have Forecast Bias %                                                                             fig:  relexsoumtions                                    If the value is more than 100 % then its an over forecast and if its less than 100% its under forecast. It is important metric in demand forecasting as it will tell us the over or under supply at the central warehouse or distribution centers. It does not give information on quality of detailed level of forecast. Target is to achieve a 1 or 100% and the number -/+ tells the deviation.        2. Mean Absolute Deviation (MAD) This metrics
Read more