Skip to main content

Cosine Similarity vs. Cosine Distance Explained with PyTorch Examples | Applications in Deep Learning

1. What is Cosine Similarity?

Cosine similarity is a metric used to measure the similarity in direction between two vectors, regardless of their magnitude. It is widely used in tasks like text similarity analysis, sentence embedding comparison, and image embedding evaluation. The key idea is that the metric focuses on the angle (or direction) rather than the vector length.

Formula:

cos_sim(A, B) = (A · B) / (||A|| * ||B||)

Here, A and B are input vectors, · denotes the dot product, and ||A|| is the norm (magnitude) of vector A. The cosine similarity value ranges from -1 to 1. A value close to 1 means the vectors are pointing in a similar direction, while a value close to -1 indicates they are pointing in opposite directions.

2. What is Cosine Distance?

Cosine distance is derived from cosine similarity and represents the dissimilarity between vectors. It is defined as follows:

cos_dist(A, B) = 1 - cos_sim(A, B)
    

The cosine distance ranges from 0 to 2. A value closer to 0 means the two vectors are more similar. This form is often used in clustering and distance-based models.

3. Applications in Deep Learning / Machine Learning

  • Natural Language Processing (NLP): Compare similarity between sentence embeddings (e.g., semantic search, FAQ retrieval).
  • Computer Vision: Measure similarity between image embeddings (e.g., image retrieval, visual clustering).
  • Recommendation Systems: Calculate similarity between users and items to improve personalized recommendations.
  • Clustering Algorithms: Use cosine distance as a metric to determine inter-cluster similarity.

4. Python Implementation from Scratch

import math

def cosine_similarity(a, b):
    dot_product = sum(x*y for x, y in zip(a, b))
    norm_a = math.sqrt(sum(x*x for x in a))
    norm_b = math.sqrt(sum(x*x for x in b))
    return dot_product / (norm_a * norm_b)

def cosine_distance(a, b):
    return 1 - cosine_similarity(a, b)

# Example
vec1 = [1, 2, 3]
vec2 = [4, 5, 6]

sim = cosine_similarity(vec1, vec2)
dist = cosine_distance(vec1, vec2)

print(f"Cosine Similarity: {sim:.4f}")
print(f"Cosine Distance: {dist:.4f}")

Output:

Cosine Similarity: 0.9746
Cosine Distance: 0.0254

 

5. PyTorch-Based Implementation Example

import torch
import torch.nn.functional as F

def cosine_similarity_torch(x, y):
    x = F.normalize(x, dim=-1)
    y = F.normalize(y, dim=-1)
    return torch.sum(x * y, dim=-1)

def cosine_distance_torch(x, y):
    return 1 - cosine_similarity_torch(x, y)

# Example
vec1 = torch.tensor([1.0, 2.0, 3.0])
vec2 = torch.tensor([4.0, 5.0, 6.0])

sim = cosine_similarity_torch(vec1, vec2)
dist = cosine_distance_torch(vec1, vec2)

print("PyTorch Cosine Similarity:", sim.item())
print("PyTorch Cosine Distance:", dist.item())

Output:

PyTorch Cosine Similarity: 0.9746317863464355
PyTorch Cosine Distance: 0.025368213653564453

 

6. Summary

  • Cosine Similarity measures how similar two vectors are in terms of direction and ranges from -1 to 1.
  • Cosine Distance is derived by subtracting cosine similarity from 1, making it suitable for use in distance-based algorithms.
  • It can be easily implemented using libraries such as PyTorch, NumPy, or Scikit-learn.
  • Widely used in sentence embedding comparison, image search, clustering, and recommendation systems in deep learning and machine learning workflows.

Comments

Popular

How to Save and Retrieve a Vector Database using LangChain, FAISS, and Gemini Embeddings

How to Save and Retrieve a Vector Database using LangChain, FAISS, and Gemini Embeddings Efficient storage and retrieval of vector databases is foundational for building intelligent retrieval-augmented generation (RAG) systems using large language models (LLMs). In this guide, we’ll walk through a professional-grade Python implementation that utilizes LangChain with FAISS and Google Gemini Embeddings to store document embeddings and retrieve similar information. This setup is highly suitable for advanced machine learning (ML) and deep learning (DL) engineers who work with semantic search and retrieval pipelines. Why Vector Databases Matter in LLM Applications Traditional keyword-based search systems fall short when it comes to understanding semantic meaning. Vector databases store high-dimensional embeddings of text data, allowing for approximate nearest-neighbor (ANN) searches based on semantic similarity. These capabilities are critical in applications like: Question Ans...

Building an MCP Agent with UV, Python & mcp-use

Model Context Protocol (MCP) is an open protocol designed to enable AI agents to interact with external tools and data in a standardized way. MCP is composed of three components: server , client , and host . MCP host The MCP host acts as the interface between the user and the agent   (such as Claude Desktop or IDE) and plays the role of connecting to external tools or data through MCP clients and servers. Previously, Anthropic’s Claude Desktop was introduced as a host, but it required a separate desktop app, license, and API key management, leading to dependency on the Claude ecosystem.   mcp-use is an open-source Python/Node package that connects LangChain LLMs (e.g., GPT-4, Claude, Groq) to MCP servers in just six lines of code, eliminating dependencies and supporting multi-server and multi-model setups. MCP Client The MCP client manages the MCP protocol within the host and is responsible for connecting to MCP servers that provide the necessary functions for the ...

RF-DETR: Overcoming the Limitations of DETR in Object Detection

RF-DETR (Region-Focused DETR), proposed in April 2025, is an advanced object detection architecture designed to overcome fundamental drawbacks of the original DETR (DEtection TRansformer) . In this technical article, we explore RF-DETR's contributions, architecture, and how it compares with both DETR and the improved model D-FINE . We also provide experimental benchmarks and discuss its real-world applicability. RF-DETR Architecture diagram for object detection Limitations of DETR DETR revolutionized object detection by leveraging the Transformer architecture, enabling end-to-end learning without anchor boxes or NMS (Non-Maximum Suppression). However, DETR has notable limitations: Slow convergence, requiring heavy data augmentation and long training schedules Degraded performance on low-resolution objects and complex scenes Lack of locality due to global self-attention mechanisms Key Innovations in RF-DETR RF-DETR intr...