Update grid-search.md

animator · web-flow · commit f26f8da60ec1 · 2024-05-31T20:53:21.000+05:30
diff --git a/contrib/machine-learning/grid-search.md b/contrib/machine-learning/grid-search.md
@@ -1,20 +1,26 @@
 # Grid Search
 
 Grid Search is a hyperparameter tuning technique in Machine Learning that helps to find the best combination of hyperparameters for a given model. It works by defining a grid of hyperparameters and then training the model with all the possible combinations of hyperparameters to find the best performing set.
+
 The Grid Search Method considers some hyperparameter combinations and selects the one returning a lower error score. This method is specifically useful when there are only some hyperparameters in order to optimize. However, it is outperformed by other weighted-random search methods when the Machine Learning model grows in complexity.
 
 ## Implementation
 
-Before applying Grid Searching on any algorithm, Data is used to divided into training and validation set, a validation set is used to validate the models. A model with all possible combinations of hyperparameters is tested on the validation set to choose the best combination.
-Grid Searching can be applied to any hyperparameters algorithm whose performance can be improved by tuning hyperparameter. For example, we can apply grid searching on K-Nearest Neighbors by validating its performance on a set of values of K in it. Same thing we can do with Logistic Regression by using a set of values of learning rate to find the best learning rate at which Logistic Regression achieves the best accurac
+Before applying Grid Searching on any algorithm, data is divided into training and validation set, a validation set is used to validate the models. A model with all possible combinations of hyperparameters is tested on the validation set to choose the best combination.
+
+Grid Searching can be applied to any hyperparameters algorithm whose performance can be improved by tuning hyperparameter. For example, we can apply grid searching on K-Nearest Neighbors by validating its performance on a set of values of K in it. Same thing we can do with Logistic Regression by using a set of values of learning rate to find the best learning rate at which Logistic Regression achieves the best accuracy.
+
 Let us consider that the model accepts the below three parameters in the form of input:
-1. Number of hidden layers [2, 4]
-2. Number of neurons in every layer [5, 10]
-3. Number of epochs [10, 50]
+1. Number of hidden layers `[2, 4]`
+2. Number of neurons in every layer `[5, 10]`
+3. Number of epochs `[10, 50]`
+
+If we want to try out two options for every parameter input (as specified in square brackets above), it estimates different combinations. For instance, one possible combination can be `[2, 5, 10]`. Finding such combinations manually would be a headache.
 
-If we want to try out two options for every parameter input (as specified in square brackets above), it estimates different combinations. For instance, one possible combination can be [2, 5, 10]. Finding such combinations manually would be a headache.
 Now, suppose that we had ten different parameters as input, and we would like to try out five possible values for each and every parameter. It would need manual input from the programmer's end every time we like to alter the value of a parameter, re-execute the code, and keep a record of the outputs for every combination of the parameters.
+
 Grid Search automates that process, as it accepts the possible value for every parameter and executes the code in order to try out each and every possible combination outputs the result for the combinations and outputs the combination having the best accuracy.
+
 Higher values of C tell the model, the training data resembles real world information, place a greater weight on the training data. While lower values of C do the opposite.
 
 ## Explaination of the Code 
@@ -32,37 +38,34 @@ The code provided performs hyperparameter tuning for a Logistic Regression model
 10. logit.score(X, y) calculates the accuracy of the fitted model on the dataset and appends this score to the scores list.
 11. After the loop, the scores list is printed, showing the accuracy for each value of C.
 
-## Python Code
+### Python Code
 
+```python
 from sklearn import datasets
-
 from sklearn.linear_model import LogisticRegression
 
 iris = datasets.load_iris()
-
 X = iris['data']
-
 y = iris['target']
 
 logit = LogisticRegression(max_iter = 10000)
 
 C = [0.25, 0.5, 0.75, 1, 1.25, 1.5, 1.75, 2]
 
 scores = []
-
 for choice in C:
-
   logit.set_params(C=choice)
-  
   logit.fit(X, y)
-  
   scores.append(logit.score(X, y))
-  
 print(scores)
+```
 
-## Results
+#### Results
 
+```
 [0.9666666666666667, 0.9666666666666667, 0.9733333333333334, 0.9733333333333334, 0.98, 0.98, 0.9866666666666667, 0.9866666666666667]
+```
+
+We can see that the lower values of `C` performed worse than the base parameter of `1`. However, as we increased the value of `C` to `1.75` the model experienced increased accuracy.
 
-We can see that the lower values of C performed worse than the base parameter of 1. However, as we increased the value of C to 1.75 the model experienced increased accuracy.
-It seems that increasing C beyond this amount does not help increase model accuracy.
+It seems that increasing `C` beyond this amount does not help increase model accuracy.
