Category Archives: Machine Learning

Advanced Tokenization Techniques in NLP

In Natural Language Processing (NLP), the way we represent text has a profound impact on the performance of our models. Tokenization, the process of breaking down text into smaller manageable units called tokens, is a foundational step in preparing text data for NLP tasks. While simple techniques like word-level tokenization exist, advanced methods like Byte Pair Encoding (BPE), SentencePiece, and WordPiece offer advantages, particularly when dealing with large vocabularies and out-of-vocabulary (OOV) words. Let’s delve into these techniques and understand their nuances.

What is Tokenization?

Tokenization is the process of segmenting a piece of text into smaller units called tokens. These tokens can range from:

Words: “The cat sat on the mat.” -> [“The”, “cat”, “sat”, “on”, “the”, “mat”]
Characters: “NLP is cool!” -> [“N”, “L”, “P”, ” “, “i”, “s”, ” “, “c”, “o”, “o”, “l”, “!”]
Subwords: “understandable” -> [“under”, “##stand”, “##able”]

Why Tokenization Matters

Manageable Units: NLP models generally don’t work directly with raw text. Tokens provide a structured representation for models to process.
Vocabulary Size: Tokenization techniques can influence the vocabulary size of your model, directly impacting memory usage and computational efficiency.

Advanced Tokenization Techniques

Let’s explore some sophisticated tokenization techniques frequently used in modern NLP models:

Byte Pair Encoding: BPE is a data compression technique adapted for NLP. It works as follows:
Initialization: Starts with a vocabulary of individual characters.
Iterative Merging: The most frequent pair of consecutive characters is identified and merged into a new symbol. This process is repeated until a desired vocabulary size is reached.
Example:
Initial vocabulary: ['a', 'b', 'd', 'e', 'g']
Most frequent pair: 'e', 'g' -> merge into 'eg'
New vocabulary: ['a', 'b', 'd', 'eg']
Advantage: BPE effectively handles rare and out-of-vocabulary words by representing them as sequences of subword tokens.

SentencePiece: SentencePiece builds upon BPE but has a key distinction—it treats the input text as a stream of Unicode characters without predefined word boundaries. This makes it language-independent and robust to different writing systems.
Advantage: SentencePiece is particularly useful for languages that don’t have clear-cut word boundaries, such as Chinese or Japanese.

WordPiece: WordPiece is similar to BPE but uses a probabilistic approach to select the best subword merges. It aims to produce subwords that are meaningful from a linguistic perspective.
Advantage: WordPiece often results in more intuitive subword units compared to BPE.

Comparison

Technique	Description	Pros	Cons
BPE	Iteratively merges frequent character pairs	Handles OOV words, language-agnostic	Can produce less intuitive subwords
SentencePiece	BPE-like, operates on raw Unicode text	Handles languages without word boundaries	Can be slightly slower than BPE
WordPiece	Probabilistic version of BPE	More linguistically meaningful subwords	A bit more computationally intensive

Let’s See Them in Action! (Example in Python using a hypothetical tokenizer)

tokenizer = Tokenizer(method='bpe', vocab_size=5000) 

text = "Tokenization is a fascinating process!"
tokens = tokenizer.encode(text)
print(tokens) 
# Output: ['Token', '##ization', ' is', ' a', ' fascin', '##ating', ' pro', '##cess', '!']

tokenizer = Tokenizer(method='bpe', vocab_size=5000)

text = "Tokenization is a fascinating process!"

tokens = tokenizer.encode(text)

print(tokens)

# Output: ['Token', '##ization', ' is', ' a', ' fascin', '##ating', ' pro', '##cess', '!']

Choosing the Right Technique

The best tokenization technique depends on your dataset, language, and the specific NLP task you are tackling. Consider experimenting to find what works optimally for your needs!

If you have any doubt/suggestion please feel free to ask and I will do my best to help or improve myself. Good-bye until next time.

Weight Pruning in Neural Networks

Leave a reply

Weight pruning is a technique used to reduce the size of a neural network by removing certain weights, typically those with small magnitudes, without significantly affecting the model’s performance. The idea is to identify and eliminate connections in the network that contribute less to the overall computation. This process helps in reducing the memory footprint and computational requirements during both training and inference.

Initial Model: Let’s consider a simple fully connected neural network with one hidden layer. The architecture might look like this:
Input layer (features) -> Hidden layer -> Output layer (predictions)

Training: The network is trained on a dataset to learn the mapping from inputs to outputs. During training, weights are adjusted through optimization algorithms like gradient descent to minimize the loss function.

Pruning: After training, weight pruning involves identifying and removing certain weights. A common criterion for pruning is to set a threshold, and weights whose absolute values fall below this threshold are pruned. For example, let’s say we have a weight matrix connecting the input layer to the hidden layer:

If we set a pruning threshold of 0.2, weights smaller than 0.2 in absolute value may be pruned. After pruning, the weight matrix might become:

Here, the connections with weights below 0.2 are pruned by setting those weights to zero.

Fine-tuning: Optionally, the pruned model can undergo fine-tuning to recover any loss in accuracy caused by pruning. During fine-tuning, the remaining weights may be adjusted to compensate for the pruned connections.

Weight pruning is an effective method for model compression, reducing the number of parameters in a neural network and making it more efficient for deployment in resource-constrained environments.

If you have any doubt/suggestion please feel free to ask and I will do my best to help or improve myself. Good-bye until next time.

Unleashing the Power of Gelu Activation: Exploring Its Uses, Applications, and Implementation in Python

Leave a reply

Introduction

In the field of deep learning, activation functions play a crucial role in introducing non-linearity to neural networks, enabling them to model complex relationships. One such activation function that has gained popularity is the Gelu activation function. Gelu stands for Gaussian Error Linear Unit, and it offers a smooth and continuous non-linear transformation. In this blog post, we will dive into the world of Gelu activation, its applications, the formula behind it, and how to implement it in Python.

Understanding Gelu Activation

The Gelu activation function was introduced in 2016 by Dan Hendrycks and Kevin Gimpel as an alternative to other popular activation functions such as ReLU (Rectified Linear Unit). Gelu is known for its ability to capture a wide range of non-linearities while maintaining smoothness and differentiability.

Formula and Characteristics

The Gelu activation function is defined mathematically as follows:

Gelu(x) =

The key characteristics of the Gelu activation function are as follows:

Range: Gelu activation outputs values in the range [0, +inf).
Differentiability: Gelu is a smooth function and possesses derivatives at all points.
Monotonicity: Gelu is a monotonically increasing function, making it suitable for gradient-based optimization algorithms.
Gaussian Approximation: Gelu approximates the cumulative distribution function (CDF) of a standard normal distribution.

Applications of Gelu Activation: Gelu activation has found applications in various domains, including:

Natural Language Processing (NLP): Gelu has shown promising results in NLP tasks such as sentiment analysis, machine translation, and text generation.
Computer Vision: Gelu activation can be used in convolutional neural networks (CNNs) for image classification, object detection, and semantic segmentation tasks.
Recommendation Systems: Gelu activation can enhance the performance of recommendation models by introducing non-linearities and capturing complex user-item interactions.

Implementing Gelu Activation in Python

Let’s see how we can implement the Gelu activation function in Python:

import torch
import torch.nn as nn
import math

class Gelu(nn.Module):
    def __init__(self):
        super(Gelu, self).__init__()

    def forward(self, x):
        return 0.5 * x * (1 + torch.tanh(math.sqrt(2 / math.pi) * (x + 0.044715 * torch.pow(x, 3))))

# Example usage
gelu = Gelu()
input = torch.randn(1, 10)  # Example input tensor
output = gelu(input)
print(output)

import torch

import torch.nn as nn

import math

class Gelu(nn.Module):

def __init__(self):

super(Gelu, self).__init__()

def forward(self, x):

return 0.5 * x * (1 + torch.tanh(math.sqrt(2 / math.pi) * (x + 0.044715 * torch.pow(x, 3))))

# Example usage

gelu = Gelu()

input = torch.randn(1, 10) # Example input tensor

output = gelu(input)

print(output)

Comparison of Gelu and ReLU Activation Functions

Formula:
- ReLU: ReLU(x) = max(0, x)
- Gelu: Gelu(x) = 0.5x * (1 + tanh(sqrt(2/pi) * (x + 0.044715 * x^3)))
Range:
- ReLU: ReLU outputs values in the range [0, +inf).
- Gelu: Gelu also outputs values in the range [0, +inf).
Smoothness and Continuity:
- ReLU: ReLU is a piecewise linear function and non-differentiable at x=0.
- Gelu: Gelu is a smooth and continuous function, ensuring differentiability at all points.
Monotonicity:
- ReLU: ReLU is a piecewise linear function, which means it is monotonically increasing for x > 0.
- Gelu: Gelu is a monotonically increasing function, making it suitable for gradient-based optimization algorithms.
Non-linearity:
- ReLU: ReLU introduces non-linearity by mapping negative values to 0 and preserving positive values unchanged.
- Gelu: Gelu introduces non-linearity through a combination of linear and non-linear transformations, capturing a wider range of non-linearities.
Performance:
- ReLU: ReLU has been widely used due to its simplicity and computational efficiency. However, it suffers from the “dying ReLU” problem where neurons can become inactive (outputting 0) and may not recover during training.
- Gelu: Gelu has shown promising performance in various tasks, including NLP and computer vision, and it addresses the “dying ReLU” problem by maintaining non-zero gradients for all inputs.
Applicability:
- ReLU: ReLU is commonly used in hidden layers of deep neural networks and has been successful in image classification and computer vision tasks.
- Gelu: Gelu has gained popularity in natural language processing (NLP) tasks, such as sentiment analysis and text generation, where capturing complex non-linear relationships is crucial.

Conclusion

Gelu activation offers a powerful tool for introducing non-linearity to neural networks, making them capable of modeling complex relationships. Its smoothness, differentiability, and wide range of applications make it an attractive choice in various domains, including NLP, computer vision, and recommendation systems. By implementing Gelu activation in Python, researchers and practitioners can leverage its potential and explore its benefits in their own deep learning projects. So go ahead, unleash the power of Gelu and take your models to the next level!

If you have any doubt/suggestion please feel free to ask and I will do my best to help or improve myself. Good-bye until next time.

BLEU Score – Bilingual Evaluation Understudy

Leave a reply

Introduction

The BLEU score, which stands for Bilingual Evaluation Understudy, is a metric commonly used to evaluate the quality of machine-generated translations compared to human translations. It measures the similarity between the machine-generated translation and one or more reference translations, assigning a numerical score between 0 and 1. The higher the BLEU score, the closer the machine translation is to the reference translations, indicating better translation quality. BLEU score takes into account factors such as n-gram precision and brevity penalty, providing a useful quantitative measure for comparing different translation systems or assessing improvements in machine translation over time. Don’t worry, we will discuss these terms as we go along with the blog.

Precision

Input Sentence: “Hay un tigre en el bosque”
Human Reference: “There is a tiger in the woods”

Lets assume machine translated output is: “the the the the the”
Accuracy of the machine-generated translation compared to the reference translations can be calculated using precision. Precision basically checks for each word in generated output if it is present in reference sentence or not. So in the given example it will be 5/5. It gives high value even the machine translated output is far away from reference sentence. There comes modified precision. In modified precision we calculate the maximum frequency of word present in the reference sentence. Which will compute to 1/5. This one was for unigram (one word at a time). Similarly it is calculated for n-gram.

Formula

The formula for BLEU score with brevity penalty is as follows:

BLEU = BP * exp(sum(n-gram precision) / N)

Where:

BP (Brevity Penalty) is a penalty term that adjusts the BLEU score based on the brevity of the machine generated translation compared to the reference translations.
n-gram precision is the precision of n-grams (substrings of length n) in the machine generated translation, which is the count of n-gram matches between the machine generated and reference translations divided by the count of n-grams in the machine generated translation.
N is the maximum n-gram order considered in the calculation (typically 4).

The brevity penalty term BP is calculated as:

BP = 1, if c > r
BP = exp(1 – r/c), if c ≤ r

Where:

c is the length (in words) of the machine generated translation.
r is the length (in words) of the closest reference translation.

In this formula, the brevity penalty is applied to adjust the BLEU score based on the difference in length between the candidate and reference translations. If the candidate translation is shorter than the reference, the penalty term encourages longer translations, and if the candidate translation is longer, it discourages excessively long translations.

Implementation

import nltk
nltk.download('punkt')
import math
from collections import Counter

def tokenize(sentence):
    return nltk.word_tokenize(sentence)

def calculate_ngram(candidate, n):
    ngrams = []
    for i in range(len(candidate)-n+1):
        ngram = tuple(candidate[i:i+n])
        ngrams.append(ngram)
    return ngrams

def calculate_precision(candidate, references, n):
    candidate_ngrams = calculate_ngram(candidate, n)
    reference_ngrams = [calculate_ngram(ref, n) for ref in references]

    candidate_counter = Counter(candidate_ngrams)
    reference_counters = [Counter(ref) for ref in reference_ngrams]

    clipped_counts = dict()
    for ngram, count in candidate_counter.items():
        max_reference_count = max(ref_counter[ngram] for ref_counter in reference_counters)
        clipped_counts[ngram] = min(count, max_reference_count)

    numerator = sum(clipped_counts.values())
    denominator = max(1, sum(candidate_counter.values()))

    precision = numerator / denominator
    return precision

def calculate_bleu(candidate, references, weights):
    candidate_tokens = tokenize(candidate)
    reference_tokens = [tokenize(ref) for ref in references]

    precisions = []
    for n in range(1, len(weights) + 1):
        precision = calculate_precision(candidate_tokens, reference_tokens, n)
        precisions.append(precision)

    # Handling NaN or infinite values in precision
    precisions = [p if not math.isnan(p) and p != 0.0 else 1e-10 for p in precisions]

    geo_mean = math.exp(sum((w * math.log(p) for w, p in zip(weights, precisions))) / len(weights))
    brevity_penalty = min(1.0, len(candidate_tokens) / min(len(ref) for ref in reference_tokens))

    bleu = brevity_penalty * geo_mean
    return bleu

# Example usage
candidate = "The cat is on the mat"
references = ["There is a cat on the mat", "The mat has a cat"]
weights = [0.25, 0.25, 0.25, 0.25]

bleu_score = calculate_bleu(candidate, references, weights)
print("BLEU score:", bleu_score)

import nltk

nltk.download('punkt')

import math

from collections import Counter

def tokenize(sentence):

return nltk.word_tokenize(sentence)

def calculate_ngram(candidate, n):

ngrams = []

for i in range(len(candidate)-n+1):

ngram = tuple(candidate[i:i+n])

ngrams.append(ngram)

return ngrams

def calculate_precision(candidate, references, n):

candidate_ngrams = calculate_ngram(candidate, n)

reference_ngrams = [calculate_ngram(ref, n) for ref in references]

candidate_counter = Counter(candidate_ngrams)

reference_counters = [Counter(ref) for ref in reference_ngrams]

clipped_counts = dict()

for ngram, count in candidate_counter.items():

max_reference_count = max(ref_counter[ngram] for ref_counter in reference_counters)

clipped_counts[ngram] = min(count, max_reference_count)

numerator = sum(clipped_counts.values())

denominator = max(1, sum(candidate_counter.values()))

precision = numerator / denominator

return precision

def calculate_bleu(candidate, references, weights):

candidate_tokens = tokenize(candidate)

reference_tokens = [tokenize(ref) for ref in references]

precisions = []

for n in range(1, len(weights) + 1):

precision = calculate_precision(candidate_tokens, reference_tokens, n)

precisions.append(precision)

# Handling NaN or infinite values in precision

precisions = [p if not math.isnan(p) and p != 0.0 else 1e-10 for p in precisions]

geo_mean = math.exp(sum((w * math.log(p) for w, p in zip(weights, precisions))) / len(weights))

brevity_penalty = min(1.0, len(candidate_tokens) / min(len(ref) for ref in reference_tokens))

bleu = brevity_penalty * geo_mean

return bleu

# Example usage

candidate = "The cat is on the mat"

references = ["There is a cat on the mat", "The mat has a cat"]

weights = [0.25, 0.25, 0.25, 0.25]

bleu_score = calculate_bleu(candidate, references, weights)

print("BLEU score:", bleu_score)

Here’s a breakdown of the code:

Tokenization:
- The tokenize function splits a given sentence into individual words or tokens.
N-gram Calculation:
- The calculate_ngram function takes a list of tokens (words) and an integer n as input, and it returns a list of n-grams (contiguous sequences of n tokens) from the input list.
Precision Calculation:
- The calculate_precision function computes the precision score for a given candidate sentence in comparison to one or more reference sentences. It uses n-grams for this calculation.
- It counts the occurrences of n-grams in both the candidate and reference sentences and computes a precision value.
BLEU Calculation:
- The calculate_bleu function takes a candidate sentence, a list of reference sentences, and a list of weights as input.
- It tokenizes the input sentences, calculates precision for different n-gram sizes, and combines them using a weighted geometric mean.
- The BLEU score is a combination of precision values for different n-gram sizes, and the weights are used to assign importance to each n-gram size.
Example Usage:
- An example is provided at the end, where a candidate sentence (“The cat is on the mat”) is compared to two reference sentences (“There is a cat on the mat” and “The mat has a cat”).
- The weights for different n-gram sizes are set to equal values (0.25 each), and the BLEU score is calculated using the calculate_bleu function.
- The final BLEU score is printed out.

If you have any doubt/suggestion please feel free to ask and I will do my best to help or improve myself. Good-bye until next time.

Supervised And Unsupervised Learning

Leave a reply

With the advancement in the field of artificial intelligence, we are able to solve the problems of different fields. Some of them you may be using in your daily life. The two major categorization in this field are supervised and unsupervised learning.

You get a bunch of e-mails with information about in which category they fall either “spam” or “not spam” and then you train a model to categorize a new e-mail. This type of learning is called supervised learning.

You are invited to a party and met totally strangers. Now you will classify them using unsupervised learning (no prior knowledge) and this classification can be on the basis of gender, age group, dressing, educational qualification or whatever way you would like. This is unsupervised learning since you are exploring the data and finding groups by exploration.

In supervised learning, we are going to teach the computer how to do something while in unsupervised we let the computer to do itself. Does it make sense? Let’s look into this using some examples.

Supervised Learning

Let’s say we need to predict an image, whether it is “cat” or not.

To make computers learn this type of problem, we need to provide them a dataset having both input image and their corresponding labels i.e. is it a cat or not. So, if the dataset is having output label in it, the problem can be classified as supervised learning problem.

A supervised leaning follow this pattern: input -> hypothesis -> output

Where inputs are our training data for example images of “cat”, hypothesis can be one of the machine learning algorithm for example SVM and Decision Trees and output is corresponding labels for example it is “cat” or “not cat”.

A Supervised learning can be further classified into Classification and Regression.

Classification: In classification problems we predict results in a discrete output. Let say predicting an email as “spam” or “non spam”.

Regression: In regression problems we need to predict results within a continuous output. Let say predicting house prices.

Unsupervised Learning

Let say we are having bunch of T-shirts.

Also we do not have corresponding labels to T-shirts to which class it belongs. Now in unsupervised learning, model will discover information from this data. Let say model discovers a feature as t-shirt sizes and cluster these t-shirts according to their sizes into three categories small, medium and large.

So in unsupervised learning problems output labels are not provided and computer is restricted to find some hidden structure and group data according to that.

Unsupervised learning is further classified into Clustering and association problems.

Clustering: In clustering, algorithm form groups inside the data. For example, grouping news according to its headline as google news does.

Association: In association, algorithm discovers an interesting relationship between data. For example, recommending a similar product to a user on an e-commerce website.

Summary

Supervised learning works on labeled training data while unsupervised works on unlabeled training data.
Unsupervised learning explores the data and finds interesting features.
Supervised learning as the name suggests has a supervisor.
Unsupervised learning uses algorithms like K-means, hierarchical clustering while supervised learning uses algorithms like SVM, linear regression, logistic regression, etc.
Supervised learning can be applied in the field of risk assessment, image classification, fraud detection, object detection, etc.
Unsupervised learning can be applied in the field of delivery store optimization, semantic clustering, market basket analysis, etc.

Hope you enjoy reading.

If you have any doubt/suggestion please feel free to ask and I will do my best to help or improve myself. Good-bye until next time.

TheAILearner

Mastering Artificial Intelligence

Category Archives: Machine Learning

Advanced Tokenization Techniques in NLP

Weight Pruning in Neural Networks

Unleashing the Power of Gelu Activation: Exploring Its Uses, Applications, and Implementation in Python

Introduction

Understanding Gelu Activation

Formula and Characteristics

Gelu(x) =

Implementing Gelu Activation in Python

Comparison of Gelu and ReLU Activation Functions

Conclusion

BLEU Score – Bilingual Evaluation Understudy

Introduction

Precision

Formula

Implementation

Supervised And Unsupervised Learning

Supervised Learning

Unsupervised Learning

Summary