As in the ELK report, there is a plausible argument for why there exists a speed prior that would prefer the direct translator to the human imitator. Naively, the problem with the speed prior here is that the computation required for the human imitator is proportional to the size of the human's Bayes net, whereas the computation required for the direct translator is proportional to the size of the model's Bayes net—and in the superhuman limit we should expect the latter to be substantially larger than the former.

The argument in the ELK report, however, is that while this argument is valid in the limit, there's reason to believe it might be invalid for all the finite cases that we care about. That's because perfect inference in either Bayes net, and thus perfect loss, shouldn't be possible in any finite case. Thus, the performance of the ontology mapping function, and thus its loss, should be proportional to how much computation it puts into its inference task—for which the direct translator has a big advantage, since it gets to reuse the computation performed by the model.

The obvious response here, and the response that is given in the ELK report, is that the above argument is very fragile—it relies on inference in the human's Bayes net being too hard to always get right on the training distribution, which is a strong assumption both about the difficulty of inference and the complexity of the training data.

Furthermore, as the ELK report also notes, it's not enough for the direct translator to just be more efficient than the human imitator: the direct translator has to be a cost-effective improvement (in terms of how much loss/computation it saves per increase in description complexity) compared to all other possible mappings.

Overall, however, despite the issues with this approach, we agree with Paul, Mark, and Ajeya’s conclusion that it is the most promising approach currently on offer:^{[1]}

In order to ensure we learned the direct translator, we would need to change the training strategy to ensure that it contains sufficiently challenging inference problems, and that doing direct translation was a cost-effective way to improve speed (i.e. that there aren’t other changes to the human simulator that would save even more time).

Compared to all our previous counterexamples, this one offers much more hope. We can’t rule out the possibility of a clever dataset where the direct translator has a large enough computational advantage to be preferred, and we leave it as an avenue for further research. In Section: penalizing inconsistencies we discuss an additional ingredient that we think makes computation-complexity-based approaches more plausible.

If our training process looks at the relationship between different inputs, then a bad reporter might also need to consider lots of alternative inputs before making its decision. Moreover, if we choose sets of inputs randomly, then a bad reporter might not know which other inputs it needs to think about, and there is an exponentially large space of possible situations it potentially needs to worry about. So we could imagine getting to a situation where “just answer honestly” is the computationally easiest way to solve the problem.

Rather than merely imitating human answers, a bad reporter must now play the game “look consistent according to the checks that a human can apply.”

This raises two key questions:

Does there exist a “cheating” strategy in the “look consistent game”?

If so, is it easy for a bad reporter to execute? Otherwise, playing this game might force the reporter to use much more computation than the direct translator.

If the answers to both questions are “yes” then we have a problem.

In Appendix: inconsistency across inputs we discuss these questions in detail for a particular concrete family of consistency checks. For now we just give some general heuristic arguments:

We suspect that there is always some cheating strategy. Otherwise the consistency checks suffice to determine the truth all on their own. But in fact it seems like inductive biases (e.g. “simple models that have worked in the past are likely to work in the future”) seems extremely important for distinguishing between multiple consistent stories.

If there is a cheating strategy, we think there are likely to be possible worlds where it can be found quickly, based on the same argument made in Section: speed. The “look consistent game” mostly depends on the human model, and so it may be possible to play the game well enough to beat direct translation using an amount of effort that doesn’t scale with the complexity of the predictor’s Bayes net. If that happens, then for a sufficiently complicated predictor it will be easier to play the consistency game than to directly translate.

That said, we think that this argument is very far from watertight, and that it is quite possible there exists some consistency check that provides a large computational advantage for direct translation.

Overall, we are currently less optimistic about adding consistency helping very much, as we don’t think it’s too hard to just use human imitation for questions humans can answer and use some consistent world model for the rest (resulting in the simplest/fastest consistent world rather than the true world). That being said, we do think consistency strictly helps, since forcing the human imitator to do such hallucination only hurts it in comparison to the direct translator. We’ll call the circuit prior + consistency the “consistent circuit prior.”

Penalizing reporters that work with many different predictors

Another strategy proposed by Paul, Mark, and Ajeya is to penalize ontology mapping functions that work with many different underlying predictor models, the intuition being that the direct translator only works for the original model, whereas the human imitator works for essentially any model.

As formulated in the ELK report, we think this approach suffers from some pretty debilitating counterexamples—though, as we will demonstrate later, we think there is a way to rehabilitate it. Let’s start, though, with the counterexamples.

In order to game this objective, a bad reporter could “memorize” what the predictor is supposed to look like, and then decide to answer questions in a nonsensical way if the predictor is different from what it expects. If the predictor is exactly like it expects, then it can answer questions just like the human simulator.

This bad reporter would only work for exactly one predictor, and therefore it gets the maximum possible reward for “working with fewer predictors.” Moreover, this bad reporter didn’t have to do very much extra computation.

So the only way that we will end up preferring direct translation is if this bad reporter ends up requiring more parameters. This is superficially plausible, because the bad reporter needed to memorize the intended predictor.

Unfortunately, this doesn’t help very much if the predictor’s Bayes net is very simple to describe. And it seems possible to have a Bayes net which is simple to describe (meeting the criteria of this counterexample), but which has a huge number of nodes and arrows (meeting the criteria needed to counterexample the complexity and computation penalties).

For example, consider a case where the predictor’s Bayes net is a low-level model of physics. Although there are many atoms, they all behave according to the same simple laws. So we can have a situation where the predictor’s Bayes net is very simple to describe but still has a large number of nodes and arrows. We present a concrete example of this phenomenon in Appendix: game of life.

As Paul, Mark, and Ajeya argue, such a counterexample seems pretty difficult to overcome outright via this approach—especially with speed or simplicity as the underlying prior. However, such a counterexample is still consistent with this approach leading to a strict benefit for the direct translator compared to the human imitator, specifically a benefit proportional to the complexity of the predictor on the underlying prior.

Possible counterexample: Length/norm checking

Unfortunately, we think there is an even worse counterexample that removes that strict benefit. Suppose that, rather than memorize the entire predictor, the human imitator just memorizes the predictor’s length/norm and then outputs garbage if the predictor it’s given is smaller than that.

This costs substantially less complexity than memorizing the entire predictor, but results in exactly the same loss as memorizing the entire predictor. Fundamentally, that’s because the loss given in the ELK report just subtracts the norm of the lowest norm alternative predictor that works with the ontology mapping function. And the norm of the lowest norm predictor that works with such a norm-checking mapping will be the same as the norm of the original predictor, since that’s precisely what the ontology mapping function in such a case is checking.^{[2]}

The circuit distillation prior

In this section, we will propose a way to strictly improve the consistent circuit prior’s performance on ELK by leveraging a “fixed” version of the “penalizing reporters that work with many different models” approach.

First, some preliminaries:

Let M∈M:X→Y be some predictive model. Then, as in ELK, our goal will be to find some map f∈F:M×X×Q→A which uses M’s latent knowledge to answer questions.

Let D be our dataset of (x,y,q,a) tuples. We’ll assume that M is trained to predict y from x on this dataset using a simplicity prior.

Let f+ be the direct translator and f− the human imitator plus some hallucinatory consistent world model.

Let c:M→N be Boolean circuit size complexity and p:M→R be the circuit prior such that c(M)=−log2p(M). We’ll assume c and p can be applied equally well to M∈M and f∈F.

Let consistent:F×M→B be some consistency check over some dataset.

Let I:B→N be the indicator function such that I[true]=1 and I[false]=0.

Let fMXQ=A be shorthand for ∀(x,,q,a)∈D,f(M,x,q)=a.^{[3]}

Conceptually, the goal of p∗ is to capture the intuition that what makes f+ better than f− is that f+ compresses M in a way that f− doesn’t: f+ tells you way more about the structure of the world model that it’s translating from than f− does (f− just tells you that M has to contain a human somewhere). In our opinion, this captures the fundamental reason why f+ “works for fewer predictors” than f− and is closer to the fundamental justification behind why an approach like this might work.

Going forward, we’ll be referring to this prior as the “circuit distillation prior,” based on the idea that the p(M′=M|fM′XQ=A) term is essentially asking for the difficulty of “distilling” M into M′ conditional on fM′XQ=A. If you wanted to try to implement this prior in a concrete machine learning setup, such a distillation process would also be the place to start—though we're putting such implementation details outside of the scope of this post for now.

Possible counterexample: Length/norm checking

To start with, we want to explore why length/norm checking doesn’t work as a counterexample to the distillation circuit prior. Note that, since our underlying prior is a circuit prior, the relevant norm here is circuit length, so we'll just be calling this counterexample length checking.

To do that, consider the following approximation to the complexity of p∗(M), conditioned on fMXQ=A∧consistent(f,M):

For the rest of this post, we’ll mostly be ignoring the fMXQ=A∧consistent(f,M) condition, since we’ll only be considering fs which satisfy it. Furthermore, for the rest of this post, we’ll also just be accepting the

c(M′=M|fM′XQ=A)∝−min{c(M′)|fM′XQ=A}

assumption—but for this section, the validity or invalidity of that assumption is critical to why length checking doesn’t work, so we’ll be focusing on it here.^{[4]}

Let f−length check be defined as

f−length check(M′,x,q)=f−(M′,x,q) if c(M′)=chardcoded else garbage

where chardcoded=c(M). In the next section, we’ll explore whether the usage of f− on its own might constrain M′, but for right now, since we just want to focus on the length-checking, we'll assume that f− doesn’t depend on M′ at all (e.g. it hardcodes its human model).^{[5]}

Now, let’s consider c∗(f−length check) without using the above approximation:

This works because M is only one of 2c(M) possible models of size c(M) and the circuit prior selects uniformly from among models of the same size.^{[6]}

Furthermore, since we’re assuming f− doesn’t constrain M′ at all, we also have c∗(f−)=c(f−)+c(M),^{[7]} which means we have c∗(f−)=c∗(f−length check) and thus length-checking does not help f− at all under this prior.

However, if we naively do the same analysis using the above approximation, we get

which seems to make the c(M) term disappear! The problem here, we think, is that this approximation is only valid when we’re thinking of M as an infinite bitstring. Concretely, if we add random extra gates to any M′ smaller than M before that M′ is fed into f—thus forcing f to treat M as an infinite bitstring—length-checking should be impossible. Since we believe this approximation does work if we make that assumption, we will be continuing to use this approximation throughout this post, just under the assumption that we’re treating everything as infinite bitstrings.

However, we think that the fact that this problem only occurs at all for the approximated version further demonstrates why the original distillation term is the conceptually correct form for this term to take. This also helps shed light on what went wrong with the ELK report’s version, which is that they started from the approximated version rather than the full distillation term.

Possible counterexample: The human imitator

Now, let’s compare c∗(f+) to c∗(f−). We’ll address the concern we raised previously of f− on its own significantly constraining M′ here. Since we’re conditioning on consistent(f,M), we’ll assume that f− includes some sort of hallucinatory consistent world model for answering questions that the human gets wrong.

Fundamentally, we have to compare f+ and f− on two terms: c(f) and −min{c(M′)|fM′XQ=A}. All of the analysis from the basic circuit prior section above is about whether the c(f) term might just work on its own, which remains unclear—but regardless that analysis won’t change here. All we want to show is that adding the −min{c(M′)|fM′XQ=A} term strictly helps in terms of advantaging f+ more than f−.

So, fundamentally, we need to ask what the smallest M′ is that causes each f to correctly answer questions.

For f+, M′ seemingly has to be the size of M, since f+, as a direct translation map, does essentially none of the work of actually computing the answers to the questions, so all of those answers must already exist in M′, and must exist in the same form as in M so that f+ knows how to look for them.

However, there is a potential way that M′ for f+ might be able to be smaller than M. Most notably, you could have M′ just try to use f− to produce answers to questions, then backtranslate those answers into the model’s ontology, such that M′=f+−1∘f−∘H where H is the human model component of M. For such an M′ to be smaller than M, however—assuming c(f+−1)≈c(f+)—you would need c(f+)<c(M).^{[8]} In that case, however, we now have a tight enough bound on c(f+) that the overall problem becomes substantially easier. In particular, if we assume that the performance of f+ and f− are approximately proportional to the amount of compute they spend on their respective inference tasks, then the fact that f+ gets to use M’s inference for free means that c(f−) would need to be at least comparable to c(M)—but in that case, c(f+)<c(M) would just give us c(f+)<c(f−), meaning that the distillation circuit prior would just fully solve the problem.^{[9]} Thus, for the rest of this post, we’ll assume that c(f+)>c(M) such that we don’t get a smaller M′ this way and thus the smallest M′ for f+ is just M.

Now, let’s consider what the smallest M′ that makes f− work might look like. In particular, we need to know what exactly f− depends on in M. It seems that there is really only one way in which f− can make use of M, which is for f− to extract its human model from M. The only other thing that f− needs is the camera inputs, but it gets those for free from x, so it has no need to extract them. f− does also then need to do its own inference in the human model given those camera inputs—but that’s not something that’s available in M anywhere. Given that f− depends on M just through M’s model of the human,^{[10]} it becomes clear that the smallest M′ that causes f− to work is an M that includes only the human.

where H and M−H are the human model and non-human-model components of M, respectively. As is clear from the final line, adding the distillation term has improved the default ask of c(f+)<c(f−) into the easier ask of c(f+)<c(f−)+c(M−H), essentially giving f+ a leg up proportional to c(M−H).

That being said, though the circuit distillation prior is clearly a strict improvement here, since the leg up is proportional to c(M−H), the circuit distillation prior fails to give us c∗(f+)>c∗(f−) if the circuit size of M is very small relative to the circuit size of f+, as in the basic model checking counterexample to the penalizing reporters that work with many models proposal from the ELK report. Though we think this is much less likely under a circuit prior than a simplicity prior, we won’t try to argue for it here—for now, the point is just that regardless the circuit distillation prior is still a strict improvement.

Possible counterexample: Basic model checking

One potential problem with the above analysis is that, though f− doesn’t need to depend on anything other than H in M, it could simply force a dependence through directly checking certain parts of M′ against some hardcoded M. We’ll call this counterexample f−check, which is implemented by first checking some of the gates in M′ against a hardcoded list of desired gates, then running f− if the checks pass and outputting garbage if the checks fail. Concretely, let

f−check(M′,x,q)=f−(M′,x,q) if check(Mhardcoded,M′) else garbage

where check compares the gates of the circuits passed into it and Mhardcoded is some set of hardcoded gates.

Here’s the trick, however: for each gate that is specified in Mhardcoded, bothmin{c(M′)|f−checkM′XQ=A} and c(f−) are made larger by exactly one gate. That’s because checking one gate in M′ takes one gate in f−check (specifically one equality/XNOR gate) and simultaneously for each gate checked the smallest M′ goes up by only one gate, since now it just has to add that gate.^{[11]}

Therefore f−check is strictly worse than f−, which means—unlike for the penalizing reporters that work with many predictors proposal in the ELK report—basic model checking doesn’t function as a counterexample to the distillation circuit prior at all.^{[12]}

Possible counterexample: Efficient model checking

In the previous case, we showed that simply checking gates in M′ against gates in Mhardcoded doesn’t work as a counterexample. But what if there’s a more efficient way of checking for M?

Consider f−is_M defined as

f−is_M(M′,x,q)=f−(M′,x,q) if is_M(M′) else garbage

where is_M is some efficient way of checking whether M′ is M−H (we only need to check the non-human-model part since f− should pin down the rest).^{[13]} We’ll formalize such efficiency by postulating that

c(is_M)<min{c(M′)|is_M(M′)}=c(M−H).

To start with, there’s a simple argument for why such an is_M seemingly can’t exist: is_M should have to look at each gate in M′ up to the length of M−H, otherwise it shouldn’t be able to constrain them. Looking at a gate should require at least one gate. Thus, it should be that c(is_M)≥c(M−H), which contradicts our efficiency assumption. However, there is a potential flaw in this argument, which is that is_M might be able to check the results of certain computations in M′ in such a way that constrains the gates producing them without having to look at those gates directly. Thus, to start with, we get the condition that, for is_M to exist, it has to somehow cleverly look at only small portions of M′ while still constraining the rest of M′.

Furthermore, note that, if the bits in M−H are sampled randomly, such an is_M is mathematically impossible for simple information-theoretic reasons. Of course, they’re not random, but they’re pretty close: they’re simplicity distributed, since we postulated that M was trained using a simplicity prior.

This leads us to an additional fact that we know about is_M: it can’t be simpler on a simplicity prior than M−H, otherwise M−H wouldn’t be the simplest world model that fits the data, since a simpler world model would be available as

M∗−H(x)=argminM′{c(M′)|is_M(M′)}(x)

assuming that we pay essentially no additional complexity for the argmin, which should be true for a simplicity prior.^{[14]}

Thus, is_M needs to be some uniquely-M−H-identifying function that only checks small parts of M−H, has a lower circuit complexity than M−H, but is more complex on a simplicity prior than M−H. That’s a very strong set of conditions that makes it quite hard to produce such an is_M, though we can’t completely rule out its existence.^{[15]}

However, even if such an is_M is possible, the circuit distillation prior would still be strictly better than the consistent circuit prior alone, since, to get c∗(f+)<c∗(f−is_M), we need

Thus, we think it’s worth pointing out that the circuit distillation prior makes this problem strictly less bad: anything that f hardcodes that it could get by looking it up in M reduces f’s dependence on M and thus decreases the complexity of the simplest M′ that makes f work. As a result, we suspect that a circuit distillation prior would be substantially better at generalization and thus more performance competitive than a consistent circuit prior.

You could try to get around this by looking for the smallest predictor model that’s consistent with the ontology mapping and also actually produces good predictions—but then you would always just get the same predictor model, since by assumption the predictor model is the simplest model that makes good predictions. ↩︎

If you want, you can also require fM to be able to predict y from x, e.g. with the hope of forcing fM to have a world model that is as good as that of M. However, since f− can just reuse M to make such predictions, this doesn’t really change anything. ↩︎

If we don’t make this assumption, we get basically the same analysis but with M−H instead of M. ↩︎

We're also assuming that c(chardcoded)+c(c)+c(garbage)≈0 here, which is fine in this case since we just want to demonstrate that length-checking doesn't help—if we relax that assumption, we get that length-checking not only doesn't help, but actually hurts, as we show with the basic model checking counterexample later. ↩︎

This is because, assuming f− doesn't constrain M′ at all,
c∗(f−)=c(f−)+c(M′=M|f−M′XQ=A)=c(f−)+c(M′=M)=c(f−)+c(M).↩︎

This is because you would need
c(M′)<c(M)c(f+−1∘f−∘H)<c(M)c(f+−1)+c(f−)+c(H)<c(M)
which requires c(f+−1)<c(M). ↩︎

This isn’t completely trivial, since we need to also verify that in this case f− doesn’t perform better than f+ on the distillation term—but in fact even in this case f+ still does better than f−, since f− only needs M′=H, whereas the M′ given here needs H as well as f− and f+−1.
Furthermore, this fact ensures that, even if the above argument is wrong and we can have c(f+)<c(M) without c(f+)<c(f−), the distillation circuit prior is still a strict improvement, just now proportional to c(f+−1)+c(f−) rather than the c(M−H) that we’ll derive later. ↩︎

We can also compare to a version of f− that hardcodes the human model, but such an f− just does strictly worse, so it’s not really worth considering here. ↩︎

f−check can also try hashing M′ and checking the hash instead of checking the gates directly, but that doesn’t help—each bit of the hash that you check has the same two-sided effect. ↩︎

It’s worth pointing out, however, that this is largely because we’ve moved the effect entirely into the distillation term—the advantage for f+ over f− is still proportional to c(M), as we pointed out previously. ↩︎

For example, is_M might try to specify some good prior on M—based on facts like M being simplicity-distributed, the world being consistent, M being consistent with the human model, etc.—and then check for high probability on that prior. ↩︎

Note that, if we use a distillation simplicity prior rather than a distillation circuit prior, this leads to a blatant contradiction. Of course, we then lose all the aforementioned benefits of using a circuit prior. ↩︎

Note that f+ is not usable for such an is_M, since we’re assuming c(f+)>c(M). ↩︎

Thanks to Paul Christiano for useful comments and feedback.## The basic circuit prior setup

We’ll start with the basic setup that we’re trying to improve upon, which is trying to solve ELK via the use of a Boolean circuit size prior. Previously, Evan summarized Paul, Mark, and Ajeya’s argument for why this might work as follows:

Overall, however, despite the issues with this approach, we agree with Paul, Mark, and Ajeya’s conclusion that it is the most promising approach currently on offer:

^{[1]}Furthermore, we agree that, as Paul, Mark, and Ajeya argue, adding consistency might improve this approach as well:

Overall, we are currently less optimistic about adding consistency helping very much, as we don’t think it’s too hard to just use human imitation for questions humans can answer and use some consistent world model for the rest (resulting in the simplest/fastest consistent world rather than the true world). That being said, we do think consistency strictly helps, since forcing the human imitator to do such hallucination only hurts it in comparison to the direct translator. We’ll call the circuit prior + consistency the “consistent circuit prior.”

## Penalizing reporters that work with many different predictors

Another strategy proposed by Paul, Mark, and Ajeya is to penalize ontology mapping functions that work with many different underlying predictor models, the intuition being that the direct translator only works for the original model, whereas the human imitator works for essentially any model.

As formulated in the ELK report, we think this approach suffers from some pretty debilitating counterexamples—though, as we will demonstrate later, we think there is a way to rehabilitate it. Let’s start, though, with the counterexamples.

## Possible counterexample: Basic model checking

In the ELK report, Paul, Mark, and Ajeya argue for the following counterexample to the above approach:

As Paul, Mark, and Ajeya argue, such a counterexample seems pretty difficult to overcome outright via this approach—especially with speed or simplicity as the underlying prior. However, such a counterexample is still consistent with this approach leading to a strict benefit for the direct translator compared to the human imitator, specifically a benefit proportional to the complexity of the predictor on the underlying prior.

## Possible counterexample: Length/norm checking

Unfortunately, we think there is an even worse counterexample that removes that strict benefit. Suppose that, rather than memorize the entire predictor, the human imitator just memorizes the predictor’s length/norm and then outputs garbage if the predictor it’s given is smaller than that.

This costs substantially less complexity than memorizing the entire predictor, but results in exactly the same loss as memorizing the entire predictor. Fundamentally, that’s because the loss given in the ELK report just subtracts the norm of the lowest norm alternative predictor that works with the ontology mapping function. And the norm of the lowest norm predictor that works with such a norm-checking mapping will be the same as the norm of the original predictor, since that’s precisely what the ontology mapping function in such a case is checking.

^{[2]}## The circuit distillation prior

In this section, we will propose a way to strictly improve the consistent circuit prior’s performance on ELK by leveraging a “fixed” version of the “penalizing reporters that work with many different models” approach.

First, some preliminaries:

^{[3]}Then, we’ll define our new prior p∗ as

p∗(f)=p(f)⋅I[f M X Q=A]⋅I[consistent(f,M)]⋅p(M′=M | f M′ X Q=A).

Conceptually, the goal of p∗ is to capture the intuition that what makes f+ better than f− is that f+ compresses M in a way that f− doesn’t: f+ tells you way more about the structure of the world model that it’s translating from than f− does (f− just tells you that M has to contain a human somewhere). In our opinion, this captures the fundamental

reasonwhy f+ “works for fewer predictors” than f− and is closer to the fundamental justification behind why an approach like this might work.Going forward, we’ll be referring to this prior as the “circuit distillation prior,” based on the idea that the p(M′=M | f M′ X Q=A) term is essentially asking for the difficulty of “distilling” M into M′ conditional on f M′ X Q=A. If you wanted to try to implement this prior in a concrete machine learning setup, such a distillation process would also be the place to start—though we're putting such implementation details outside of the scope of this post for now.

## Possible counterexample: Length/norm checking

To start with, we want to explore why length/norm checking doesn’t work as a counterexample to the distillation circuit prior. Note that, since our underlying prior is a circuit prior, the relevant norm here is circuit length, so we'll just be calling this counterexample length checking.

To do that, consider the following approximation to the complexity of p∗(M), conditioned on f M X Q=A∧consistent(f,M):

c∗(f)=−log2p∗(f)=c(f)+c(M′=M | f M′ X Q=A)≈c(f)+c(M)−min{c(M′) | f M′ X Q=A)∝c(f)−min{c(M′) | f M′ X Q=A}.

For the rest of this post, we’ll mostly be ignoring the f M X Q=A∧consistent(f,M) condition, since we’ll only be considering fs which satisfy it. Furthermore, for the rest of this post, we’ll also just be accepting the

c(M′=M | f M′ X Q=A)∝−min{c(M′) | f M′ X Q=A}

assumption—but for this section, the validity or invalidity of that assumption is critical to why length checking doesn’t work, so we’ll be focusing on it here.

^{[4]}Let f−length check be defined as

f−length check(M′,x,q)=f−(M′,x,q) if c(M′)=chardcoded else garbage

where chardcoded=c(M). In the next section, we’ll explore whether the usage of f− on its own might constrain M′, but for right now, since we just want to focus on the length-checking, we'll assume that f− doesn’t depend on M′ at all (e.g. it hardcodes its human model).

^{[5]}Now, let’s consider c∗(f−length check) without using the above approximation:

c∗(f−length check)=c(f−length check)+c(M′=M | f−length check M′ X Q=A)=c(f−)+c(chardcoded)+c(c)+c(garbage)+c(M′=M | c(M′)=c(M))≈c(f−)−log2p(M′=M | c(M′)=c(M))=c(f−)−log212c(M)=c(f−)+log2(2c(M))=c(f−)+c(M).

This works because M is only one of 2c(M) possible models of size c(M) and the circuit prior selects uniformly from among models of the same size.

^{[6]}Furthermore, since we’re assuming f− doesn’t constrain M′ at all, we also have c∗(f−)=c(f−)+c(M),

^{[7]}which means we have c∗(f−)=c∗(f−length check) and thus length-checkingdoes not help f− at all under this prior.However, if we naively do the same analysis using the above approximation, we get

c∗(f−length check)≈c(f−length check)+c(M)−min{c(M′) | f−length check M′ X Q=A)=c(f−)+c(chardcoded)+c(c)+c(garbage)+c(M)−min{c(M′) | c(M′)=c(M))≈c(f−)+c(M)−c(M)=c(f−)

which seems to make the c(M) term disappear! The problem here, we think, is that this approximation is only valid when we’re thinking of M as an infinite bitstring. Concretely, if we add random extra gates to any M′ smaller than M before that M′ is fed into f—thus forcing f to treat M as an infinite bitstring—length-checking should be impossible. Since we believe this approximation does work if we make that assumption, we will be continuing to use this approximation throughout this post, just under the assumption that we’re treating everything as infinite bitstrings.

However, we think that the fact that this problem only occurs at all for the approximated version further demonstrates why the original distillation term is the conceptually correct form for this term to take. This also helps shed light on what went wrong with the ELK report’s version, which is that they started from the approximated version rather than the full distillation term.

## Possible counterexample: The human imitator

Now, let’s compare c∗(f+) to c∗(f−). We’ll address the concern we raised previously of f− on its own significantly constraining M′ here. Since we’re conditioning on consistent(f,M), we’ll assume that f− includes some sort of hallucinatory consistent world model for answering questions that the human gets wrong.

Fundamentally, we have to compare f+ and f− on two terms: c(f) and −min{c(M′) | f M′ X Q=A}. All of the analysis from the basic circuit prior section above is about whether the c(f) term might just work on its own, which remains unclear—but regardless that analysis won’t change here. All we want to show is that adding the −min{c(M′) | f M′ X Q=A} term strictly helps in terms of advantaging f+ more than f−.

So, fundamentally, we need to ask what the smallest M′ is that causes each f to correctly answer questions.

For f+, M′ seemingly has to be the size of M, since f+, as a direct translation map, does essentially none of the work of actually computing the answers to the questions, so all of those answers must already exist in M′, and must exist in the same form as in M so that f+ knows how to look for them.

However, there is a potential way that M′ for f+ might be able to be smaller than M. Most notably, you could have M′ just try to use f− to produce answers to questions, then backtranslate those answers into the model’s ontology, such that M′=f+ −1∘f−∘H where H is the human model component of M. For such an M′ to be smaller than M, however—assuming c(f+ −1)≈c(f+)—you would need c(f+)<c(M).

^{[8]}In that case, however, we now have a tight enough bound on c(f+) that the overall problem becomes substantially easier. In particular, if we assume that the performance of f+ and f− are approximately proportional to the amount of compute they spend on their respective inference tasks, then the fact that f+ gets to use M’s inference for free means that c(f−) would need to be at least comparable to c(M)—but in that case, c(f+)<c(M) would just give us c(f+)<c(f−), meaning that the distillation circuit prior would just fully solve the problem.^{[9]}Thus, for the rest of this post, we’ll assume that c(f+)>c(M) such that we don’t get a smaller M′ this way and thus the smallest M′ for f+ is just M.Now, let’s consider what the smallest M′ that makes f− work might look like. In particular, we need to know what exactly f− depends on in M. It seems that there is really only one way in which f− can make use of M, which is for f− to extract its human model from M. The only other thing that f− needs is the camera inputs, but it gets those for free from x, so it has no need to extract them. f− does also then need to do its own inference in the human model given those camera inputs—but that’s not something that’s available in M anywhere. Given that f− depends on M just through M’s model of the human,

^{[10]}it becomes clear that the smallest M′ that causes f− to work is an M that includesonlythe human.Thus, to get c∗(f+)<c∗(f−), we need

c∗(f+)<c∗(f−)c(f+)−min{c(M′) | f+ M′ X Q=A}<c(f−)−min{c(M′) | f− M′ X Q=A}c(f+)−c(M)<c(f−)−c(H)c(f+)−c(M−H)<c(f−)c(f+)<c(f−)+c(M−H)

where H and M−H are the human model and non-human-model components of M, respectively. As is clear from the final line, adding the distillation term has improved the default ask of c(f+)<c(f−) into the easier ask of c(f+)<c(f−)+c(M−H), essentially giving f+ a leg up proportional to c(M−H).

That being said, though the circuit distillation prior is clearly a strict improvement here, since the leg up is proportional to c(M−H), the circuit distillation prior fails to give us c∗(f+)>c∗(f−) if the circuit size of M is very small relative to the circuit size of f+, as in the basic model checking counterexample to the penalizing reporters that work with many models proposal from the ELK report. Though we think this is much less likely under a circuit prior than a simplicity prior, we won’t try to argue for it here—for now, the point is just that regardless the circuit distillation prior is still a strict improvement.

## Possible counterexample: Basic model checking

One potential problem with the above analysis is that, though f− doesn’t need to depend on anything other than H in M, it could simply force a dependence through directly checking certain parts of M′ against some hardcoded M. We’ll call this counterexample f−check, which is implemented by first checking some of the gates in M′ against a hardcoded list of desired gates, then running f− if the checks pass and outputting garbage if the checks fail. Concretely, let

f−check(M′,x,q)=f−(M′,x,q) if check(Mhardcoded,M′) else garbage

where check compares the gates of the circuits passed into it and Mhardcoded is some set of hardcoded gates.

Here’s the trick, however: for each gate that is specified in Mhardcoded,

bothmin{c(M′) | f−check M′ X Q=A} and c(f−) are made larger by exactly one gate. That’s because checking one gate in M′ takes one gate in f−check (specifically one equality/XNOR gate) and simultaneously for each gate checked the smallest M′ goes up by only one gate, since now it just has to add that gate.^{[11]}Now, analyzing the complexity c∗(f−check):

c∗(f−check)=c(f−check)−min{c(M′) | f−check M′ X Q=A}=c(f−)+c(check)+c(Mhardcoded)+c(garbage)−(c(H)+c(Mhardcoded))=c(f−)+c(check)+c(garbage)−c(H)=c∗(f−)+c(check)+c(garbage)>c∗(f−).

Therefore f−check is strictly worse than f−, which means—unlike for the penalizing reporters that work with many predictors proposal in the ELK report—basic model checking doesn’t function as a counterexample to the distillation circuit prior at all.

^{[12]}## Possible counterexample: Efficient model checking

In the previous case, we showed that simply checking gates in M′ against gates in Mhardcoded doesn’t work as a counterexample. But what if there’s a more efficient way of checking for M?

Consider f−is_M defined as

f−is_M(M′,x,q)=f−(M′,x,q) if is_M(M′) else garbage

where is_M is some efficient way of checking whether M′ is M−H (we only need to check the non-human-model part since f− should pin down the rest).

^{[13]}We’ll formalize such efficiency by postulating thatc(is_M)<min{c(M′) | is_M(M′)}=c(M−H).

To start with, there’s a simple argument for why such an is_M seemingly can’t exist: is_M should have to look at each gate in M′ up to the length of M−H, otherwise it shouldn’t be able to constrain them. Looking at a gate should require at least one gate. Thus, it should be that c(is_M)≥c(M−H), which contradicts our efficiency assumption. However, there is a potential flaw in this argument, which is that is_M might be able to check the results of certain computations in M′ in such a way that constrains the gates producing them without having to look at those gates directly. Thus, to start with, we get the condition that, for is_M to exist, it has to somehow cleverly look at only small portions of M′ while still constraining the rest of M′.

Furthermore, note that, if the bits in M−H are sampled randomly, such an is_M is mathematically impossible for simple information-theoretic reasons. Of course, they’re not random, but they’re pretty close: they’re simplicity distributed, since we postulated that M was trained using a simplicity prior.

This leads us to an additional fact that we know about is_M: it can’t be simpler on a simplicity prior than M−H, otherwise M−H wouldn’t be the simplest world model that fits the data, since a simpler world model would be available as

M∗−H(x)=argminM′{c(M′) | is_M(M′)}(x)

assuming that we pay essentially no additional complexity for the argmin, which should be true for a simplicity prior.

^{[14]}Thus, is_M needs to be some uniquely-M−H-identifying function that only checks small parts of M−H, has a lower circuit complexity than M−H, but is more complex on a simplicity prior than M−H. That’s a very strong set of conditions that makes it quite hard to produce such an is_M, though we can’t completely rule out its existence.

^{[15]}However, even if such an is_M is possible, the circuit distillation prior would still be strictly better than the consistent circuit prior alone, since, to get c∗(f+)<c∗(f−is_M), we need

c∗(f+)<c∗(f−is_M)c(f+)−min{c(M′) | f+ M′ X Q=A}<c(f−is_M)−min{c(M′) | f−is_M M′ X Q=A}c(f+)−c(M)<c(f−is_M)−c(M)c(f+)<c(f−)+c(is_M)

which still gives f+ a leg up, just now proportional to c(is_M) rather than c(M−H).

## Possible counterexample: Lookup tables

Another potential counterexample that we think is worth looking at here is the use of hard-coding/inlining in f. As Evan has discussed previously, we think this sort of thing can be hugely problematic for all types of speed priors, including Boolean circuit size.

Thus, we think it’s worth pointing out that the circuit distillation prior makes this problem strictly less bad: anything that f hardcodes that it could get by looking it up in M reduces f’s dependence on M and thus decreases the complexity of the simplest M′ that makes f work. As a result, we suspect that a circuit distillation prior would be substantially better at generalization and thus more performance competitive than a consistent circuit prior.

This includes any of the approaches from the recent ELK contest, none of which we have so far found particularly more compelling than a circuit prior. ↩︎

You could try to get around this by looking for the smallest predictor model that’s consistent with the ontology mapping and also actually produces good predictions—but then you would always just get the same predictor model, since by assumption the predictor model is the simplest model that makes good predictions. ↩︎

If you want, you can also require f M to be able to predict y from x, e.g. with the hope of forcing f M to have a world model that is as good as that of M. However, since f− can just reuse M to make such predictions, this doesn’t really change anything. ↩︎

Notably, this assumption was also one of the trickiest bits of “Answering questions honestly instead of predicting human answers: lots of problems and some solutions.” ↩︎

If we don’t make this assumption, we get basically the same analysis but with M−H instead of M. ↩︎

We're also assuming that c(chardcoded)+c(c)+c(garbage)≈0 here, which is fine in this case since we just want to demonstrate that length-checking doesn't help—if we relax that assumption, we get that length-checking not only doesn't help, but actually hurts, as we show with the basic model checking counterexample later. ↩︎

This is because, assuming f− doesn't constrain M′ at all, c∗(f−)=c(f−)+c(M′=M | f− M′ X Q=A)=c(f−)+c(M′=M)=c(f−)+c(M). ↩︎

This is because you would need c(M′)<c(M)c(f+ −1∘f−∘H)<c(M)c(f+ −1)+c(f−)+c(H)<c(M) which requires c(f+ −1)<c(M). ↩︎

This isn’t completely trivial, since we need to also verify that in this case f− doesn’t perform better than f+ on the distillation term—but in fact even in this case f+ still does better than f−, since f− only needs M′=H, whereas the M′ given here needs H as well as f− and f+ −1. Furthermore, this fact ensures that, even if the above argument is wrong and we can have c(f+)<c(M) without c(f+)<c(f−), the distillation circuit prior is still a strict improvement, just now proportional to c(f+ −1)+c(f−) rather than the c(M−H) that we’ll derive later. ↩︎

We can also compare to a version of f− that hardcodes the human model, but such an f− just does strictly worse, so it’s not really worth considering here. ↩︎

f−check can also try hashing M′ and checking the hash instead of checking the gates directly, but that doesn’t help—each bit of the hash that you check has the same two-sided effect. ↩︎

It’s worth pointing out, however, that this is largely because we’ve moved the effect entirely into the distillation term—the advantage for f+ over f− is still proportional to c(M), as we pointed out previously. ↩︎

For example, is_M might try to specify some good prior on M—based on facts like M being simplicity-distributed, the world being consistent, M being consistent with the human model, etc.—and then check for high probability on that prior. ↩︎

Note that, if we use a distillation simplicity prior rather than a distillation circuit prior, this leads to a blatant contradiction. Of course, we then lose all the aforementioned benefits of using a circuit prior. ↩︎

Note that f+ is not usable for such an is_M, since we’re assuming c(f+)>c(M). ↩︎