3 Types of Gradient Decent Types : Batch, Stochastic & Mini-Batch _ Day 8

Understanding Gradient Descent: Batch, Stochastic, and Mini-Batch Understanding Gradient Descent: Batch, Stochastic, and Mini-Batch Learn the key differences between Batch Gradient Descent, Stochastic Gradient Descent, and Mini-Batch Gradient Descent, and how to apply them in your machine learning models. Batch Gradient Descent Batch Gradient Descent uses the entire dataset to calculate the gradient of the cost function, leading to stable, consistent steps toward an optimal solution. It is computationally expensive, making it suitable for smaller datasets where high precision is crucial. Formula: \[\theta := \theta – \eta \cdot \frac{1}{m} \sum_{i=1}^{m} \nabla_{\theta} J(\theta; x^{(i)}, y^{(i)})\] \(\theta\) = parameters \(\eta\) = learning rate \(m\) = number of training examples \(\nabla_{\theta} J(\theta; x^{(i)}, y^{(i)})\) = gradient of the cost function Stochastic Gradient Descent (SGD) Stochastic Gradient Descent updates parameters using each training example individually. This method can quickly adapt to new patterns, potentially escaping local minima more effectively than Batch Gradient Descent. It is particularly useful for large datasets and online learning environments. Formula: \[\theta := \theta – \eta \cdot \nabla_{\theta} J(\theta; x^{(i)}, y^{(i)})\] \(\theta\) = parameters \(\eta\) = learning rate \(\nabla_{\theta} J(\theta; x^{(i)}, y^{(i)})\) = gradient of the cost function for a single training example Mini-Batch Gradient Descent Mini-Batch Gradient Descent is...

Membership Required

You must be a member to access this content.

View Membership Levels

Already a member? Log in here

Can we make prediction without need of going through iteration ? yes with the Normal Equation _ Day 6

Understanding Linear Regression: The Normal Equation and Matrix Multiplications Explained Understanding Linear Regression: The Normal Equation and Matrix Multiplications Explained Linear regression is a fundamental concept in machine learning and statistics, used to predict a target variable based on one or more input features. While gradient descent is a popular method for finding the best-fitting line, the normal equation offers a direct, analytical approach that doesn’t require iterations. This blog post will walk you through the normal equation step-by-step, explaining why and how it works, and why using matrices simplifies the process. Table of Contents Introduction to Linear Regression Gradient Descent vs. Normal Equation Step-by-Step Explanation of the Normal Equation Step 1: Add Column of Ones Step 2: Transpose of X (XT) Step 3: Matrix Multiplication (XTX) Step 4: Matrix Multiplication (XTy) Step 5: Inverse of XTX ((XTX)-1) Step 6: Final Multiplication to Get θ Why the Normal Equation Works Without Gradient Descent Advantages of Using Matrices Conclusion Introduction to Linear Regression Linear regression aims to fit a line to a dataset, predicting a target variable $y$ based on input features $x$. The model is defined as: $$ y = \theta_0 + \theta_1 x $$ For multiple features, it generalizes...

Membership Required

You must be a member to access this content.

View Membership Levels

Already a member? Log in here