Skip to main content

What are loss functions, and gradient descend?

 

Loss Functions

A loss function is a mathematical function that measures how well a machine learning model's predictions match the actual target values. It quantifies the "error" between the predicted values (y^\hat{y}) and the true values (yy). The goal of training a machine learning model is to minimize this loss function, thereby improving the model's performance.

Common Loss Functions:

  1. Mean Squared Error (MSE): Used for regression problems.

    MSE=1ni=1n(yiy^i)2\text{MSE} = \frac{1}{n} \sum_{i=1}^{n} (y_i - \hat{y}_i)^2
  2. Mean Absolute Error (MAE): Another regression loss function, less sensitive to outliers than MSE.

    MAE=1ni=1nyiy^i\text{MAE} = \frac{1}{n} \sum_{i=1}^{n} |y_i - \hat{y}_i|
  3. Cross-Entropy Loss: Used for classification tasks.

    CrossEntropy=1ni=1n[yilog(y^i)+(1yi)log(1y^i)]\text{CrossEntropy} = -\frac{1}{n} \sum_{i=1}^{n} \left[ y_i \log(\hat{y}_i) + (1 - y_i) \log(1 - \hat{y}_i) \right]
  4. Hinge Loss: Often used for support vector machines.

    Hinge Loss=1ni=1nmax(0,1yiy^i)\text{Hinge Loss} = \frac{1}{n} \sum_{i=1}^{n} \max(0, 1 - y_i \cdot \hat{y}_i)

Gradient Descent

Gradient Descent is an optimization algorithm used to minimize a loss function. It works by iteratively adjusting the model's parameters (weights and biases) in the direction that reduces the loss.

How It Works:

  1. Compute Gradients: Calculate the derivative (gradient) of the loss function with respect to each parameter.

    θL=Lθ\nabla_\theta L = \frac{\partial L}{\partial \theta}
  2. Update Parameters: Adjust the parameters using the gradient and a learning rate (η\eta):

    θ=θηθL\theta = \theta - \eta \nabla_\theta L
  3. Repeat: Iterate until convergence (loss stops decreasing or reaches a minimum).

Types of Gradient Descent:

  1. Batch Gradient Descent: Uses the entire dataset to compute the gradient at each step.

    • Pros: Accurate gradient computation.
    • Cons: Slow for large datasets.
  2. Stochastic Gradient Descent (SGD): Uses a single data point to compute the gradient.

    • Pros: Faster updates.
    • Cons: Noisy convergence.
  3. Mini-Batch Gradient Descent: Uses a subset (mini-batch) of data to compute the gradient.

    • Pros: Balances speed and accuracy.

Relationship Between Loss Functions and Gradient Descent:

The loss function provides a metric for model performance, and gradient descent is the method to minimize this loss function by updating model parameters systematically. Together, they form the foundation of training machine learning models.

Comments

Popular posts from this blog

Simple Linear Regression - and Related Regression Loss Functions

Today's Topics: a. Regression Algorithms  b. Outliers - Explained in Simple Terms c. Common Regression Metrics Explained d. Overfitting and Underfitting e. How are Linear and Non Linear Regression Algorithms used in Neural Networks [Future study topics] Regression Algorithms Regression algorithms are a category of machine learning methods used to predict a continuous numerical value. Linear regression is a simple, powerful, and interpretable algorithm for this type of problem. Quick Example: These are the scores of students vs. the hours they spent studying. Looking at this dataset of student scores and their corresponding study hours, can we determine what score someone might achieve after studying for a random number of hours? Example: From the graph, we can estimate that 4 hours of daily study would result in a score near 80. It is a simple example, but for more complex tasks the underlying concept will be similar. If you understand this graph, you will understand this blog. Sim...

What problems can AI Neural Networks solve

How does AI Neural Networks solve Problems? What problems can AI Neural Networks solve? Based on effectiveness and common usage, here's the ranking from best to least suitable for neural networks (Classification Problems, Regression Problems and Optimization Problems.) But first some Math, background and related topics as how the Neural Network Learn by training (Supervised Learning and Unsupervised Learning.)  Background Note - Mathematical Precision vs. Practical AI Solutions. Math can solve all these problems with very accurate results. While Math can theoretically solve classification, regression, and optimization problems with perfect accuracy, such calculations often require impractical amounts of time—hours, days, or even years for complex real-world scenarios. In practice, we rarely need absolute precision; instead, we need actionable results quickly enough to make timely decisions. Neural networks excel at this trade-off, providing "good enough" solutions in seco...

Activation Functions in Neural Networks

  A Guide to Activation Functions in Neural Networks 🧠 Question: Without activation function can a neural network with many layers be non-linear? Answer: Provided at the end of this document. Activation functions are a crucial component of neural networks. Their primary purpose is to introduce non-linearity , which allows the network to learn the complex, winding patterns found in real-world data. Without them, a neural network, no matter how deep, would just be a simple linear model. In the diagram below the f is the activation function that receives input and send output to next layers. Commonly used activation functions. 1. Sigmoid Function 2. Tanh (Hyperbolic Tangent) 3. ReLU (Rectified Linear Unit - Like an Electronic Diode) 4. Leaky ReLU & PReLU 5. ELU (Exponential Linear Unit) 6. Softmax 7. GELU, Swish, and SiLU 1. Sigmoid Function                       The classic "S-curve," Sigmoid squashes any input value t...