Hopfield networks ↔ Ising model
Energy function of the same form; memory retrieval as energy descent.
Why this level: Built deliberately on shared mathematics. It does not show that brains store memories this way.
Module 7 · suggested week 7
Recognise common structures without manufacturing false equivalences.
What you will be able to do
Practise grading cross-disciplinary connections (analogy, shared structure, shared mechanism, predictive transfer) on real case studies: scaling, entropy, evolution and optimisation, networks, feedback, emergence, and AdS/CFT. Follow Jared Kaplan’s documented path from holography to scaling laws as a study in transferable habits.
Every comparison in this module gets a grade:
You will grade each comparison yourself before reading the verdict. Keep the Connection Analyzer open in another tab if you want to write your reasoning down.
Biology. Across many species, metabolic rate scales with body mass roughly as (Kleiber’s law). West, Brown and Enquist (1997) proposed a mechanism: space-filling, fractal-like distribution networks (blood vessels) that minimise transport costs predict the 3/4 exponent.
AI. Kaplan et al. (2020) found that language-model test loss falls as a power law in parameters , data and compute over several orders of magnitude.
Both are power laws relating a size variable to a performance or cost variable, with exponents that matter. Grade it before reading on.
Left: metabolic rate grows with mass to the 3/4 power. Right: loss falls with parameter count to a small negative power ( was roughly 0.076 in Kaplan et al.’s fits). is a fitted constant.
Does not say: The biological exponent and its proposed explanation are both debated; the neural exponents depend on architecture, data and tokenisation.
Verdict: Level 2 at most. Same mathematical form and the same research habit (fit an exponent, then look for the network or geometry that explains it). The proposed mechanisms are different: vascular network geometry vs. resolving a data manifold. No result transfers a prediction from one to the other.
Sharma and Kaplan (2020) proposed that the scaling exponent is set by the intrinsic dimension of the data manifold, roughly for their setting. Bahri, Dyer, Kaplan, Lee and Sharma (2021) extended this into four regimes (variance-limited and resolution-limited, for both model size and data size). This is a Level 3a candidate within ML: it names a mechanism and predicts exponents from measurable quantities. Its support is partial and setting-dependent. The site’s Scaling Regimes explainer walks through it.
Identical form. Left: physical entropy of a probability distribution over microstates, in units of energy per temperature. Right: average information (in bits) of a probability distribution over messages.
Shannon noticed the formal identity in 1948. Later, E. T. Jaynes argued that statistical mechanics can be derived as inference: the Boltzmann distribution is the maximum-entropy distribution consistent with a known average energy. On that reading the connection is deeper than notation. The same principle (maximise uncertainty subject to what you know) produces both.
The physical link is also concrete in one place: Landauer’s principle says erasing a bit of information in a physical device dissipates at least of heat. That has been tested in laboratory experiments.
Verdict: Level 2, with a genuine Level 3 thread. The mathematics is identical, and the maximum-entropy framework makes it more than coincidence. Landauer’s principle ties information processing to thermodynamics in physical hardware. But "the entropy of a language model’s next-token distribution" is not a thermodynamic quantity of the GPU. Using one to reason about the other needs an explicit physical argument.
Shape a distribution and watch change. The same calculation, with physical units and a Boltzmann constant attached, would be a Gibbs entropy. That is exactly why the formulas match and exactly why the interpretations need to be kept apart.
Biologists talk about fitness landscapes; ML researchers talk about loss landscapes. Both picture a population or a parameter vector moving through a high-dimensional space toward "better" regions. Evolutionary algorithms explicitly borrow mutation, selection and recombination.
But natural selection and gradient descent work very differently:
Selection is not gradient descent
| Natural selection | Gradient descent | ||
|---|---|---|---|
| What moves | A population of varied individuals | One parameter vector (or a few replicas) | |
| Direction information | None. Variation is undirected; selection filters after the fact | Explicit. The gradient is computed and followed | |
| Objective | No fixed objective; "fitness" depends on environment, which changes and includes other organisms | A fixed, specified loss function (per training stage) | |
| Memory | Encoded in genomes across generations | Encoded in weights (plus optimiser state) | |
| Credit assignment | Whole organism lives or dies | Each parameter gets its own partial derivative |
The same 2D landscape, two search processes. The population finds high ground by mutation and selection without ever computing a slope; the gradient follower uses the local slope directly. Notice how differently they handle multiple peaks.
Verdict: Level 1 for "training is evolution"; Level 2 for evolutionary algorithms. Selection and gradient descent are both optimisation-like processes, and some mathematics (for example, under certain assumptions selection approximately climbs a fitness gradient on average) connects them. But calling neural-network training "evolution" erases the crucial difference: gradients give per-parameter directional information that selection never has.
Networks. Gene regulatory networks, neural circuits and artificial neural networks are all graphs. Network science gives shared tools: degree distributions, motifs, modularity. Alon’s work on gene networks found recurring "network motifs" (small wiring patterns such as feed-forward loops) and studied their dynamics. Whether similar motifs in an artificial network compute the same thing is an open empirical question in each case.
Feedback and agents. An agentic AI loop (observe → plan → act → observe) is a feedback controller. Control theory’s lessons about gain, delay and stability apply directly to the loop’s structure, which is Level 2. They do not tell you whether the LLM inside the loop reasons well.
Emergence. Hopfield (1982) explicitly titled his paper around "emergent collective computational abilities": memories stored as low-energy states of an Ising-like network. That is a Level 2 bridge built on purpose: physics mathematics repurposed as a computational model. Hopfield and Hinton received the 2024 Nobel Prize in Physics for foundational work connecting physics and machine learning.
The Hopfield network’s energy function has the same form as an Ising model’s energy. Memory retrieval corresponds to descending to a local energy minimum. This is a deliberate mathematical mapping, not a discovered coincidence.
Source: Hopfield 1982, PNAS
Physics often describes equilibrium as minimising energy, or free energy at finite temperature. ML often describes training as minimising loss. Several ML methods are built on this explicitly: energy-based models, Boltzmann machines, and the "temperature" in sampling. These are Level 2 by construction. The claim "the brain minimises free energy" (the free-energy principle) is a broader theoretical proposal whose testability is actively debated, so grade it separately from the ML usage.
Jared Kaplan’s documented path makes a good case study in which habits travel between fields. The facts below come from his Johns Hopkins faculty page, arXiv records and the site’s Founder File on Kaplan.
His faculty page also carries a methodological credo, paraphrased: genuinely new ideas should lead to new equations, and without precise results it is very hard to avoid fooling yourself.
Physics habits, visible in the scaling papers
| Habit | In physics | Visible move in the ML papers | |
|---|---|---|---|
| Dimensional analysis | Check units; build dimensionless ratios | Loss expressed via ratios like ; compute measured in consistent units (PF-days) | |
| Scaling behaviour | Ask how quantities change with size | Vary N, D, C over orders of magnitude instead of tuning one model | |
| Simplified models | Ising model, harmonic oscillator | Random-feature and teacher–student models in Bahri et al. 2021 | |
| Universal relationships | Critical exponents independent of microscopic detail | Finding that width/depth details matter little within a wide range | |
| Statistical thinking | Ensembles, averages, fluctuations | Distinguishing variance-limited from resolution-limited regimes | |
| Governing variables | Find the few parameters that control behaviour | Collapse performance onto N, D, C, with intrinsic data dimension as a candidate fourth | |
| Evaluating regularities | Is a law fundamental or effective? | Treat power laws as empirical, then propose a mechanism (manifold dimension) that predicts the exponent |
Practise reading the result itself in the Kaplan 2020 paper guide.
AdS/CFT. In 1997 Juan Maldacena conjectured that certain theories of quantum gravity in anti-de Sitter space (the "bulk") are exactly equivalent to certain conformal field theories without gravity living on its boundary. Two complete descriptions of one physical system: every bulk quantity has a boundary counterpart. It is a precisely stated duality in specific settings, supported by an enormous body of calculations, but not proven in general.
Constitutional AI. Bai et al. (2022) trained a harmless assistant using a written list of principles. In a supervised phase the model critiques and revises its own outputs against the principles. In an RL phase an AI model judges which of two responses better follows them, those preferences train a preference model, and that preference model serves as the reward (RLAIF).
The analogy. A short boundary document shapes the behaviour of a vast interior (the network’s weights), just as boundary data in AdS/CFT encode the bulk. It is evocative. Here is where it holds and where it breaks.
Where the analogy works, and where it breaks
| Dimension | AdS/CFT | Constitutional AI | Does the analogy hold? | |
|---|---|---|---|---|
| Kind of claim | A conjectured exact mathematical equivalence between two theories | A training method and its empirical results | No. An equivalence vs. a procedure | |
| "Boundary" and "interior" | Literal geometry: boundary of a spacetime | Metaphor: a short text vs. many parameters | Loosely. Only as a picture | |
| Information | Boundary theory contains all bulk information; the map is invertible in principle | The constitution does not determine the weights; pre-training data and optimisation do most of the work | No. The constitution underdetermines behaviour | |
| Dictionary | Explicit entries (fields ↔ operators, bulk mass ↔ scaling dimension) | No formal map from principles to weights | No | |
| Evidence type | Mathematical consistency checks, matched computations | Human and AI evaluations of harmlessness and helpfulness | Different kinds of evidence | |
| Shared theme | A compact description governing a large system | A compact description steering a large system | Yes, at the level of a research question |
Verdict: Level 1. AdS/CFT and Constitutional AI are not known to be mathematically equivalent or to share a mechanism. The analogy can prompt good questions, such as "how much of a model’s behaviour can a short specification determine?" or "is there a dictionary between principles and internal features?" But it is not evidence for any answer.
Three more bridges are often built through the holography metaphor:
Claims of the form "intelligence is holographic" or "LLMs are a boundary theory of human knowledge" are, as of this writing, speculation: no formal correspondence, no distinguishing prediction, no test.
Energy function of the same form; memory retrieval as energy descent.
Why this level: Built deliberately on shared mathematics. It does not show that brains store memories this way.
Identical formula; maximum-entropy reasoning links them; Landauer’s principle ties information erasure to heat.
Why this level: Graded 3a only for the Landauer link in physical computing hardware. The formula match alone is Level 2.
Both search high-dimensional spaces for better solutions.
Why this level: Selection lacks per-parameter directional information and a fixed objective. Evolutionary algorithms deliberately borrow the analogy.
A compact "boundary" description governing a large "interior".
Why this level: No mathematical equivalence, no dictionary, no shared mechanism. Useful only as a source of testable questions.
Before you publish or repeat a cross-disciplinary connection, write down its level and the single piece of evidence that would raise it one level.
A design reference for this curriculum: physics, chemistry, molecular biology and computer science taught as one quantitative course.
Watch for: The premise that shared quantitative tools, not departmental boundaries, organise the science.
Verified: Page loaded in browser, 2026-10-30
A design reference: an undergraduate program combining physics, biology, chemistry, mathematics, statistics and computation.
Watch for: How the program sequences math alongside the sciences rather than before them, as this curriculum does.
Verified: HTTP 200 + page content checked, 2026-10-30
An explicitly physics-flavoured interpretability paper: phase diagrams, geometry and phase changes in tiny models.
Watch for: How the authors label what holds in toy models versus what they conjecture for large models.
Verified: HTTP 200 + page content checked, 2026-10-30
Sparse autoencoders applied to a production model, with scaling laws for the dictionaries themselves.
Watch for: The limitations section. It is a model of honest scoping.
Verified: HTTP 200 + page content checked, 2026-10-30
Bridges to interpretability: directions in high-dimensional space as features, and why superposition lets a model pack in more features than it has dimensions.
Watch for: The explicit hedges. The video separates what interpretability research has shown from the illustrative toy story it tells.
Verified: YouTube oEmbed title+channel check, 2026-10-30
No prerequisites, and it covers dynamics, chaos, fractals, information, self-organisation, agent-based models and networks, the same toolkit as Module 5.
Watch for: The units on networks and scaling. Notice how often Mitchell separates "this is a model" from "this is how nature works".
Verified: HTTP 200 + page content checked, 2026-10-30
The most careful free treatment of power laws. It includes how to estimate an exponent and why straight lines on log-log plots are easy to over-read.
Watch for: The sections on fitting power laws. They are the antidote to "it is a power law, therefore it is universal".
Verified: HTTP 200 + page content checked, 2026-10-30
Free PDF plus notebooks. The clearest modern bridge from equations to architectures, including transformers.
Watch for: Chapters on loss functions and on transformers. The notation table at the front is worth bookmarking.
Verified: HTTP 200 + page content checked, 2026-10-30
The Large N Limit of Superconformal Field Theories and Supergravity
The AdS/CFT conjecture. Read the abstract only: note the word "conjecture". Limitation: specific settings (AdS spacetimes, conformal theories), not our universe’s cosmology.
Constitutional AI: Harmlessness from AI Feedback
The training method itself. Limitation: results for specific models and evaluations at the time; production training has evolved.
A Neural Scaling Law from the Dimension of the Data Manifold
A mechanistic proposal for scaling exponents. Limitation: estimating intrinsic dimension is itself noisy; tested in limited settings.
Explaining Neural Scaling Laws
Four scaling regimes with distinct mechanisms. Limitation: controlled models; partial frontier validation.
A General Model for the Origin of Allometric Scaling Laws in Biology
Network-based mechanism for the 3/4 exponent. Limitation: both the exponent’s universality and the model’s assumptions remain debated.
Neural networks and physical systems with emergent collective computational abilities
The canonical physics → computation bridge. Limitation: a computational model, not a physiological one.
There are no right answers to check against. These questions are for thinking on the page, and your answers go to your notebook.
Grade one connection you have personally found exciting (in your Context Jamming work or reading) using the four levels. What evidence would raise it one level?
Rewrite the AdS/CFT ↔ Constitutional AI analogy as a testable question that does not mention physics at all.
Which of Kaplan’s transferable habits would most improve how you evaluate AI go-to-market claims?
What question would you ask West, Brown and Enquist about whether their mechanism could say anything about neural networks?
Entropy & cross-entropy
is the average surprise, , when outcomes really follow . Cross-entropy is the average surprise when reality is but you predict with . It is never below , and the gap is the KL divergence. Language-model training minimises cross-entropy between real next tokens and the model’s predictions. The labels A, C, G, T are DNA bases, as in a sequence logo, but the arithmetic does not care what the outcomes are.
Selection vs gradient descent · same landscape
Gradient descent · one point, uses ∇L
Selection · 40 variants, no gradient
Darker = lower loss (higher fitness). Gradient descent computes the local slope of a differentiable function and steps downhill: θ ← θ − η∇L. From a bad start it slides into whichever basin it is in. Selection computes no gradient. It needs only variation (random mutation), selection (keep the better half) and inheritance, and because a population explores many points at once, mutations sometimes hop into a better basin. Evolution strategies are a related optimisation family in machine learning, but biological evolution has no global loss function, changing environments, and no designer choosing η. Both are search on a landscape, a level-2 structural analogy at most, not a shared mechanism.