Skip to main content

GRU Architecture

 GRU (Gated Recurrent Unit) 


🧠 What is GRU?

GRU (Gated Recurrent Unit) is a type of Recurrent Neural Network (RNN) architecture introduced in 2014.
It was designed to solve the same problems as LSTM (Long Short-Term Memory) but with a simpler structure and fewer parameters.


🚀 Why GRU?

  • Handles long-term dependencies.
  • Mitigates vanishing gradient problem.
  • Simpler & faster than LSTM.
  • Performs well on sequence data like text, time series, audio.

🔑 Core Components of GRU:

At each time step t, GRU has:

  1. Update Gate (z_t):
    Controls how much of the past information to keep.

  2. Reset Gate (r_t):
    Controls how much of the past information to forget.

  3. Candidate Activation (h̃_t):
    Computes new information to add.

  4. Final Hidden State (h_t):
    Combines old state and new candidate info.


⚙️ Mathematical Equations:

Given input x_t and previous hidden state h_{t-1}:

1. Update Gate (z_t):

z_t = σ(W_z * [h_{t-1}, x_t] + b_z)

Controls how much of the past to keep.


2. Reset Gate (r_t):

r_t = σ(W_r * [h_{t-1}, x_t] + b_r)

Controls how much past info to forget.


3. Candidate Activation (h̃_t):

h̃_t = tanh(W_h * [r_t * h_{t-1}, x_t] + b_h)

Uses reset gate → combines past + present info.


4. Final Hidden State (h_t):

h_t = (1 - z_t) * h_{t-1} + z_t * h̃_t

Mixes old hidden state & new candidate.



📊 GRU Architecture Diagram:

Simplified Visual:

Input x_t
   ↓
+--------------------+
|    Update Gate     | -----> z_t
+--------------------+
   ↓
+--------------------+
|    Reset Gate      | -----> r_t
+--------------------+
   ↓
+----------------------------------+
|  Candidate Activation (h̃_t)      |
| Combines reset gate & input      |
+----------------------------------+
   ↓
+----------------------------------+
| Final Hidden State (h_t)         |
| Combines old state & candidate   |
+----------------------------------+

Detailed Visual Flow:

Previous Hidden State (h_{t-1}) ─────────┐
                                         │
Input (x_t) ─────────────┐               ▼
                         │         +-------------+
                         └────────▶ | Update Gate|──────▶ z_t
                                   +-------------+
                                         │
                                         ▼
                                  +-------------+
                                  | Reset Gate  |─────▶ r_t
                                  +-------------+
                                         │
                                         ▼
                                 ┌──────────────────┐
                                 │ Apply Reset Gate │
                                 └──────────────────┘
                                         │
                                         ▼
                                 +-------------------+
                                 | Candidate h̃_t     |
                                 +-------------------+
                                         │
                                         ▼
                         +-------------------------------------+
                         | Combine with h_{t-1} via Update Gate|
                         +-------------------------------------+
                                         │
                                         ▼
                                Final Hidden State (h_t)

🟢 GRU vs LSTM:

Feature GRU LSTM
Gates 2 (Update, Reset) 3 (Input, Forget, Output)
Memory Cell No separate cell state (uses hidden state) Separate cell state and hidden state
Parameters Fewer More (heavier)
Computation Speed Faster Slightly slower
Performance Similar (depends on dataset/task) Sometimes better for very long sequences

🌟 Key Benefits of GRU:

  • Simpler architecture, fewer parameters.
  • Efficient for training, faster convergence.
  • Good balance between speed & performance.

🚀 Applications of GRU:

  • NLP (Language Modeling, Translation)
  • Speech Recognition
  • Time Series Forecasting
  • Stock Market Prediction
  • Video Data Analysis


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...