AlgZoo: uninterpreted models with fewer than 1,500 parameters

Jacob_Hilton

This post covers work done by several researchers at, visitors to and collaborators of ARC, including Zihao Chen, George Robinson, David Matolcsi, Jacob Stavrianos, Jiawei Li and Michael Sklar. Thanks to Aryan Bhatt, Gabriel Wu, Jiawei Li, Lee Sharkey, Victor Lecomte and Zihao Chen for comments.

In the wake of recent debate about pragmatic versus ambitious visions for mechanistic interpretability, ARC is sharing some models we've been studying that, in spite of their tiny size, serve as challenging test cases for any ambitious interpretability vision. The models are RNNs and transformers trained to perform algorithmic tasks, and range in size from 8 to 1,408 parameters. The largest model that we believe we more-or-less fully understand has 32 parameters; the next largest model that we have put substantial effort into, but have failed to fully understand, has 432 parameters. The models are available here:

[ AlgZoo GitHub repo ]

We think that the "ambitious" side of the mechanistic interpretability community has historically underinvested in "fully understanding slightly complex models" compared to "partially understanding incredibly complex models". There has been some prior work aimed at full understanding, for instance on models trained to perform paren balancing, modular addition and more general group operations, but we still don't think the field is close to being able to fully understand our models (at least, not in the sense we discuss in this post). If we are going to one day fully understand multi-billion-parameter LLMs, we probably first need to reach the point where fully understanding models with a few hundred parameters is pretty easy; we hope that AlgZoo will spur research to either help us reach that point, or help us reckon with the magnitude of the challenge we face.

One likely reason for this underinvestment is lingering philosophical confusion over the meaning of "explanation" and "full understanding". Our current perspective at ARC is that, given a model that has been optimized for a particular loss, an "explanation" of the model amounts to a mechanistic estimate of the model's loss. We evaluate mechanistic estimates in one of two ways. We use surprise accounting to determine whether we have achieved a full understanding; but for practical purposes, we simply look at mean squared error as a function of compute, which allows us to compare the estimate with sampling.

In the rest of this post, we will:

Review our perspective on mechanistic estimates as explanations, including our two ways of evaluating mechanistic estimates
Walk through three AlgZoo RNNs that we've studied, the smallest of which we fully understand, and the largest of which we don't
Conclude with some thoughts on how ARC's approach relates to ambitious mechanistic interpretability

Mechanistic estimates as explanations

Models from AlgZoo are trained to perform a simple algorithmic task, such as calculating the position of the second-largest number in a sequence. To explain why such a model has good performance, we can produce a mechanistic estimate of its accuracy.^[1] By "mechanistic", we mean that the estimate reasons deductively based on the structure of the model, in contrast to a sampling-based estimate, which makes inductive inferences about the overall performance from individual examples.^[2] Further explanation of this concept can be found here.

Not all mechanistic estimates are high quality. For example, if the model had to choose between 10 different numbers, before doing any analysis at all, we might estimate the accuracy of the model to be 10%. This would be a mechanistic estimate, but a very crude one. So we need some way to evaluate the quality of a mechanistic estimate. We generally do this using one of two methods:

Mean squared error versus compute. The more conceptually straightforward way to evaluate a mechanistic estimate is to simply ask how close it gets to the model's actual accuracy. The more compute-intensive the mechanistic estimate, the closer it should get to the actual accuracy. Our matching sampling principle is roughly the following conjecture: there is a mechanistic estimation procedure that (given suitable advice) performs at least as well as random sampling in mean squared error for any given computational budget.
Surprise accounting. This is an information-theoretic metric that asks: how surprising is the model's actual accuracy, now that we have access to the mechanistic estimate? We accrue surprise in one of two ways: either the estimate itself performed some kind of calculation or check with a surprising result, or the model's actual accuracy is still surprising even after accounting for the mechanistic estimate and its uncertainty. Further explanation of this idea can be found here.

Surprise accounting is useful because it gives us a notion of "full understanding": a mechanistic estimate with as few bits of total surprise as the number of bits of optimization used to select the model. On the other hand, mean squared error versus compute is more relevant to applications such as low probability estimation, as well as being easier to work with. We have been increasingly focused on matching the mean squared error of random sampling, which remains a challenging baseline, although we generally consider this to be easier than achieving a full understanding. The two metrics are often closely related, and we will walk through examples of both metrics in the case study below.

For most of the larger models from AlgZoo (including the 432-parameter model discussed below), we would consider it a major research breakthrough if we were able to produce a mechanistic estimate that matched the performance of random sampling under the mean squared error versus compute metric.^[3] It would be an even harder accomplishment to achieve a full understanding under the surprise accounting metric, but we are less focused on this.

Case study: 2nd argmax RNNs

The models in AlgZoo are divided into four families, based on the task they have been trained to perform. The family we have spent by far the longest studying is the family of models trained to find the position of the second-largest number in a sequence, which we call the "2nd argmax" of the sequence.

The models in this family are parameterized by a hidden size $d$ and a sequence length $n$ . The model $M_{d, n}$ is a 1-layer ReLU RNN with $d$ hidden neurons that takes in a sequence of $n$ real numbers and produces a vector of logit probabilities of length $n$ . It has three parameter matrices:

the input-to-hidden matrix $W^{h i} \in R^{d \times 1}$
the hidden-to-hidden matrix $W^{h h} \in R^{d \times d}$
the hidden-to-output matrix $W^{o h} \in R^{n \times d}$

The logits of $M_{d, n}$ on input sequence $x_{0}, \dots, x_{n - 1} \in R$ are computed as follows:

$h_{0} = 0 \in R^{d}$
$h_{t + 1} = R e L U (W^{h h} h_{t} + W^{h i} x_{t})$ for $t = 0, \dots, n - 1$
$l o g i t s = W^{o h} h_{n}$

Diagrammatically:

Each model in this family is trained to make the largest logit be the one that corresponds to the position of second-largest input, using softmax cross-entropy loss.

The models we'll discuss here are $M_{2, 2}$ , $M_{4, 3}$ and $M_{16, 10}$ . For each of these models, we'd like to understand why the trained model has high accuracy on standard Gaussian input sequences.

Hidden size 2, sequence length 2

The model $M_{2, 2}$ can be loaded in AlgZoo using zoo_2nd_argmax(2, 2). It has 10 parameters and almost perfect 100% accuracy, with an error rate of roughly 1 in 13,000. This means that the difference between the model's logits,
$Δ (x_{0}, x_{1}) := l o g i t s {(x_{0}, x_{1})}_{1} - l o g i t s {(x_{0}, x_{1})}_{0},$ is almost always negative when $x_{1} > x_{0}$ and positive when $x_{0} > x_{1}$ . We'd like to mechanistically explain why the model has this property.

To do this, note first that because the model uses ReLU activations and there are no biases, $Δ$ is a piecewise linear function of $x_{0}$ and $x_{1}$ in which the pieces are bounded by rays through the origin in the $x_{0}$ - $x_{1}$ plane.

Now, we can "standardize" the model to obtain an exactly equivalent model for which the entries of $W^{h i}$ lie in ${\pm 1}$ , by rescaling the neurons of the hidden state. Once we do this, we see that
$W^{h i} = (\begin{matrix} + 1 - 1 \end{matrix}), W^{h h} \in (\begin{matrix} [- 1, 0) & [1, \infty) [1, \infty) & [- 1, 0) \end{matrix}) and W^{o h} \in (\begin{matrix} (0, \infty) & (- \infty, 0) (- \infty, 0) & (0, \infty) \end{matrix}) .$

From these observations, we can prove that, on each linear piece of $Δ$ ,
$Δ (x_{0}, x_{1}) = a_{0} x_{0} - a_{1} x_{1}$ with $a_{0}, a_{1} > 0$ , and moreover, the pieces of $Δ$ are arranged in the $x_{0}$ - $x_{1}$ plane according to the following diagram:

Here, a double arrow indicates that a boundary lies somewhere between its neighboring axis and the dashed line $x_{0} = x_{1}$ , but we don't need to worry about exactly where it lies within this range.

Looking at the coefficients of each linear piece, we observe that:

In the two blue regions, we have $a_{0} < a_{1}$
In the two green regions, we have $a_{0} > a_{1}$
In the two yellow regions, we have $a_{0} \approx a_{1}$ to within around 1 part in $2^{11}$

This implies that:

$Δ (x_{0}, x_{1}) < 0$ in the blue and green regions above the line $x_{0} = x_{1}$
$Δ (x_{0}, x_{1}) > 0$ in the blue and green regions below the line $x_{0} = x_{1}$
$Δ (x_{0}, x_{1})$ is approximately proportional to $x_{0} - x_{1}$ in the two yellow regions

Together, these imply that the model has almost 100% accuracy. More precisely, the error rate is the fraction of the unit disk lying between the model's decision boundary and the line $x_{0} = x_{1}$ , which is around 1 in $2 π \times 2^{11} \approx 13, 000$ . This is very close to the model's empirically-measured error rate.

Mean squared error versus compute. Using only a handful of computational operations, we were able to mechanistically estimate the model's accuracy to within under 1 part in 13,000, which would have taken tens of thousands of samples. So our mechanistic estimate was much more computationally efficient than random sampling. Moreover, we could have easily produced a much more precise estimate (exact to within floating point error) by simply computing how close $a_{0}$ and $a_{1}$ were in the two yellow regions.

Surprise accounting. As explained here, the total surprise decomposes into the surprise of the explanation plus the surprise given the explanation. The surprise given the explanation is close to 0 bits, since the calculation was essentially exact. For the surprise of the explanation, we can walk through the steps we took:

We "standardized" the model, which simply replaced the model with an exactly equivalent one. This did not depend on the model's parameters at all, and so doesn't incur any surprise.
We checked the signs of all 10 of the model's parameters, and whether or not each of the 4 entries of $W^{h h}$ was greater than or less than 1 in magnitude, incurring 14 bits of surprise.
We deduced from this the form of the piecewise linear function $Δ$ . This was another step that didn't depend on the model's parameters and so doesn't incur any surprise.
We checked which of the two linear coefficients was larger in magnitude in each of the 4 blue and green regions, incurring 4 bits of surprise.
We checked that the two linear coefficients were equal in magnitude in each of the 2 yellow regions to within 1 part in $2^{11}$ , incurring around 22 bits of surprise.

Adding this up, the total surprise is around 40 bits. This plausibly matches the number of bits of optimization used to select the model, since it was probably necessary to optimize the linear coefficients in the yellow regions to be almost equal. So we can be relatively comfortable in saying that we have achieved a full understanding.

Note that our analysis here was pretty "brute force": we essentially checked each linear region of $Δ$ one by one, with a little work up front to reduce the total number of checks required. Even though we consider this to constitute a full understanding in this case, we would not draw the same conclusion for much deeper models. This is because the number of regions would grow exponentially with depth, making the number of bits of surprise far larger than the number of bits taken up by the weights of the model (which is an upper bound on the number of bits of optimization used to select the model). The same exponential blowup would also prevent us from matching the efficiency of sampling at reasonable computational budgets.

Finally, it is interesting to note that our analysis allows us to construct a model by hand that gets exactly 100% accuracy, by taking
$W^{h i} = (\begin{matrix} + 1 - 1 \end{matrix}), W^{h h} = (\begin{matrix} - 1 & + 1 + 1 & - 1 \end{matrix}) and W^{o h} = (\begin{matrix} + 1 & - 1 - 1 & + 1 \end{matrix}) .$

Hidden size 4, sequence length 3

The model $M_{4, 3}$ can be loaded in AlgZoo using zoo_2nd_argmax(4, 3). It has 32 parameters and an accuracy of 98.5%.

Our analysis of $M_{4, 3}$ is broadly similar to our analysis of $M_{2, 2}$ , but the model is already deep enough that we wouldn't consider a fully brute force explanation to be adequate. To deal with this, we exploit various approximate symmetries in the model to reduce the total number of computational operations as well as the surprise of the explanation. Our full analysis can be found in these sets of notes:

Symmetric RNNs by George Robinson
Heuristic explanations for 2nd argmax models by Jacob Hilton

In the second set of notes, we provide two different mechanistic estimates for the model's accuracy that use different amounts of compute, depending on which approximate symmetries are exploited. We analyze both estimates according to our two metrics. We find that we are able to roughly match the computational efficiency of sampling,^[4] and we think we more-or-less have a full understanding, although this is less clear.

Finally, our analysis once again allows us to construct an improved model by hand, which has 99.99% accuracy.^[5]

Hidden size 16, sequence length 10

The model $M_{16, 10}$ can be loaded in AlgZoo using example_2nd_argmax().^[6] It has 432 parameters and an accuracy of 95.3%.

This model is deep enough that a brute force approach is no longer viable. Instead, we look for "features" in the activation space of the model's hidden state.

After rescaling the neurons of the hidden state, we notice an approximately isolated subcircuit formed by neurons 2 and 4, with no strong connections to the outputs of any other neurons:
$W_{(2, 4)}^{h i} \approx (\begin{matrix} 0 + 1 \end{matrix}), W_{(2, 4), (2, 4)}^{h h} \approx (\begin{matrix} + 1 & + 1 - 1 & - 1 \end{matrix}) and W_{(2, 4), (0, 1, 3, \dots)}^{h h} \approx (\begin{matrix} 0 & \dots 0 & \dots \end{matrix}) .$

It follows that after unrolling the RNN for $t$ steps:

Neuron 2 is approximately $max (0, x_{0}, \dots, x_{t - 2})$
Neuron 4 is approximately $max (0, x_{0}, \dots, x_{t - 1}) - max (0, x_{0}, \dots, x_{t - 2})$

This can be proved by induction using the identity $R e L U (a - b) = max (a, b) - b$ for neuron 4.

Next, we notice that neurons 6 and 7 fit into a larger approximately isolated subcircuit together with neurons 2 and 4:
$W_{(6, 7)}^{h i} \approx (\begin{matrix} - 1 - 1 \end{matrix}), W_{(6, 7), (2, 4)}^{h h} \approx (\begin{matrix} + 1 & 0 + 1 & + 1 \end{matrix}) and W_{(6, 7), (0, 1, 3, \dots)}^{h h} \approx (\begin{matrix} 0 & \dots 0 & \dots \end{matrix}) .$

Using the same identity, it follows that after unrolling the RNN for $t$ steps:

Neuron 6 is approximately $max (0, x_{0}, \dots, x_{t - 3}, x_{t - 1}) - x_{t - 1}$
Neuron 7 is approximately $max (0, x_{0}, \dots, x_{t - 1}) - x_{t - 1}$

We can keep going, and add in neuron 1 to the subcircuit:
$W_{(1)}^{h i} \approx (\begin{matrix} - 1 \end{matrix}), W_{(1), (2, 4, 6, 7)}^{h h} \approx (\begin{matrix} + 1 & + 1 & + 1 & - 1 \end{matrix}) and W_{(1), (0, 1, 3, \dots)}^{h h} \approx (\begin{matrix} 0 & \dots \end{matrix}) .$

Hence after unrolling the RNN for $t$ steps, neuron 1 is approximately
$max (0, x_{0}, \dots, x_{t - 4}, x_{t - 2}, x_{t - 1}) - x_{t - 1},$ forming another "leave-one-out-maximum" feature (minus the most recent input).

In fact, by generalizing this idea, we can construct a model by hand that uses 22 hidden neurons to form all 10 leave-one-out-maximum features, and leverages these to achieve an accuracy of 99%.^[7]

Unfortunately, however, it is challenging to go much further than this:

We have exploited the approximate weight sparsity of 5 of the hidden neurons, but most of the remaining 11 hidden neurons are more densely connected.
We have produced a handcrafted model with high accuracy, but we have not produced a correspondence between most of hidden neurons of the trained model and the hidden neurons of the handcrafted model.
We have used approximations in our analysis, but have not dealt with the approximation error, which gets increasingly significant as we consider more complex neurons.

Fundamentally, even though we have some understanding of the model, our explanation is incomplete because we not have not turned this understanding into an adequate mechanistic estimate of the model's accuracy.

Ultimately, to produce a mechanistic estimate for the accuracy of this model that is competitive with sampling (or that constitutes a full understanding), we expect we would have to somehow combine this kind of feature analysis with elements of the "brute force after exploiting symmetries" approach used for the models $M_{2, 2}$ and $M_{4, 3}$ , and to do so in a primarily algorithmic way. This is why we consider producing such a mechanistic estimate to be a formidable research challenge.

Some notes with further discussion of this model can be found here:

RNNs for the 2nd argmax and complementary notebook by Zihao Chen

Conclusion

The models in AlgZoo are small, but for all but the tiniest of them, it is a considerable challenge to mechanistically estimate their accuracy competitively with sampling, let alone fully understand them in the sense of surprise accounting. At the same time, AlgZoo models are trained on tasks that can easily be performed by LLMs, so fully understanding them is practically a prerequisite for ambitious LLM interpretability. Overall, we would be keen to see other ambitious-oriented researchers explore our models, and more concretely, we would be excited to see better mechanistic estimates for our models in the sense of mean squared error versus compute. One specific challenge we pose is the following.

Challenge: Design a method for mechanistically estimating the accuracy of the 432-parameter model $M_{16, 10}$ ^[8] that matches the performance of random sampling in terms of mean squared error versus compute. A cheap way to measure mean squared error is to add noise to the model's weights (enough to significantly alter the model's accuracy) and check the squared error of the method on average over the choice of noisy model.^[9]

How does ARC's broader approach relate to this? The analysis we have presented here is relatively traditional mechanistic interpretability, but we think of this analysis mainly as a warm-up. Ultimately, we seek a scalable, algorithmic approach to producing mechanistic estimates, which we have been pursuing in our recent work. Furthermore, we are ambitious in the sense that we would like to fully exploit the structure present in models to mechanistically estimate any quantity of interest.^[10] Thus our approach is best described as "ambitious" and "mechanistic", but perhaps not as "interpretability".

Technically, the model was trained to minimize cross-entropy loss (with a small amount of weight decay), not to maximize accuracy, but the two are closely related, so we will gloss over this distinction. ↩︎
The term "mechanistic estimate" is essentially synonymous with "heuristic explanation" as used here or "heuristic argument" as used here, except that it refers more naturally to a numeric output rather than the process used to produce it, and has other connotations we now prefer. ↩︎
An estimate for a single model could be close by chance, so the method should match sampling on average over random seeds. ↩︎
To assess the mean squared error of our method, we add noise to the model's weights and check the squared error of our method on average over the choice of noisy model. ↩︎
This handcrafted model can be loaded in AlgZoo using handcrafted_2nd_argmax(3). Credit to Michael Sklar for correspondence that led to this construction. ↩︎
We treat this model as separate from the "official" model zoo because it was trained before we standardized our codebase. Credit to Zihao Chen for originally training and analyzing this model. The model from the zoo that can be loaded using zoo_2nd_argmax(16, 10) has the same architecture, and is probably fairly similar, but we have not analyzed it. ↩︎
This handcrafted model can be loaded in AlgZoo using handcrafted_2nd_argmax(10). Note that this handcrafted model has more hidden neurons than the trained model $M_{16, 10}$ . ↩︎
The specific model we are referring to can be be loaded in AlgZoo using example_2nd_argmax(). Additional 2nd argmax models with the same architecture, which a good method should also work well on, can be loaded using zoo_2nd_argmax(16, 10, seed=seed) for seed equal to 0, 1, 2, 3 or 4. ↩︎
A better but more expensive way to measure mean squared error is to instead average over random seeds used to train the model. ↩︎
We are ambitious in this sense because of our worst-case theoretical methodology, but at the same time, we are focused more on applications such as low probability estimation than on understanding inherently, for which partial success could result in pragmatic wins. ↩︎

[-]Nicholas Goldowsky-Dill1mo330

Okay, you successfully nerd-sniped me into interpreting the model :)

I think I understand the role of {N1, N6, N7, N8} reasonably well. The activations post- are well approximated by the linear model

$W_{h h} h_{n, t} \approx a_{n} (δ) \cdot M_{t} + b_{n} (δ) \cdot max (S_{t}, 0)$

where $M_{t}$ is the running max, $S_{t}$ is the second running max, and $δ$ represents how long ago the max-value occurred. The coefficients change with delta in pleasing patterns:

This model fits the activations well ( $R^{2} = 0.992$ ).^[1]

This is far from a complete explanation by your standards. In particular:

I only have a partial mechanistic understanding of how the weights lead to this behavior. I think it's entirely feasible to understand, but will take more time to unravel.
There are large parts of the model I haven't looked at at all, e.g. the other 10 neurons. There are also parts of the task that I don't know how the model does, e.g. tracking the current position of the 2nd-maximum value).

I may work more on this, but probably not for a couple of days so it seemed worth posting my progress. Lots more detail on my understanding (e.g. a partial mechanistic understanding) in this notebook.

^{^}
though more like 0.95 for some subsets

[-]Jacob_Hilton1mo30

Good start!

[-]Martin Keane1mo90

I likewise got nerd-sniped into taking this one on! It's been good fun to work on.
My current description of the circuit behaviour is pretty lengthy and has a fair amount of hand waving, so I need to work on reaching a more compact description of what is going on.

Some notes:
Zeroing out all the inputs except the largest two gets the network to 100% and made it a lot easier to see behaviour of some of the oscillatory sub-circuits.

Zeroing out everything except the max helps by showing the impulse-response behaviour.

Almost all ablations hurt the accuracy dramatically - the model makes use of all neurons. There appear to be two different ways in which the output is encoded, depending on whether the 2nd largest input comes before or after the largest.

Based on behaviour and the recurrence matrix I've notionally divided the neurons up into

Comparators
Wave neurons
Bridge neurons
Special cases: n2, n4, n9

There is some interesting clipping patterns among the comparator neurons - when max input comes first, there is a unique clipping pattern for each gap between max and 2nd val. When 2nd val comes first, all comparators clip due to max val.

n7 does a fairly pure comparison with the running max val.

There is definitely more to the picture than what I currently understand! I'm going to keep working on it and see where I get to

[-]Martin Keane1mo20

The readout mechanism for S (2nd max) in the presence of M (max) combines two computations in a shared low-dimensional subspace

Phase Wheel

The hidden state follows a spiral trajectory through time, implemented by a rotating phase in the hidden state. The W_out projection converts phase angle to position logits. The main spiral shape does not differ between forward (M first) and reverse (S first) cases.

Discrimination Offset

The network must discriminate between the very similar forward and reverse cases. The final hidden states differ by an offset:

h_forward = h_reverse + offset(m, s)

The offset is separable and antisymmetric:

offset(m, s) = f(m) + g(s) where g(s) = -f(s)

The network applies +f for the M position and -f for the S position.

The offset has effective rank ~2, and is also an approximate spiral in PCA space.

Shared Subspace

Both mechanisms operate in the same low-dimensional subspace of the hidden state.

- f(m) PC1 ≈ Main PC2 (cosine = 0.92)

- f(m) PC2 ≈ Main PC1 (cosine = 0.67)

The position-by-position correlation is only 0.04 — the spirals carry orthogonal information.

The discrimination offset is smaller, ~1/4 magnitude. The main spiral does the bulk of the position encoding, and the offset provides a correction to shift the readout between M and S.

How Discrimination Works

The offset f(m) - f(s) projects through W_out to create discriminative logits. For a forward case, the offset suppresses the early position (M) and boosts the late position (S). For the reverse case, the offset sign flips and the offset boosts the early position and suppresses the late position

ReLU boundary crossing

The offset and readout are primarily linear, there is relatively infrequent crossing of ReLU boundaries as we vary the M and S positions and magnitudes

Can you turn this argument into a mechanistic estimate of the model's accuracy? (You'd need to do things like deduce correlations from the weights, rather than just observe them empirically - but it seems like you're getting close.)

I'm getting close indeed! I did take a big detour into tropical geometry... The key approach at the moment is deriving a sequence D[t] of which ReLU are active during the sequence - this turns out to be quite stable after an impulse. Then we can mask W_hh via D[t] and combine all the (now-linear) steps to get an effective linear operator for the whole sequence, which we can then investigate with normal linear methods

Now, I'm not sure I've exactly followed the brief, but I think there is some interesting stuff here: https://gist.github.com/mrsirrisrm/d6850ff8647d1ed2f67cc92d5bce3ed0

If we focus on the compute_final_state func:
with known D sequences, the RNN dynamics are piecewise-linear.

The final state is computed as:

pre = first_val * w_first[gap] + second_val * W_ih

h_second = D_second_mask * max(0, pre)

h_final = Phi_post[(gap,dir)][steps_after] @ h_second

The nonlinearities have been incorporated into Phi_post and so we can do eigenvalue analysis on it, eg seeing the difference between the forward (M then S) and reverse (S then M) directions. Note that there is a different Phi_post for every M,S position pair.
In the forward direction, spectral radius is 0.76 – 1.05 with a small spectral gap, while in the reverse direction it is 1.37 – 2.91 and the spectral gap is larger. So quite different dynamics are in play in the two directions.
W_out @ Phi_post is effectively 2-3 dimensional: for forward, the top 3 singular values explain 94–98% of logit variance. For rev, the top singular value alone explains 87–93%.

LESSWRONG
LW

LESSWRONG
LW

179

AlgZoo: uninterpreted models with fewer than 1,500 parameters

179

Ω 61

Mechanistic estimates as explanations

Case study: 2nd argmax RNNs

Hidden size 2, sequence length 2

Hidden size 4, sequence length 3

Hidden size 16, sequence length 10

Conclusion

179

Ω 61

Phase Wheel

Discrimination Offset

Shared Subspace

How Discrimination Works

ReLU boundary crossing

179

Ω 61

Phase Wheel

Discrimination Offset

Shared Subspace

How Discrimination Works

ReLU boundary crossing