Information Theory: Entropy and Information Gain

Information Theory: Entropy and Information Gain

What Is Information?

In everyday language, information means facts or knowledge. In information theory, it's more precise: information is the reduction of uncertainty.

Imagine you're texting a friend who's in either Delhi, Mumbai, or Bangalore (equal probability, 1/3 each). If they text "I'm in Delhi," you gain certainty. How much information did that message convey? Information theory quantifies exactly this.

Entropy: Measuring Uncertainty

Shannon entropy measures the average uncertainty or "surprisingness" of a random variable:

H(X) = -Σᵢ p(xᵢ) log₂(p(xᵢ))

Intuition: Surprise is inversely related to probability. If something happens with probability 1 (certainty), log(1) = 0, no surprise. If something happens with probability 1/1000, log(1/1000) is large, maximum surprise. Average surprise across all possibilities is entropy.

Example: A fair coin has H = -[0.5 log(0.5) + 0.5 log(0.5)] = 1 bit. A coin rigged to always be heads has H = 0 bits (no uncertainty).

Why base 2? Each bit of information answers one yes/no question. Base 2 logarithm literally counts how many binary questions you need to ask to resolve the uncertainty.

Information Gain: How Much Does a Feature Tell Us?

This is the core of building decision trees. Before seeing any features, you have some uncertainty about the target class (entropy). After seeing a feature, uncertainty decreases. The decrease is information gain:

IG(Y, X) = H(Y) - Σᵥ [|Xᵥ|/|X| · H(Y|X=v)]

Information Gain = Original Entropy - Weighted Average of New Entropy

Example: Predicting if someone likes spicy food:

• Dataset: 60% like spicy, 40% don't. Original entropy H(Y) = 0.971 bits.
• You split by region: North India (80% like spicy, 20% don't). South India (40% like spicy, 60% don't).
• After split: Weighted entropy = 0.5 × H(North) + 0.5 × H(South)
• Information gain = 0.971 - (weighted entropy) ≈ 0.3 bits. The region feature reduced uncertainty!

Decision trees greedily choose splits that maximize information gain at each node. This is why ID3 and C4.5 algorithms work.

Kullback-Leibler Divergence: Comparing Distributions

Sometimes you want to know how different two probability distributions are. KL divergence measures this:

DKL(P||Q) = Σᵢ p(xᵢ) log[p(xᵢ)/q(xᵢ)]

Intuition: Imagine you have two probability distributions over outcomes. DKL tells you how much "extra surprise" you'd experience if you mistakenly used distribution Q when the truth is P.

Properties:

• DKL(P||Q) = 0 if and only if P = Q
• DKL(P||Q) ≠ DKL(Q||P) — it's asymmetric!
• DKL(P||Q) ≥ 0 always

In machine learning, cross-entropy loss (which we saw earlier) is H(P) + DKL(P||Q). Minimizing cross-entropy means minimizing DKL, i.e., making your model's predictions Q match the true distribution P.

Mutual Information: Variables Talking to Each Other

Mutual information measures how much knowing one variable tells you about another:

I(X; Y) = H(X) + H(Y) - H(X, Y)

or equivalently:

I(X; Y) = DKL[P(X,Y) || P(X)P(Y)]

High mutual information means X and Y are dependent. Low mutual information means they're nearly independent. This is crucial for feature selection — choose features with high mutual information with the target!

The Connection to Decision Tree Splits

Why do decision trees split on the feature with highest information gain?

Because that feature maximizes I(Y; Feature). It's the feature that tells you the most about the target. Mathematically:

IG = I(Y; Feature) = H(Y) - H(Y|Feature)

This is why information-theoretic approaches to feature selection are so powerful. They measure statistical dependence, not just linear correlation.

Application: Spam Detection

In email spam filtering, you compute the information gain for each word:

• Does seeing "BUY NOW" increase your certainty it's spam? High IG → split on this word.
• Does seeing "the" help? Low IG → ignore this word.

This is exactly how Naive Bayes and decision tree-based spam filters work.

For IIT-JEE and competitive exams in India: Information theory is elegant mathematics. It appears in GATE, JEE Advanced physics problems about entropy, and computer science problems about data transmission. Understanding information gain shows you grasp both the mathematics and its practical power.

---

Engineering Perspective: Information Theory: Entropy and Information Gain

When you sit for a technical interview at any top company — whether it is Google, Microsoft, Amazon, or an Indian unicorn like Zerodha, Razorpay, or Meesho — they are not just testing whether you know the definition of information theory: entropy and information gain. They are testing whether you can APPLY these concepts to solve novel problems, whether you understand the TRADEOFFS involved, and whether you can reason about system behaviour at scale.

This chapter approaches information theory: entropy and information gain with that depth. We will examine not just what it is, but why it works the way it does, what alternatives exist and when to choose each one, and how real systems use these ideas in production. ISRO's mission control systems, India's UPI payment network handling 10 billion transactions per month, Aadhaar's biometric authentication serving 1.4 billion identities — all rely on the principles we discuss here.

Transformer Architecture: The Engine Behind GPT and Modern AI

The Transformer architecture, introduced in the landmark 2017 paper "Attention Is All You Need," revolutionised NLP and eventually all of deep learning. Here is the core mechanism:

# Self-Attention Mechanism (simplified)
import numpy as np

def self_attention(Q, K, V, d_k):
    """
    Q (Query): What am I looking for?
    K (Key):   What do I contain?
    V (Value): What do I actually provide?
    d_k:       Dimension of keys (for scaling)
    """
    # Step 1: Compute attention scores
    scores = np.matmul(Q, K.T) / np.sqrt(d_k)

    # Step 2: Softmax to get probabilities
    attention_weights = softmax(scores)

    # Step 3: Weighted sum of values
    output = np.matmul(attention_weights, V)
    return output

# Multi-Head Attention: Run multiple attention heads in parallel
# Each head learns different relationships:
# Head 1: syntactic relationships (subject-verb agreement)
# Head 2: semantic relationships (word meanings)
# Head 3: positional relationships (word order)
# Head 4: coreference (pronoun → noun it refers to)

The key insight of self-attention is that every token can attend to every other token simultaneously (unlike RNNs which process sequentially). This parallelism enables efficient GPU training. The computational complexity is O(n²·d) where n is sequence length and d is dimension, which is why context windows are a major engineering challenge.

State-of-the-art developments include: sparse attention (reducing O(n²) to O(n·√n)), mixture of experts (MoE — activating only a subset of parameters per input), retrieval-augmented generation (RAG — grounding responses in external documents), and constitutional AI (alignment through principles rather than RLHF alone). Indian researchers at institutions like IIT Bombay, IISc Bangalore, and Microsoft Research India are actively contributing to these frontiers.

India's Scale Challenges: Engineering for 1.4 Billion

Building technology for India presents unique engineering challenges that make it one of the most interesting markets in the world. UPI handles 10 billion transactions per month — more than all credit card transactions in the US combined. Aadhaar authenticates 100 million identities daily. Jio's network serves 400 million subscribers across 22 telecom circles. Hotstar streamed IPL to 50 million concurrent viewers — a world record. Each of these systems must handle India's diversity: 22 official languages, 28 states with different regulations, massive urban-rural connectivity gaps, and price-sensitive users expecting everything to work on ₹7,000 smartphones over patchy 4G connections. This is why Indian engineers are globally respected — if you can build systems that work in India, they will work anywhere.

---

Advanced Algorithms: Dynamic Programming and Graph Theory

Dynamic Programming (DP) solves complex problems by breaking them into overlapping subproblems. This is a favourite in competitive programming and interviews:

# Longest Common Subsequence — classic DP problem
# Used in: diff tools, DNA sequence alignment, version control

def lcs(s1, s2):
    m, n = len(s1), len(s2)
    dp = [[0] * (n + 1) for _ in range(m + 1)]

    for i in range(1, m + 1):
        for j in range(1, n + 1):
            if s1[i-1] == s2[j-1]:
                dp[i][j] = dp[i-1][j-1] + 1
            else:
                dp[i][j] = max(dp[i-1][j], dp[i][j-1])

    return dp[m][n]

# Dijkstra's Shortest Path — used by Google Maps!
import heapq

def dijkstra(graph, start):
    dist = {node: float('inf') for node in graph}
    dist[start] = 0
    pq = [(0, start)]  # (distance, node)

    while pq:
        d, u = heapq.heappop(pq)
        if d > dist[u]:
            continue
        for v, weight in graph[u]:
            if dist[u] + weight < dist[v]:
                dist[v] = dist[u] + weight
                heapq.heappush(pq, (dist[v], v))

    return dist

# Real use: Google Maps finding shortest route from
# Connaught Place to India Gate, considering traffic weights

Dijkstra's algorithm is how mapping applications find optimal routes. When you ask Google Maps to navigate from Mumbai to Pune, it models the road network as a weighted graph (intersections are nodes, roads are edges, travel time is weight) and runs a variant of Dijkstra's algorithm. Indian highways, city roads, and even railway networks can all be modelled this way. IRCTC's route optimisation for trains across 13,000+ stations uses graph algorithms at its core.

Research Frontiers and Open Problems in Information Theory: Entropy and Information Gain

Beyond production engineering, information theory: entropy and information gain connects to active research frontiers where fundamental questions remain open. These are problems where your generation of computer scientists will make breakthroughs.

Quantum computing threatens to upend many of our assumptions. Shor's algorithm can factor large numbers efficiently on a quantum computer, which would break RSA encryption — the foundation of internet security. Post-quantum cryptography is an active research area, with NIST standardising new algorithms (CRYSTALS-Kyber, CRYSTALS-Dilithium) that resist quantum attacks. Indian researchers at IISER, IISc, and TIFR are contributing to both quantum computing hardware and post-quantum cryptographic algorithms.

AI safety and alignment is another frontier with direct connections to information theory: entropy and information gain. As AI systems become more capable, ensuring they behave as intended becomes critical. This involves formal verification (mathematically proving system properties), interpretability (understanding WHY a model makes certain decisions), and robustness (ensuring models do not fail catastrophically on edge cases). The Alignment Research Center and organisations like Anthropic are working on these problems, and Indian researchers are increasingly contributing.

Edge computing and the Internet of Things present new challenges: billions of devices with limited compute and connectivity. India's smart city initiatives and agricultural IoT deployments (soil sensors, weather stations, drone imaging) require algorithms that work with intermittent connectivity, limited battery, and constrained memory. This is fundamentally different from cloud computing and requires rethinking many assumptions.

Finally, the ethical dimensions: facial recognition in public spaces (deployed in several Indian cities), algorithmic bias in loan approvals and hiring, deepfakes in political campaigns, and data sovereignty questions about where Indian citizens' data should be stored. These are not just technical problems — they require CS expertise combined with ethics, law, and social science. The best engineers of the future will be those who understand both the technical implementation AND the societal implications. Your study of information theory: entropy and information gain is one step on that path.

Key Vocabulary

Here are important terms from this chapter that you should know:

🏗️ Architecture Challenge

Design the backend for India's election results system. Requirements: 10 lakh (1 million) polling booths reporting simultaneously, results must be accurate (no double-counting), real-time aggregation at constituency and state levels, public dashboard handling 100 million concurrent users, and complete audit trail. Consider: How do you ensure exactly-once delivery of results? (idempotency keys) How do you aggregate in real-time? (stream processing with Apache Flink) How do you serve 100M users? (CDN + read replicas + edge computing) How do you prevent tampering? (digital signatures + blockchain audit log) This is the kind of system design problem that separates senior engineers from staff engineers.

The Frontier

You now have a deep understanding of information theory: entropy and information gain — deep enough to apply it in production systems, discuss tradeoffs in system design interviews, and build upon it for research or entrepreneurship. But technology never stands still. The concepts in this chapter will evolve: quantum computing may change our assumptions about complexity, new architectures may replace current paradigms, and AI may automate parts of what engineers do today.

What will NOT change is the ability to think clearly about complex systems, to reason about tradeoffs, to learn quickly and adapt. These meta-skills are what truly matter. India's position in global technology is only growing stronger — from the India Stack to ISRO to the startup ecosystem to open-source contributions. You are part of this story. What you build next is up to you.

Crafted for Class 10–12 • Machine Learning • Aligned with NEP 2020 & CBSE Curriculum