A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Capsule Networks

Research Depth 96 in the knowledge graph ☐ I know this ☆ Set as goal
656prerequisites beneath it
See this on the map →
Convolutional Neural NetworksNeural Network Fundamentals→
capsule-network capsnet routing

Core Idea

Capsule networks replace scalar neurons with vector-valued capsules encoding domain-specific properties (position, rotation). Routing-by-agreement algorithms dynamically route information based on capsule predictions. CapsNets improve viewpoint equivariance and reduce data requirements compared to CNNs, though computation is higher.

Explainer

From your study of convolutional neural networks, you know that CNNs detect features hierarchically — edges in early layers, textures and parts in middle layers, whole objects in later layers. But CNNs have a fundamental limitation rooted in their use of max pooling: they detect whether a feature is present somewhere in a region but discard precise information about where it is, what orientation it has, and how it relates spatially to other features. A CNN trained on faces can detect two eyes and a mouth, but after pooling, it has limited ability to verify that they are in the correct spatial arrangement. A jumbled face with eyes below the mouth might still activate the same "face" neurons. Capsule networks were designed to fix this by preserving spatial relationships between parts.

The key architectural change is replacing scalar-output neurons with capsules — small groups of neurons whose output is a vector rather than a single number. The vector's length represents the probability that a particular entity (an edge, a nose, a face) exists, while its orientation encodes instantiation parameters: the entity's position, size, rotation, texture, and other properties. For example, a "mouth capsule" might output a vector whose length indicates confidence that a mouth is present, while the direction encodes the mouth's position, width, and tilt. This is fundamentally more expressive than a CNN neuron that can only say "mouth detected with 0.92 confidence."

The mechanism connecting capsules across layers is routing by agreement, which replaces the fixed pooling operations in CNNs. Each lower-level capsule (say, a "nose" capsule) makes a prediction about what the higher-level capsule (say, a "face" capsule) should look like, based on the spatial relationship it has learned. If the nose is detected at position (x, y) with a certain orientation, it predicts the face should be at a particular position and orientation. Multiple part-capsules all make their own predictions about the whole, and if these predictions agree — the nose, eyes, and mouth all predict a face in roughly the same place and pose — the routing algorithm strengthens those connections and activates the face capsule. Disagreement (parts predicting inconsistent wholes) weakens the connections. This is fundamentally different from pooling: instead of discarding spatial information, routing by agreement uses it to verify geometric consistency.

The practical consequence is improved viewpoint equivariance. When an object rotates, all part capsules update their instantiation parameters in a geometrically consistent way, and the routing algorithm still achieves agreement — the face is recognized regardless of pose. CNNs achieve viewpoint tolerance mainly through brute-force data augmentation (training on many rotated examples), while capsule networks achieve it structurally. This means CapsNets can generalize to novel viewpoints from fewer training examples. The tradeoff is computational cost: routing by agreement requires multiple iterative passes between layers, making capsule networks significantly slower to train than equivalently sized CNNs. This computational overhead, combined with difficulty scaling to large images, has limited CapsNet adoption in practice, though the ideas continue to influence research on geometric deep learning and equivariant architectures.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Probability Density Functions and Continuous Distributions → Cumulative Distribution Functions → Continuous Random Variables → Probability Density Functions → Expected Value → Linear Regression in Machine Learning → Neural Network Fundamentals → Backpropagation Algorithm → Multilayer Perceptrons (MLPs) → Activation Functions in Neural Networks → Convolutional Neural Networks → Capsule Networks

Longest path: 97 steps · 656 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.