← All parts of this equation

Equation 5 · Part 12 · The Hardest Unsolved Problems in Mechanistic Interpretability

Starting index or lower bound: j=1

di(m2)≈∑j=1m1gj dj(m1),∥g∥0≪m1,m1<m2,d_i^{(m_2)} \approx \sum_{j=1}^{m_1} g_j\, d_j^{(m_1)}, \qquad \lVert g \rVert_0 \ll m_1, \quad m_1 < m_2,
j=1j=1

What this part means

This label says where the repeated addition, multiplication, or accumulation starts. Read its value or condition together with the article’s description of the index.

Its job in the formula

j=1 appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.

The passage around this formula

Leask, Nanda and colleagues then tested the assumption directly with two new techniques, and the result undercuts the idea that there is a “right” dictionary size waiting to be found by scaling further. Stitching the dictionaries of differently sized sparse autoencoders together, they show that larger dictionaries recover latents genuinely missing from smaller ones — the smaller dictionary is incomplete. Training a second, “meta” sparse autoencoder on the decoder directions of a first one, they show that what looks like a single, atomic feature in a large dictionary is itself well approximated by a sparse combination of directions from a smaller one — a reported example decomposes an…

Read this part in the article →

Learn the underlying idea

Σ adds a collection of terms. Π multiplies them. The lower and upper labels tell you which terms belong to the collection.

Open the illustrated sums and products: repeat an operation over an index guide →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.