Autoencoders: Compression and Generation

Autoencoders: Compression and Generation

Autoencoders learn to compress data into a lower-dimensional representation (encoding) and reconstruct it (decoding). They're unsupervised learners used for dimensionality reduction, feature learning, and anomaly detection. Variational Autoencoders (VAEs) add probabilistic structure enabling generation of new data. Understanding autoencoders reveals how neural networks can learn meaningful representations.

Basic Architecture: Encoder-Decoder Framework

An autoencoder has two parts: encoder compresses input x to latent code z, decoder reconstructs x from z. The network is trained to minimize reconstruction error: ||x - decode(encode(x))||². The bottleneck (narrow latent layer) forces the network to learn essential features. Deeper, wider networks can memorize; proper architecture design ensures meaningful compression.

import numpy as np
import torch
import torch.nn as nn
from torch.utils.data import DataLoader, TensorDataset
import matplotlib.pyplot as plt

# Simple autoencoder for MNIST-like data
class Autoencoder(nn.Module):
    def __init__(self, latent_dim=32):
        super(Autoencoder, self).__init__()

        # Encoder
        self.encoder = nn.Sequential(
            nn.Linear(784, 256),
            nn.ReLU(),
            nn.Linear(256, 128),
            nn.ReLU(),
            nn.Linear(128, latent_dim)
        )

        # Decoder
        self.decoder = nn.Sequential(
            nn.Linear(latent_dim, 128),
            nn.ReLU(),
            nn.Linear(128, 256),
            nn.ReLU(),
            nn.Linear(256, 784),
            nn.Sigmoid()  # Output in [0, 1]
        )

    def encode(self, x):
        return self.encoder(x)

    def decode(self, z):
        return self.decoder(z)

    def forward(self, x):
        z = self.encode(x)
        recon = self.decode(z)
        return recon, z

# Generate synthetic data
torch.manual_seed(42)
X = torch.randn(1000, 784)
X = (X - X.min()) / (X.max() - X.min())  # Normalize to [0, 1]

# Train autoencoder
model = Autoencoder(latent_dim=32)
optimizer = torch.optim.Adam(model.parameters(), lr=0.001)
criterion = nn.MSELoss()

dataset = TensorDataset(X)
loader = DataLoader(dataset, batch_size=32, shuffle=True)

losses = []
for epoch in range(50):
    for batch in loader:
        x = batch[0]
        recon, z = model(x)
        loss = criterion(recon, x)

        optimizer.zero_grad()
        loss.backward()
        optimizer.step()

    losses.append(loss.item())
    if (epoch + 1) % 10 == 0:
        print(f"Epoch {epoch+1}: loss = {loss.item():.6f}")

# Visualize
fig, axes = plt.subplots(1, 3, figsize=(15, 4))

# Loss curve
axes[0].plot(losses, linewidth=2)
axes[0].set_xlabel('Epoch')
axes[0].set_ylabel('Reconstruction Loss')
axes[0].set_title('Training Loss')
axes[0].grid(True, alpha=0.3)

# Original vs reconstructed
with torch.no_grad():
    sample_idx = 0
    x_sample = X[sample_idx:sample_idx+1]
    recon, z = model(x_sample)

    axes[1].imshow(x_sample.numpy().reshape(28, 28), cmap='gray')
    axes[1].set_title('Original Image')
    axes[1].axis('off')

    axes[2].imshow(recon.numpy().reshape(28, 28), cmap='gray')
    axes[2].set_title('Reconstructed Image')
    axes[2].axis('off')

plt.tight_layout()
plt.show()

print(f"Latent dimension: 32, Original dimension: 784")
print(f"Compression ratio: {784/32:.1f}:1")

Variational Autoencoders: Probabilistic Generation

VAEs add probabilistic structure by modeling the latent distribution. Instead of mapping to a point z, the encoder outputs mean and variance of a Gaussian distribution. Samples are drawn from this distribution (reparameterization trick enables backprop). The loss combines reconstruction error and KL divergence (regularization): L = ||x - decode(z)||² + KL(N(μ,σ²) || N(0,I)).

import torch
import torch.nn as nn
import torch.nn.functional as F

class VariationalAutoencoder(nn.Module):
    def __init__(self, latent_dim=32):
        super(VariationalAutoencoder, self).__init__()

        # Encoder
        self.fc1 = nn.Linear(784, 256)
        self.fc_mu = nn.Linear(256, latent_dim)
        self.fc_logvar = nn.Linear(256, latent_dim)

        # Decoder
        self.fc3 = nn.Linear(latent_dim, 256)
        self.fc4 = nn.Linear(256, 784)

        self.latent_dim = latent_dim

    def encode(self, x):
        h = F.relu(self.fc1(x))
        mu = self.fc_mu(h)
        logvar = self.fc_logvar(h)
        return mu, logvar

    def reparameterize(self, mu, logvar):
        """Reparameterization trick: sample z ~ N(mu, exp(logvar))"""
        std = torch.exp(0.5 * logvar)
        eps = torch.randn_like(std)
        return mu + eps * std

    def decode(self, z):
        h = F.relu(self.fc3(z))
        return torch.sigmoid(self.fc4(h))

    def forward(self, x):
        mu, logvar = self.encode(x.view(-1, 784))
        z = self.reparameterize(mu, logvar)
        recon = self.decode(z)
        return recon, mu, logvar

    def loss_function(self, recon, x, mu, logvar, beta=1.0):
        # Reconstruction loss
        BCE = F.binary_cross_entropy(recon, x.view(-1, 784), reduction='sum')

        # KL divergence
        KLD = -0.5 * torch.sum(1 + logvar - mu.pow(2) - logvar.exp())

        # Total loss (beta controls KL weight)
        return BCE + beta * KLD, BCE, KLD

# Key property: VAEs can generate new samples
model = VariationalAutoencoder(latent_dim=32)

# Generate samples from standard normal
with torch.no_grad():
    z_random = torch.randn(16, 32)
    generated = model.decode(z_random)

print("VAE enables generation of new samples by sampling from latent distribution")
print(f"Generated shape: {generated.shape}")

Applications: Denoising and Anomaly Detection

Denoising autoencoders learn robust representations by training on corrupted data (with noisy input, clean target). Anomaly detection uses reconstruction error: normal samples reconstruct well; abnormal samples don't. Variational methods quantify uncertainty, useful for deciding detection thresholds.

Key Takeaways

• Autoencoders learn compressed representations through reconstruction loss.
• The bottleneck forces meaningful feature learning; larger networks can memorize.
• VAEs add probabilistic structure, enabling both compression and generation.
• The KL divergence term in VAE loss regularizes the latent distribution.
• Reconstruction error indicates normalcy; high error suggests anomalies.
• Denoising autoencoders learn robust features resistant to noise.

Engineering Perspective: Autoencoders: Compression and Generation

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 autoencoders: compression and generation. 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 autoencoders: compression and generation 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 Autoencoders: Compression and Generation

Beyond production engineering, autoencoders: compression and generation 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 autoencoders: compression and generation. 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 autoencoders: compression and generation 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 autoencoders: compression and generation — 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 • Deep Learning Architectures • Aligned with NEP 2020 & CBSE Curriculum