Beyond Kolmogorov and Shannon
This post is the first in a sequence that will describe James Crutchfield’s Computational Mechanics framework. We feel this is one of the most theoretically sound and promising approaches towards understanding Transformers in particular and interpretability more generally. As a heads up: Crutchfield’s framework will take many posts to fully go through, but even if you don’t make it all the way through there are still many deep insights we hope you will pick up along the way.
EDIT: since there was some confusion about this in the comments: These initial posts are supposed to be an introductionary and won’t get into the actually novel aspects of Crutchfield’s framework yet. It’s also not a dunk on existing information- theoretic measures—rather an ode!
To better understand the capability and limitations of large language models it is crucial to understand the inherent structure and uncertainty (‘entropy’) of language data. It is natural to quantify this structure with complexity measures. We can then compare the performance of transformers to the theoretically optimal limits achieved by minimal circuits. This will be key to interpreting transformers.
The two most well-known complexity measures are the Shannon entropy and the Kolmogorov complexity. We will describe why these measures are not sufficient to understand the inherent structure of language. This will serve as a motivation for more sophisticated complexity measures that better probe the intrinsic structure of language data. We will describe these new complexity measures in subsequent posts. Later in this sequence we will discuss some directions for transformer interpretability work.
Compression is the path to understanding
Imagine you are an agent coming across some natural system. You stick an appendage into the system, effectively measuring its states. You measure for a million timepoints and get mysterious data that looks like this:
You want to gain an understanding of how this system generates this data, so that you can predict its output, so you can take advantage of the system to your own ends, and because gaining understanding is an intrinsic joy. In reality the data was generated in the following way: output 0, then 1, then you flip a fair coin, and then repeat. Is there some kind of framework or algorithm where we can reliably come to this understanding?
As others have noted, understanding is related to abstraction, prediction, and compression. We operationalize understanding by saying an agent has an understanding of a dataset if it possesses a compressed generative model: i.e. a program that is able to generate samples that (approximately) simulate the hidden structure, both deterministic and random, in the data.
Note that pure prediction is not understanding. As a simple example take the case of predicting the outcomes of 100 fair coin tosses. Predicting tails every flip will give you maximum expected predictive accuracy (50%), but it is not the correct generative model for the data. Over the course of this sequence, we will come to formally understand why this is the case.
Standard measures of information theory do not work
To start let’s consider the Kolmogorov Complexity and Shannon Entropy as measures of compression, and see why they don’t quite work for what we want.
Recall that the Kolmogorov(-Chaitin-Solomonoff) complexity of a bit string is defined as the length of the shortest programme outputting [given a blank output on a chosen universal Turing machine]
One often discussed downside of the K complexity is that it is incomputable. But there is another more conceptual downside if we want Kolmogorov complexity to measure structure in natural systems: it assigns maximal ‘complexity’ to random strings.
Consider again the 0-1-random sequence
The Turing Machine is forced to explicitly represent every randomly generated bit, since there is no compression available for a string generated by a fair coin. For those bits, we will have to use up a full 1 bit (in this case 10E6/3 bits total). For the deterministic 0 and1 bits, we need only remember where in the sequence we are: the deterministic 0 position, the deterministic 1 position, or the random position. This requires log(3) ~= 1.58 bits.
There are two main things to note here. First, the K complexity is separable into two components, one corresponding to randomness, and the other corresponding to deterministic structure. Second, the component corresponding to randomness is a much larger contributor to the K complexity, by 6 orders of magnitude! This arises from the fact that we want the Turing Machine to recreate the string exactly, accounting for every bit.
If we want to have a compressed understanding of this string, why should we memorize every single random bit? The best thing to do would be to recognize that the random bits are random, and simply characterize them by the entropy associated with that token, instead of trying to account for every sample. In other words, the program associated with the standard way of thinking of K complexity is something like:
# use up a lot of computational resources storing every single # random bit explicitly. This is a list that is 10E6/3 long!!! random_bits = [0, 1, 1, 1, 1, 0, 0, 1, ..., ..., ..., 0, 0, 1, 1, 0, 1, 0, 0] # a relatively compact for-loop of 3 lines. the last line fetches the stored # random data for i in range(data_length/3): data.append(0) data.append(1) data.append(random_bits[i])
The first line of code memorizes every random bit we have to explicitly represent. Then we can loop through the deterministic 0-1 and deterministically append the “random” bits one by one. But here’s a much more compact understanding:
for i in range(data_length/3): data.append(0) data.append(1) data.append(np.random.choice([0,1])
Note that the last line of this program is not the same as the last line of the previous program. Here we loop through appending the deterministic 0-1 and then randomly generate a bit.
If we were right in our assessment that the random part was really random then the first programme will overfit: if we do the observation again the nondeterministic part will be different—we’ve just ‘wasted’ ~ of bits on overfitting!
The issue with K complexity is that it must account for all randomly generated data exactly. But an agent trying to create a compact understanding of the world only suffers when they try to account for random bits as if they were not random. A Turing Machine has no mechanism to instantiate uncertainty in the string generating process.
Since K complexity algorithmically accounts for every bit, whether generated by random or deterministic means, it overestimates the complexity of data generated by an at least partially random processes. Maybe then we can try Shannon Entropy since that seems to be a measure of the random nature of a system. As a reminder, here is the mystery string:
Recall that the Shannon Entropy of a distribution is , and that entropy is maximized by uniform distributions, where randomness is maximum. What is the Shannon Entropy of our data? We need to look at the distribution of 0s in 1s in our string:
There are equal numbers of 0′s and 1′s in our data, so the Shannon Entropy is maximized. From the perspective of Shannon Entropy, our data is indistinguishable from IID fair coin flips! This corresponds to something like the following program:
for i in range(data_length): data.append(np.random.choice([0,1])
which is indeed very compact. But it also does not have great predictive power. There is structure in the data which we can’t see from the perspective of Shannon Entropy. Whereas the perspective of K complexity led to overfitting the data by treating randomly generated bits as if they were deterministically generated, the perspective of Shannon Entropy is akin to under fitting the data by treating deterministic structure in the data as if it were generated by a random process.
These are the key takeaways:
Data is, in general, a mixture of randomly generated components and deterministic hidden structure
We understand understanding as producing accurate generative models.
Kolmogorov Complexity and Shannon Entropy are misleading measures of structure. Kolmogorov complexity overestimates deterministic structure while the Shannon Entropy rate underestimates deterministic structure.
We need a framework that allows us to find and characterize both structured and random parts of our data.
As a teaser, the first step in attacking this last question will be investigating how the entropy (irreducible probabilistic uncertainty) changes at different scales.
In Crutchfield’s framework these are called ‘Epsilon Machines’.
Understanding is not just prediction—since prediction is a purely correlational understanding that does in general lift to the full causal picture. Recall that for most large data sets there are many causal models compatible with the empirical joint distribution. To distinguish these causal models we need interventional data. To have ‘deep’ understanding we need full causal understanding.
A simple way to see that All Tails is not the correct generative model is to consider sampling it many times: the observed empirical distribution of sampling from Tailx100 is very different from CoinFlipx100
- EA & LW Forums Weekly Summary (24 − 30th Oct 22′) by 1 Nov 2022 2:58 UTC; 23 points) (EA Forum;
- Entropy Scaling And Intrinsic Memory by 15 Nov 2022 18:11 UTC; 18 points) (
- EA & LW Forums Weekly Summary (24 − 30th Oct 22′) by 1 Nov 2022 2:58 UTC; 13 points) (
- 29 Oct 2022 16:42 UTC; 0 points)'s comment on Pondering computation in the real world by (
Sorry if this is a spoiler for your next post, but I take issue with the heading “Standard measures of information theory do not work” and the implication that this post contains the pre-Crutchfield state of the art.
The standard approach to this in information theory (which underlies the loss function of autoregressive LMs) isn’t to try to match the Shannon entropy of the marginal distribution of bits (a 50-50 distribution in your post), it’s to treat the generative model as a distribution for each bit conditional on the previous bits and use the cross-entropy of that distribution under the data distribution as the loss function or measure of goodness of the generative model.
So in this example, “look at the previous bits, identify the current position relative to the 01x01x pattern, and predict 0, 1, or [50-50 distribution] as appropriate” is the best you can do (given sufficient data for the 50-50 proportion to be reasonably accurate) and is indeed an accurate model of the process that generated the data.
We can see the pattern and take the current position into account because the distribution is conditional on previous bits.
Predicting 011011011… doesn’t do as well because cross-entropy penalizes unwarranted overconfidence.
Predicting 50-50 for each bit doesn’t do as well because cross-entropy still cares about successful predictions.
(Formally, cross-entropy is an expectation over the data distribution instead of an empirical average over a bunch of sampled data, but the term is used in both cases in practice. “Log[-likelihood] loss” and “the log scoring rule” are other common terms for the empirical version.)
As I said above, this isn’t just a standard information theory approach to this, it’s actually how GPT-3 and other LLMs were trained.
I’m curious about Crutchfield’s thing, but so far not convinced that standard information theory isn’t adequate in this context.
(I think Kolmogorov complexity is also relevant to LLM interpretability, philosophically if not practically, but that’s beyond the scope of this comment.)
A couple of differences between Kolmogorov complexity/Shannon entropy and the loss function of autoregressive LMs (just to highlight them, not trying to say anything you don’t already know):
The former are (approximately) symmetric, the latter isn’t (it can be much harder to predict a string front-to-back than back-to-front)
The former calculate compression values as properties of a string (up to choice of UTM). The latter calculates compression values as properties of a string, a data distribution, and a model (and even then doesn’t strictly determine the response, if the model isn’t expressive enough to fully capture the distribution).
So it seems like there’s plenty of room for a measure which is “more sensible” than the former and “more principled” than the latter.
Yeah follow-up posts will definitely get into that!
To be clear: (1) the initial posts won’t be about Crutchfield work yet—just introducing some background material and overarching philosophy (2) The claim isn’t that standard measures of information theory are bad. To the contrary! If anything we hope these posts will be somewhat of an ode to information theory as a tool for interpretability.
Adam wanted to add a lot of academic caveats—I was adamant that we streamline the presentation to make it short and snappy for a general audience but it appears I might have overshot ! I will make an edit to clarify. Thank you!
I agree with you about the importance of Kolmogorov complexity philosophically and would love to read a follow-up post on your thoughts about Kolmogorov complexity and LLM interpretability:)
Looking forward to the rest of the sequence!
You are just not using a proper scoring rule. If you used log or brier score, then predicting 50% head, 50% tails would indeed give the highest score.
Here you are cheating by using an external library. Just calling random_bits[i] is also very compact. You might at least include your pseudo-random number generator.
Maybe I’ve read too much Jaynes recently, but I think quoting ‘complexity’ in that sentence is misplaced. Random/pseudo-random processes really are complex. Jaynes actually uses the coin tossing example and shows how to easily cheat at coin tossing in an undetectable way (page 317). Random sounds simple, but that’s just our brain being ‘lazy’ and giving up (beware mind projection fallacy blah...). If you don’t have infinite compute (as seems to be the case in reality), you must make compromises, which is why this looks pretty promising.
These points are well taken. I agree re: log-score. We were trying to compare to the most straightforward/naive reward maximization setup. Like in a game where you get +1 point for correct answers and −1 point for incorrect. But I take your point that other scores lead to different (in this case better) results.
Re: cheating. Yes! That is correct. It was too much to explain in this post, but ultimately we would like to argue that we can augment Turing Machines with a heat source (ie a source of entropy) such that it can generate random bits. Under that type of setup the “random number generator” becomes much simpler/easier than having to use a deterministic algorithm. In addition, the argument will go, this augmented Turing machine is in better correspondence with natural systems that we want to understand as computing.
Which leads to your last point, which I think is very fundamental. I disagree a little bit, in a specific sense. While it is true that “randomness” comes from a specific type of “laziness,” I think it’s equally true that this laziness actually confers computational powers of a certain sort. For now, I’ll just say that this has to do with abstraction and uncertainty, and leave the explanation of that for another post.
interested to see what’s next.
One notable absence is the Solomonoff prior, where you weight predictions (of prefix-free TMs) by 2−K to get a probability distribution. Related would be approximations like MML prediction.
Another nitpick would be that Shannon entropy is defined for distributions, not just raw strings of data, so you also have to fix the inference process you’re using to extract probabilities from data.
These are both great points and are definitely going to be important parts of where the story is going! Probably we could have done a better job with explication, especially with that last point, thanks. Maybe one way to think about it is, what are the most useful ways we can convert data to distributions, and what do they tell us about the data generation process, which is what the next post will be about.
Sounds very related to https://towardsdatascience.com/curiosity-in-deep-reinforcement-learning-understanding-random-network-distillation-747b322e2403 , which deals with the problem of RL agents staring at a source of noise because they can’t predict it.
Have you heard about pseudoentropy? The pseudoentropy of a distribution is equal to the highest entropy among all computationally indistinguishable distributions. I think this might be similar to what you’re looking for.
No I haven’t! That sounds very interesting, I’ll definitely take a look, thanks. Do you have a particular introduction to it?
No, I don’t. The resources I saw on a quick Google search were rather poor as well.
You are using the wrong formula/using the formula wrong. Shannon actually uses markov models for the process you are describing and defines Entropy as the limit of ever greater n-grams. I’d agree that n-grams aren’t necessarily the best model of what compression looks like.
Wow, despite no longer being endorsed, this comment is actually extremely relevant to the upcoming posts! I have to admit I never went through the original paper in detail. It looks like Shannon was even more impressive than I realized! Thanks, I’ll definitely have to go through this slowly.
Yeah it’s so relevant that I assumed I must have overlooked something.