The natural abstraction hypothesis claims (in part) that a wide variety of agents will learn to use the same abstractions and concepts to reason about the world.

What's the simplest possible setting where we can state something like this formally? Under what conditions is it true?

One necessary condition to say that agents use 'the same abstractions' is that their decisions depend on the same coarse-grained information about the environment. Motivated by this, we consider a setting where an agent needs to decide which information to pass though an information bottleneck, and ask: when do different utility functions prefer to preserve the same information?

As we develop this setting, we:

unify and extend the Blackwell Informativeness and Good(er) Regulator theorems

investigate the minimum structure needed for strong natural abstractions (in this sense) to exist

give examples where strong natural abstractions a) exist b) don't exist c) exist at some levels of capability, but not at others - including cases where the natural abstractions at different sizes are orthogonal

demonstrate that (very) weak natural abstractions exist under weak conditions

formally connect natural abstractions to instrumental power-seeking incentives, and characterize them in a way inspired by Turner's power-seeking theorems.

(As far as I can tell, apart from the obvious cited Theorems, these results are original^{[1]})

Whereas Wentworth's abstraction work has focused on what natural abstractions might look like, and why we might expect them to exist, this work focuses on exploring what it would mean for something to be a natural abstraction in the first place. Rather than an attempt to answer the natural abstraction hypothesis, it is more an attempt to understand the question.

1. Base setting

Any agent exists within an environment that is bigger than itself. It therefore necessarily maps a large number of potential environment states to a smaller number of internal states. When it then chooses what action to take, this choice depends only on its internal state.

Roughly, we can consider this mapping from the environment to action-influencing internal states to be the agent's abstractions^{[2]}. We want to understand when different utility functions will share preferences about how to do this mapping - under the natural abstraction hypothesis, in appropriate conditions, there should be certain abstractions that are convergent across most utility functions.

To model this, we'll consider a game where:

There is some initial context

An agent writes a message, conditional on this context

The agent takes an action, conditional on the message

The agent gets some utility that depends on the context and its action.

We'll keep everything finite to start - any infinities we want we should come by honestly, by taking limits. Our one concession to this is that we'll allow normal real-valued probabilities and utilities (though we'll see eventually how we could do without if we felt like it).

Formally, define: X: a set of context states
M: a set of signals A: a set of actions U: (X,A)→R, a utility function φ: X→ΔM, an encoder mapping states to a distribution of signals π: M→ΔA, a policy mapping signals to a distribution over actions

We allow φ and π to be stochastic (stochastic maps), but we'll also pay special attention to the case where they are deterministic (so effectively φ:X→M, π:M→A), because it is especially clean and factors apart some of the dynamics we're interested in.

Now, we are interested in preferences over φ assuming that π is chosen optimally. When are these preferences, and the optimal encoders, the same for different U? What happens as we vary |M|? For the time being, we can equally consider different U to be different agents or different tasks faced by the same agent. Later, we'll see some places where the two interpretations diverge.

As one might expect of such a simple setup, similar formalisms have been considered in many other contexts. Most directly, exactly this game is studied in the decision theory and economics literature - with partial overlap with our questions. There, the objects (φ,M) are commonly referred to as 'information structures' or 'Blackwell experiments'; we'll use the former term.

One other remark on notation: we'll often be interested in comparing different encoders φ,φ′, which may have different signal spaces Mφ,Mφ′. We'll write |φ| for ∣∣Mφ∣∣, the cardinality of the signal set.

1.1 Equivalence classes of encoders

One thing to note out of the gate: 'the same encoder' here shouldn't mean equality as functions. For our current purposes, we care only about their information content - so if φ,φ′ are the same except for a relabelling of M, we want to consider them identical (and they will certainly have the same attainable utility for any U).
Another way to say this: we want to quotient by Aut(M)=S|M|, i.e. the permutations of M, to get our real objects of interest. What are these objects?

In the deterministic case, they are the distinct possible sets of preimages {φ−1(m):m∈M} - which are just the |M|-part partitions of X.
In the general case, they are a more general partition-like object. Note that we can represent a stochastic map φ as an |M|×|X|column-stochastic matrix: a matrix with elements in [0,1] such that the sum of each column is 1: ∑|M|i=1[φ]ij=1. Then [φ]ij gives the probability that we encode signal i given we are in state j - that is, pφ(mi|sj).
If we are indifferent to permutations of M, then we are indifferent to permutations of the rows, so we have a set (rather than vector) of row vectors. (If X were instead a suitable topological space and φ continuous, then these would be exactly partitions of unity)

Sometimes it will be more convenient to think of φ as a function, sometimes to think of it as a partition Pφ, and sometimes as a matrix; we'll switch between all three as appropriate. However, keep in mind we really only care about φ up to equivalence in this sense.

1.2 Comparison of encoders

For a given utility function U, we take the value of an information structure to be the expected utility if we have that information structure and follow the optimal policy.

Formally, define U(φ)=maxπEX,π(φ(X))[U(x,a)]=maxπ∑X,A[π∘φ]xaU(x,a); we can also say it is maxπU((X,(π∘φ)(X))), extending U to a function on distributions by taking the expectation. (By convention we're assuming a uniform prior on X; this choice turns out to be irrelevant for our purposes).

We say that U prefers φ to φ′ if U(φ)≥U(φ′), which we'll also write φ≥Uφ′.

2. Basic properties for individual U

As a first step, to get a feel for the setting, let's start with some observations about what can happen for arbitrary individual U. These give us one bound on common properties - for something happen for 'many' U, it must certainly happen for some particular U.

2.0 M should be a bottleneck

One basic observation is that the problem becomes trivial if |M|≥|X| or |M|≥|A|. At that point, we can always pick the globally optimal action for each value of X. For this setting to be remotely interesting, M needs to be an information bottleneck.

2.1a Any deterministic partition is optimal for some U

This is also easy to see: for a partition P={p1,...,pk}, take any {a1,...,ak}⊆A and define U(x,ai)=1(x∈pi). Furthermore, any optimal partition for this U must be a refinement of P, and P is the unique optimal partition with k parts.

2.1b For any U, any nondeterministic φ is weakly dominated by some deterministic φ′

It is not quite literally the case that no nondeterministic φ is optimal for its size for any U. If U is indifferent between where to put x in the optimal policy, say U(x,πopt(m1))=U(x,πopt(m2)), then x can be freely sent to any mixture of m1 and m2. But there is always a deterministic φ′ of less than or equal size which does at least as well, and φ′ either does strictly better or is strictly smaller unless U is indifferent between some outcomes (which may have measure zero, depending on your assumptions).

Proof: See footnote^{[3]}; nothing surprising.

This motivates considering only partitions in the context of optimality for a single U (the remainder of section 2.)

2.2 Optimal partitions Pi,Pj can be orthogonal

Fixing U, write Pi for the optimal partition of size i. Then, there's not necessarily any relationship between Pi and Pj for i≠j.

For instance, take X=[1..3]×[1..4], A=[1,2]×[1..4] and
U(xi,∗,a1,i)=4U(x∗,i,a2,i)=5otherwise U(∗,∗)=0
Then the optimal partition of size 3 is {{(1,j):∀j},{(2,j):∀j},{(3,j):∀j}}, while the optimal partition of size 4 is {{(i,1):∀i},{(i,2):∀i},{(i,3):∀i},{(i,4):∀i}} (easy exercise: show this). These partitions are orthogonal - in other words, they have zero mutual information. This example can be extended to make any finite number of optimal Pj orthogonal.

2.3 Not every P1,...Pn is (uniquely) optimal for any U

Then, can any sequence of partitions whatsoever be optimal for the right U? Not uniquely so, at least (again ruling out e.g. the trivial case where U is constant and all partitions are optimal). Consider the following counterexample:

For P4 to be uniquely optimal, it must be that subdividing red provides more marginal benefit than subdividing green or blue, but optimality of P5 implies the opposite.

The general principle here: if two strictly size-optimal partitions both involve partitioning the same subset of X into k pieces, then they must do so the same way.

2.4 Strict monotonicity of ui

What about how the attainable utility varies with |M|? Write uk for the maximum expected utility attainable when |M|=k, and umax for the global maximum maxkuk. Obviously for i<j, we have ui≤uj; and in fact, if ui<umax, then ui<uj.

An easy way to see this is to consider Nmax=|Range(x→argmaxAU(x,a))| - the number of distinct optimal actions. Then if k<Nmax, we can always improve uk+1 by using the additional partition to move some k from a suboptimal action to an optimal action. If k≥Nmax then we can assign every x it's optimal action and uk=umax.

Naively, you might imagine there could be a scenario where more information doesn't help until you reach some threshold. For instance, suppose you can either a) do nothing or b) enter a 5-bit password to attempt to open a safe; the safe explodes if you fail, so it's only worth attempting if you definitely know the full password. However, even though you need to know the whole password to change your policy, you can convey the whole password a smaller fraction of the time. Even with only two states for M, you can have one state represent 'password unknown, do nothing', and the second (rare) state represent 'the password is exactly 00000, so enter that'. This result shows that to get that kind of thresholding behavior, we'd need to add something else to the model, i.e. that constrains the allowed partitions.

2.5 Marginal return can increase

We might expect that you use your first split to encode the most important information, the next split to encode the next most important information, etc., so that the marginal return to channel capacity is always decreasing. It turns out this is not necessarily the case. Consider the following counterexample:

X=[1..2]×[1..3], A=[0..2]×[1..3] and
U(x∗,∗,a0,∗)=0U(xi,∗,a1,i)=8U(x∗,i,a2,i)=21otherwise U(∗,∗)=−1000
With a single part, the best we can do is A0 everywhere, so u1=0; with three parts, we can divide along the environment's second dimension and get 21 everywhere, so the average is u3=21.
But we've chosen the utilities so the best we can do with two parts is to divide along the first dimension, achieving 8 average utility: any policy for a 2-part partition which uses a l=2 action must either suffer -1000 for some x, or divide between a0,0 and a single a2,i part on at most 1/3 of X, achieving at most 21/3 = 7 utility. So u2=8, and u2−u1=8<13=u3−u2.

3. Dominance over all U

Now that we've gotten a taste of the constraints that exist for individual U and ϕ, let's move to our main topic: common preferences among multiple U. Start from the opposite extreme: what preferences over information structures are shared by all possible utility functions?

This turns out to be exactly the question answered by the foundational result about information structures: the Blackwell Informativeness Theorem.

Unsurprisingly, given the strength of the requirement and lack of structure in our setting, these convergent preferences will be sparse. The result is not exactly a no-free-lunch theorem, since some information structures are indeed better than others, but it's not so far off in spirit: we can think of it stating that only the minimum possible preferences are shared.

Based on the barriers this case reveals, we'll then extend our setting so that non-trivial convergence is possible.

3.1 The Blackwell order

What is required for φ to be preferred to φ′ for all U? One clear sufficient condition is that given φ, we can use it to build φ′ by postprocessing - then we can imitate any policy for φ′. And we might expect that this is also necessary: if not, φ′ must not distinguish some situations which φ distinguishes, and we can construct someU that cares about the difference.

This is what the Blackwell Informativeness Theorem confirms; and once we cast it in just the right terms, the proof falls out almost immediately.

Define D(φ)={(X,π(φ(X))):π∈Mφ→ΔA}⊆Δ(X×A) to be the attainable outcome distributions of φ.

That is, an element d∈D(φ) is a probability distribution over (X,A) with pd(x,a)=pπ(a|m)pφ(m|x)p(x) for some π.
Note that we can equivalently consider D(φ) to be the set of stochastic maps π∘φ themselves, i.e. the likelihoods pπ(a|m)pφ(m|x), up to isomorphism by application to our uniform prior on X^{[4]}. In other words, D(φ)≅¯D(φ)={π∘φ:π∈M→ΔA}⊆{X→ΔA}; these can in turn be considered vectors in (ΔA)X.

Then we can state the theorem:

Blackwell Informativeness Theorem

The following are equivalent:

There exists some stochastic map γ such that φ′=γ∘φ. We also say this as: "φ′ is a garbling of φ".

D(φ′)⊆D(φ) for any A

For any A and U, we have φ′≤Uφ.

When these hold, write φ′≤BWφ.

Proof:

1)⟹2): If you φ′ is a garbling of φ, and you have φ, you can just do the garbling yourself to get φ′; so you can certainly act according to φ′ if you want to.

Let φ′=γ∘φ be a garbling of φ.

By definition, for any d′∈¯D(φ′) there is a π′ s.t. d′=π′∘φ′. Then defining π=π′∘γ, the diagram commutes^{[5]}, showing d′∈¯D(φ).

2)⟹1): If φ can achieve whatever φ′ can, then in particular it can achieve "be φ′", which makes φ′ a garbling.

Take A=M′ - then for π′=idM′, 2) says there is a π such that the diagram commutes. Then φ′=π∘φ is a garbling of φ.

2)⟹3): If D(φ) contains D(φ′), then it gives strictly more options, so your best option is at least as good - ∀U:maxD(φ′)U(d)≤maxD(φ)U(d).

3)⟹2): This is the one step which isn't immediate from the definitions - it's instead an application of a separation theorem.

Suppose 2) is false, say d′∈D(φ′)∖D(φ). Now D(φ) and {d′} are convex and compact, so the hyperplane separation theorem states that we can find a u∈R|X|⋅|A|,b∈R such that uTd<b for all d∈D(φ) and uTd′>b for d′∈{d′} - a hyperplane with normal vector u separating them. But this is exactly a U where φ does worse than φ′, contradicting 3). □

Notice that the equivalence classes of ≤BW are exactly what we said are really 'the same' information structure: one way to see this is to note that γA=B and γ′B=A imply γ′=γ−1, and the only stochastic matrices with an inverse within the stochastic matrices are permutation matrices, which just interchange the states of M. So the only way one information structure can be universally preferred to a second is if one 'contains' the other, and two information structures which all U are indifferent between are 'the same one'.

When φ and φ′ are deterministic, we can easily show that this is equivalent to Pφ being refinement of Pφ′ as a partition (from property 1, or by explicitly constructing U for property 3). For this case, we can then state the result as: the partial order of dominance of deterministic information structures is equal to their standard partial order as partitions.

We can also remark that this is a strictly stronger requirement than φ(X) having more mutual information with X than φ′(X). While I(X;φ′(X))≤I(X;φ(X)) is a necessary condition for φ′≤BWφ, it is not a sufficient one - φ must contain "a superset of" φ′'s information about X, rather than simply "more" information about X.

Some corollaries for partitions:

No partition of size k<|X| dominates any other (non-degenerate) partition of size ≥k

P is always the unique smallest partition dominating itself

The discrete partition {{x}:x∈X} uniquely dominates all other partitions (and is the unique smallest information structure which dominates all others in general).

3.2 What's missing

So we've seen that by default, there's no nontrivial superiority of information structures over all possible utility functions. What's missing to allow for more interesting convergence behavior? Two things:

A way to break the symmetry between different information structures. There's nothing to break the symmetry between different x or actions, and so (for example) only part-sizes to break the symmetry between different partitions. This fundamentally prevents strong convergence to exact information structures of a given size.

A non-extremal aggregation over utility functions. Looking at superiority over all utility functions is equivalent to considering only the worst-case. It also allows only boolean, not scalar, comparisons: φ either is or isn't better than φ′ for all U. Instead, looking at 'most' (and 'how many') utility functions will let us make finer distinctions between the usefulness of information structures.

The symmetry is the sharpest obstacle to stronger convergence, so we'll address 1) first.

4. Adding structure

4.1 Adding a 'system': the Good(er) Regulator Theorem

As a first example of what happens when we introduce more structure - and because it leads us another existing theorem - let's ask: what if we restrict the distinctions between x which the utility function is allowed to care about? What does this change about the preference dominance order?

The discrete version of this idea is for U to treat some values of X identically - at which point we can consider U to be defined on the equivalence classes of X, giving the 'causal' structure X∼→C→C×AU→R. What's the probabilistic version?

Well, we can simply take a stochastic map to the intermediate object, giving the structure Xf→ΔS→Δ(S×A)U→R, for some set S and stochastic map f (which we'll assume to be surjective^{[6]} for convenience; otherwise reduce S). This is a kind of dimensionality reduction (as even if |S|>|X|, certainly dim(Im(f))≤dim(X) as a vector space).

This is exactly the same setting, up to some choices of representation - the extra node Y just encodes the choice to look at a fixed encoder which must be shared^{[7]} by many^{[8]} policies and utility functions.

Taking the Good Regulator perspective, we can think of S being the system we care about, with f describing how its states depend on the observable X. The question the Gooder Regulator Theorem asks is in fact just: given a system (S,f), what's the minimal information structure that dominates all others?

The Gooder Regulator theorem tells us that it should in some sense be the posterior distribution P(S∣X) - we'll revisit this in a moment. (Meanwhile, in the discrete case: notice that X→C, as an equivalence relation, can also just be viewed as partition PC of X. We should expect that the optimal partition will just be PC.)

What about the full preference dominance order, like the Blackwell order gives us for the base setting?

4.1.1. The GR-Blackwell order

We can indeed give a characterization of this order which parallels the Blackwell Informativeness Theorem.

The key idea is to look at the new equivalence classes of φ with respect to U(φ): namely, the expected utility now depends exactly on what distribution of s∈S gets assigned each action a∈A. This suggests that we should look everything in terms of distributions over S.

We then find that for φ′ to be dominated by φ, it's not necessary for φ′ to be a garbling of φ (though this is of course still sufficient), but only necessary that "the mapping of system states to signals implied by φ′" is a garbling of "the mapping of system states to signals implied by φ". They will further be equivalent if and only if they imply the same joint distribution of (S,M).

Formally,

GR setting definitions

Define
F(φ):ΔS→ΔM by F(φ)(s)=∑x[f]xsφ(x)∑x[f]xs - the (stochastic) map induced by φ specifying 'how much do we map (x that result in) state s to signal m'.

Define the attainable S-outcome distributions to be:

DS(φ)={(S,π(F(φ)(S)))]S:π∈(M→ΔA)}⊆Δ(S×A)
or isomorphically, ¯DS(φ)={π∘F(φ):π∈M→ΔA}⊆{S→ΔA}

Just as the elements of D(φ) correspond to stochastic maps X→ΔA formed by π∘φ, the elements of DS(φ) correspond to stochastic maps ΔS→ΔA formed by π∘F(φ).

Then we have:

The GR-Blackwell order

The following are equivalent:

There exists a stochastic map γ such that F(φ′)=γ∘F(φ)

DS(φ′)⊆DS(φ) for any A

For any A and U:S×A→R, we have φ′≤Uφ.

When they hold, write φ′≤Sφ.

This is the same result as the Blackwell Informativeness Theorem, but after applying a functorF which quotients out the equivalences induced by f:X→ΔS (while leaving everything else unchanged):

And once we've stated it like this, if we look at the proof of the regular Blackwell order, we can see that each part carries over almost exactly. Substitute S and F(φ), and you've proved this new equivalence.

The only place an additional step is added is in (3)=>(2). Our separation theorem gives us (towards contradiction) a π′, u∈RS×A such that
∑S,A[π′∘F(φ′)]sausa>∑S,A[π∘F(φ)]sausa
for all π.

Meanwhile, U(φ) is
maxπ∑X,A[π∘φ]xaU(f(x),a); but after some rearranging, this can be written maxπ∑S,Ap(s)[π∘F(φ)]saU(s,a), where p(s)=∑X[f]xs.

This extra factor of p(s) is then no problem for the proof - we can just take ¯U(s,a)=usa/p(s) (instead of ¯U(s,a)=usa) as the contradictory utility function preferring φ′. But it highlights how a) the likelihood of states doesn't impact preferences over all utility functions (though it can matter for other questions), and b) even if we start by considering only a uniform prior on X, the introduction of the system S allows us get back a weighted version of our setting. (Indeed, if we redefine 'information structures' to be equivalence classes of F(φ), this is exactly what we would have - but with some restrictions on the set of possible information structures if f is nondeterministic).

Alternate precomposition form

In fact, another reflection of the same scaling invariance: while we normalized F(φ) to be a proper stochastic map (i.e. column-stochastic matrix) by dividing by ∑x[f]xs, the equation F(φ′)=γ∘F(φ) will hold iff the same equation holds^{[9]} with unnormalized F(φ). Inspecting our equation for F(φ)(s), we can observe that this unnormalized form of F(φ) as a matrix is actually just φfT. This gives us a nice alternate statement of prong 1), equivalent to all the rest:

1') There exists a stochastic matrix γ such that φ′fT=γφfT.

4.1.2 Gooder Regulator revisited

Let's explicitly show how the Gooder Regulator Theorem relates to the GR-Blackwell order, and the minimal information structure which weakly dominates all others.

Let XS={f(x):x∈X} - as a set, so potentially |XS|<|X|. And to make it clearer what role M plays: we'll take M={1,...,|XS|} to be an enumeration of it, rather than XS itself; write M(x) for the index of f(x) in M.

Define φS by φS(x)=M(x) (deterministically).

Then the Gooder Regulator Theorem is to show that for all information structures φ:

φ≤SφS.

If |φ|<|φS|, then φ<SφS (i.e. additionally φ≱SφS).

We'll give a quick proof in these terms - not too different from Wentworth's, but taking advantage of the fact that φS allows for globally optimal actions.

Proof:

1) For the first part, we can just remark that for any U, the globally optimal action for x is argmaxAU(f(x),a)^{[10]}, so the globally optimal behavior A(x)=argmaxAU(f(x),a) is achievable with a policy from φS. Hence φS dominates any possible information structure.

2) For the second part: if |φ|<|φS|, by pigeonhole there necessarily exists an m∈Mφ such that [φ]x1m,[φ]x2m>0 with f(x1)≠f(x2).

It suffices to find a pair A,U such that the optimal action for x1 is different from the optimal action for x2 - then U(φ) will be lower than the global optimum, so φ<UφS and φ≱SφS.

Hence we need vectors v1=(U(si,a1))i, v2=(U(si,a2))i such that
f(x1)⋅v1>f(x1)⋅v2f(x2)⋅v1<f(x2)⋅v2

Taking v1=f(x1)/||f(x1)||, v2=f(x2)/||f(x2)||, we have the desired result.
□

Where's the posterior?

What here is isomorphic to "the posterior distribution on S given X",
(s↦P[S=s∣X]), promised by the Gooder Regulator theorem?

It's certainly not the states of M, in isolation - M is just an arbitrary set with the right cardinality. It's more reasonable to say that it's φS (a.k.a. M(X)).
Indeed, φS:X→M and x→(s↦P[S=s∣x]) do induce the same equivalence classes of x, so if we look at the posterior as a function X→{P[S=s∣x]} (n.b. not as X→ΔS), then they are isomorphic as Set functions.

However, this isn't necessarily the equivalence we're looking for. Different systems (S,f) with different posteriors can induce the same optimal φS - as again, they just need to have the same equivalence classes of x. That is, there's no isomorphism between S↦(s↦P[S=s∣x]) and S↦φS. Nor are systems yielding the same optimal φS necessarily 'effectively identical' - they can induce different overall preorders over information structures, with e.g. different (and even different numbers of) k-optimal information structures. Contra Wentworth, the "model M(x)" (a.k.a φS) by itself does not contain all of the information from the posterior.

That said, when we consider a single agent that can optimally satisfy any U:S×A→R, it is still reasonable to say the agent as a whole must model the Bayesian posterior. This is because it must 'know' what distribution of states each signal m corresponds to in order to choose the optimal policies for each U (we can easily show this: the optimal policy for some U would shift if p(s∣m) were different). The distinction is just that this information doesn't have to be propagated from X→M; it doesn't have the type "something which must be a function of the observation". We can think of it as (allowed to be) precomputed, or built into the agent. Regardless, really it is the pair (φS,U↦πU) which must contain the full information from the posterior.

This is a bit of a subtle distinction, but the kind which can be important.

4.1.3 Convergence is still limited

Has this additional structure allowed for the possibility of natural abstractions, given the right system (S,f)? Generally, does this setting allow us to model the kind of preference structures over abstractions that we're interested in? Not entirely.

The reduction by F does introduce additional convergence - and asymmetric convergence, as in general F will differentially expand the equivalence classes and dominated sets of different information structures. But, especially in the 'universal preference' setting, we're still restricted by the identical role each s∈S must play in the outcomes.

One reflection of this is that for any k<|ϕS| short of the critical size allowing full information of the system, it is still impossible to make all utility functions agree on a single ϕ of size k which they prefer to all others of that size. Surely we ought to at least be able to represent universal preferences for a particular compression.

While a full discussion of the number of Pareto optimal information structures at a given size is out of scope, we'll sketch a few quick properties:

Just as in the Blackwell setting every partition of X is the unique smallest partition dominating itself, when f:X→S and φ are deterministic, every φ corresponding to a partition of S is the unique smallest partition dominating itself.

In general, the number (or volume) of k-Pareto-optimal information structures scales at least^{[11]} as O((|XS|k)), initially growing ~exponentially as k diverges from 1 or n.

This limits the maximum possible convergence of abstractions. To go further, we must allow for more substantial shared structure between the utility functions.

4.2. Adding a common world

Specifically, the additional structure we need is a common world, so that different utility functions share the same relationships between context states x and actions.

Define: W: a set of outcomes T:(X,A)→W, a transition function
and redefine U:W→R.

We'll call the pair (W,T) a 'world'^{[12]}.

Our setting now looks like this:

Notice that if T happens to factor as T(x,a)=(f(x),a) for some S and f:X→ΔS, then we're back in the Gooder Regulator setting. Generally, for this additional structure to do anything new, T must be many-to-one, and the images of different actions must overlap.

4.2.1 Universal preferences in a common world

In this setting, what can we say about universal preferences?

The equivalence of prongs (2) and (3) from the Blackwell Informativeness Theorem carries over just fine.

For (2), our attainable outcome distributions are now distributions over W rather than over (X,A) or (S,A) - all along these have been 'distributions over whatever the utility function is allowed to care about', and now that doesn't (necessarily) factor in such a way. T is allowed to map arbitrary combinations of x,a to the same outcome.

In other words, there are still universal preferences for exactly those information structures which yield strictly larger sets of attainable outcomes, but with outcomes now coming through the world.

However, prong (1) is trickier. While it's easy to find sufficient conditions for φ to yield more attainable outcomes than φ′ (as the conditions from the original or good-regulation orders still work), it's harder to give meaningful necessary conditions. This is essentially because x and x′ can yield some of the same outcomes, and be equivalent for some purposes, without being globally equivalent. We can say that for all π′, there must exist some π such that T∘⟨idX,π∘φ⟩=T∘⟨idX,π′∘φ′⟩
but not necessarily that φ and φ′ have some simpler linear relationship. While there is likely more to say here, I don't know that (1) has a straightforward equivalent.

Then for now all we have is:

Proposition:

Define DW(φ)={∑X∑A[T](xa)w[π∘φ]xa:π∈(M→ΔA)}⊆ΔW

The following are equivalent:

DW(φ′)⊆DW(φ) for any A

For any A and U, we have φ′≤Uφ

When they hold, write φ′≤Wφ.

The fact that universal preferences are less simple for arbitrary W,T is exactly why they can now start to exhibit more different behaviors.

5. Example (universal) convergence behaviors

On that note: let's now look at some possible convergence behaviors, as we vary the world. It's possible to control these behaviors quite a bit, even if we still only consider the preferences shared by all utility functions.

5.0 Redux: simple divergence and simple convergence

First, the convergence behaviors of the Blackwell and good-regulator settings are of course still possible. This will happen if our 'extra shared structure' doesn't actually add structure after all, or if it adds only GR-type structure.

That is, if W=X×A with T(x,a)=(x,a), then we are in the base setting and there is no "non-trivial" convergence. Similarly, if there exist S, f:X→ΔS such that W=S×A and T(x,a)=(f(x),a), then we are in the GR setting with "simple" convergence at the critical size |XS|, and variable but rapid divergence below.

5.1 Multi-capacity convergence

A new behavior in this setting is universal convergence at multiple scales.

Consider

X=[1..4]×[1..5]A=[1..2]×[1..5]×[1..10]W={∅}∪[0..10]
with
T(xi,∗,a1,i,r)=0.99∗wr+0.01∗w∅T(x∗,j,a2,j,r)=wrotherwise T(∗,∗)=w∅

The environment has two dimensions, one of size 4 and one of size 5. Each action ak,c,r has a 'kind' k, a 'condition' c, and a 'target' r - when value of c matches the kth dimension of the state, the result is the 'target' state wr, otherwise the result is the null state w∅. However, actions of kind 1 are fallible, and have a 1% chance to map to null state anyways. That is: the first dimension is smaller, so its conditions can be matched using a smaller partition, but it is less reliable.

In this setting, dividing along the first dimension is uniquely dominant among partitions of size 4, while dividing along the orthogonal(!) second dimension is uniquely dominant among partitions of size 5. For any state you might prefer, those partitions allow you to get the most of it (and there is no tradeoff among less-preferred states). This example can be extended to get arbitrarily long orthogonal chains of uniquely dominant partitions at different sizes.

We can also imitate this behavior using a fully deterministic T^{[13]}.

5.2 Capacity-dependent convergence and divergence

We can also have different convergence behaviors at different scales - including abstractions that converge at one capacity, but diverge non-trivially at larger sizes.

Consider

X=[1..4]×[1..10]A=[1..2]×[1..10]W={∅}∪[0..10]
with
T(xi,∗,a1,i,r)=0.99∗wr+0.01∗w∅T(xi,r,a2,i,r)=wrotherwise T(∗,∗)=w∅

Again dividing along the first dimension is uniquely dominant among partitions of size 4. However, there is no partition of size 5 (or 6..13) which dominates all others: if U most prefers wr, then it will most prefer separating x=(i,r) into it's own part. By size 14, the information structure can fully discriminate the states of the environment with different response characteristics, and there is once again a single dominant information structure.

We can glue multiple copies of this and the previous example together - leading to convergence and divergence at different scales of our choice.

5.3 Discussion

Overall, by funnelling all U through the same outcomes W, many of the behaviors that could hold for a single utility function in 2. can now be made to hold for all utility functions in an appropriate world.

A few things to highlight about example 5.2:

It leads to convergence at an agent capacity much smaller than perfect information about the system. (Suggestively, the setting 'almost' factors as a GR-type system at that smaller size, plus some additional restrictions on the allowed U)

With the values we've chosen, the returns to capacity past that point are comparatively flat, and account for only a small share of the total attainable utility (for any U on this environment).

The optimal partitions of size 5+ are all refinements of our convergent partition at size 4.

This is the kind of behavior we'd need to see for practically useful natural abstractions, and given the right (bounds on a) cost function for capacity would lead to the same or similar information structures for many U.

Of course, this just shows 'if we deliberately force our environment to exhibit convergent abstractions, then we get convergent abstractions'. We can also have no convergence, or convergence within a particular capacity range that shifts to a different convergent abstraction at a higher capacity.

This is all right and proper - the existence of natural abstractions is supposed to depend on specific kinds of regularity in the environment. This version of the formalism has made it possible to get convergence, but the real question is what realistic conditions on the environment would produce what behaviors. We've also confirmed that it's at least possible to come up with environments which produce abstractions that depend on the agent's capacity. To claim that differently-capable agents will use the same abstractions (if we care to^{[14]}), we'd need to find conditions which rule that back out.

The shape of the examples also hints that while it's possible for abstractions of different sizes to be unrelated, it's probably not too hard to come up with conditions such that they 'usually' aren't. At the same time, it's not clear that realistic conditions would imply this never happens.

6. Beyond universal preferences

But before we go further on that front, let's develop a more granular and more practical means of comparison than 'preferred by all utility functions'. We want to be able to notice when 'most' utility functions share a preference, even if not strictly all.

If we want to talk about preferences 'many' or 'most' utility functions, we need a way to measure them. What should this be? Well, for any given application, what we really care about is the probability measure coming from our beliefs - for example, if we're interested in a potential agent created by some training procedure, then we care about our subjective distribution on U given that training procedure. But we don't know at this point what that will be, so we are interested in results that we can either parameterize by our probability distribution, or that hold for some class of distributions.

It's... not actually quite redundant to look at what's true for all distributions, depending on what questions we ask; but for the most part this is covered by our discussion of what's true for all utility functions (consider the trivial distributions which assign all measure to a given U).

Our first step will instead be to look at 'uninformative' distributions which are invariant under particular symmetries of the problem. To do so, we'll apply ideas from Turner's power-seeking work.

We won't exactly follow the formalism of Parametrically Retargetable Decision-Makers Tend
To Seek Power, for the key reason that their central relation ≥nmost: Θ describing "inequalities which hold for most orbit elements" is not transitive. But several parts of this section will closely parallel their results (and at one point we'll directly apply a lemma from this paper).
Apart from the issue of transitivity, we'll make some slightly different choices in coverage and presentation, generalizing in some ways, while (for expedience) losing generality in others. Properly reconciling these is a topic for another post.

(Side note: it would also be natural to look at the 'maximum entropy distribution over all utility functions' in particular. We need to be slightly careful about what exactly this is^{[15]}, but presumably one can show that for this case, information structures are preferred in direct proportion to their mutual information with the outcomes. We won't pursue this here, as it would take us a bit off-track, but leave it as a conjecture.)

6.1 Dominance for all distributions from a class

Once we're measuring U according to some distribution D, there are a few natural questions we might ask in order to compare information structures φ and φ′ in terms of this measure, including:

For what measure of U is U(φ)≥U(φ′)?

For what measure of U are φ v.s. φ′ optimal for U, out of some class Φ?

How does the expected value of φ compare to φ′, averaging across D?

In particular, we might wonder: can we get preorders out of these conditions which parallel the Blackwell and Blackwell-like orders, but allow for more granular comparisons?

For 1), it turns out the answer is no: comparing φ and φ′ in terms of the measure for which U(φ)>U(φ′) leads to a non-transitive relation even for individual (symmetric) distributions over U. That is, writing φ>!φ for PD(U(φ)>U(φ′))>PD(U(φ)<U(φ′)),
there can be cycles^{[16]} with φ1>!φ2>!φ3>!φ1, but φ1≮!φ2. The same holds for >! defined as PD(U(φ)>U(φ′))>c∈(0,1)).

However, the latter two don't have this problem: the probability PD(OptΦ(φ)) that φ is optimal out of Φ, and the expected utility EU∼D[U(φ)], are functions from individual information structures to R. Thus, for any given D, they induce a total preorder on them.
This allows us to safely define a preorder by intersection - for example, φ≥Cφ′ if ED[U(φ)]≥ED[U(φ′)] for all D in some class C.

We'll then see how these preorders correspond to bounds on ratios of probability-of-optimality and expected-utility between φ and φ′.

6.1.1 Dominance for G-invariant distributions

In particular, we'll look at the relationships between φ and φ′ in terms of the symmetries satisfied by D; that is, we take the class C to be "all distributions satisfying a given symmetry".

We can then give simple sufficient conditions and (weaker) necessary conditions for φ to be preferred to φ over all such distributions, in the sense of higher expected value and higher probability of optimality.
First, φ will be always preferred to φ′ if we can imitate its outcomes up to a symmetry - this direction is the same essential idea as Turner's power-seeking results. And in the opposite direction, if φ is preferred for all symmetric D, then each outcome attainable by all permutations of φ′ must be imitable by some mixture of permutations of φ.

To state this formally, we'll need a few preliminaries.

Given a subgroup G≤S|W| of the symmetric group with action on R|W|, we can take it to act on utility functions, by permuting the utilities assigned to each state. This has^{[17]} the effect that g⋅U=U∘g−1.

Then, we can define:

Definition: G-invariant distribution

Define a G-invariant distribution to be a probability distribution D∈Δ({W→R}) such that it's density μD (a.k.a. pD) satisfies μD(g⋅U)=μD(U) for all U∈{W→R} and all g∈G.

Now, distributions d∈ΔW are just vectors in RW which sum to 1, so we can consider the action of G on them as well^{[18]}. We can naturally extend this action to sets of distributions over W, such as our attainable outcome distributions, by g⋅D={g⋅d:d∈D}.

Finally, we'll write IsOptΦ(φ,U)=1(U(φ)≥maxx∈ΦU(x)), so that PD(OptΦ(φ))=EU∼D[IsOptΦ(φ,U)].

Then our sufficient condition (for the general W setting) will be the following:

Theorem (g-covering of outcomes implies score-domination under G-invariant distributions)

Suppose g⋅D(φ′)⊆D(φ) for some g. Then:

∑g∈G(g⋅U)(φ′)≤∑g∈G(g⋅U)(φ) for all U

EU∼D[U(φ′)]≤EU∼D[U(φ)] for all G-invariant D

Write φ′≤GEUφ when these hold.
Additionally, let Φ be a set of information structures with outcomes closed under the action of G: if φa∈Φ, then for all g, gD(φa)=D(φb) for some φb∈Φ.
Then:

∑g∈GIsOptΦ(φ′,gU)≤∑g∈GIsOptΦ(φ,gU) for all U

PD(OptΦ(φ′))≤PD(OptΦ(φ)) for all G-invariant D

Write φ′≤GOptΦφ when these hold.

In fact, this holds for the expectation of any 'scoring function' ν mapping a set of attainable outcomes (or information structure) and a utility function to a real number, which is

monotonic in the set (i.e. A⊆B implies ν(A,U)≤ν(B,U)), and

invariant under joint action of G (i.e. ν(g⋅A,g⋅U)=ν(A,U)).

The proof follows more or less immediately from these properties, so we leave it to an appendix.

In the other direction, our necessary condition (which we'll state just in terms of expected utility) is:

Suppose EU∼D[U(φ′)]≤EU∼D[U(φ)] for all G-invariant D.
Then ⋂GD(g⋅φ′)⊆Conv(⋃GD(g⋅φ))

Proof:
Suppose the contrary, and take x∈⋂GD(g⋅φ)∖Conv(⋃GD(g⋅φ′)). As in the Blackwell order proof, we can take a hyperplane which separates {x} and Conv(⋃GD(g⋅φ′)), giving a U which prefers x to any point attainable by any g⋅φ′. Now x is attainable by each g⋅φ, so U(g⋅φ)>U(g′⋅φ′) for any g,g′, and hence certainly ∑GU(g⋅φ)>∑GU(g⋅φ′). Therefore EU∼D[U(φ′)]>EU∼D[U(φ)] for D uniform over the orbit of U - a contradiction.
□

In a narrow sense, this is strict, as we can find counterexamples with EU∼D[U(φ′)]>EU∼D[U(φ)] even if |G|−1 of the orbits of each point in D(φ′) are contained by every orbit of D(φ). However, there should be a related necessary-and-sufficient characterization, giving a proper generalization of the Blackwell Informativeness Theorem; we set this aside for now.

Additional results for the Blackwell setting

To further show how this is all still connected to the Blackwell order, let's also give conditions corresponding to prong 1) of the Blackwell Informativeness Theorem, for the traditional Blackwell setting where W=(X,A) and T=id.

Suppose G acts independently on each of X and A - and permutations of A are in fact always irrelevant (when we allow all policies), so equivalently it acts only on X.

Then our sufficient condition

g⋅D(φ′)⊆D(φ)

is equivalent to^{[19]}

φ′=γ∘φ∘g for some stochastic map γ and g∈G

This is because here the action of G on an outcome distribution is just a relabelling of X, and we can^{[20]} equally perform this relabelling before applying φ.
In fact, this characterization will work whenever we can define an action of G on X and A such that G 'commutes' with T, in the sense that g⋅T(x,a)=T(g⋅x,g⋅a) (which will not in general be possible).

When G is the full symmetric group S|X|, this means that all information structures with the 'same weight distributions' across signals are equivalent - for deterministic partitions, this is 'the same set of part sizes'.

Beyond the independent case, when G acts arbitrarily on X×A and can permute action-values across states, then the condition on φ is less obvious, though we can at least show it is a) nontrivial, b) different from the independent case, c) likely some form of majorization condition^{[21]}. We also set this aside for now.

Finally, we'll note that our necessary condition can be translated to a similar form, but doesn't appear particularly enlightening^{[22]}.

6.2 Quantitative dominance

At this point, we've found a kind of superiority weaker (and so more general) than 'preferred for all possible utility functions', but we still haven't moved beyond a binary 'preferred' or 'not preferred' relationship for φ::φ′.

To do so, a natural idea is to move from simple inequalities EU∼D[ν(φ′,U)]≤EU∼D[ν(φ,U)] to inequalities parameterized by a scalar c∈R - for example, defining φ′≤G,cEUφ by EU∼D[U(φ′)]≤c⋅EU∼D[U(φ)] and similarly for PD(OptΦ(φ′))≤c⋅PD(OptΦ(φ)).
This clearly gives another preorder, and is a perfectly reasonable way to compare information structures under a particular distribution D.
But taking a lower bound c such that this holds for all symmetric distributions D is not actually interesting: if we take a trivial D={U1}, U1(w)=1 for all w, then the expectations will just be equal, making c always 1.

However, we can define a related relationship with less trivial bounds:

Define φ′≤D,c≠νφ to mean
EU∼D[ν(φ′,U)∣ν(φ,U)≠ν(φ′,U)]≤c⋅EU∼D[ν(φ,U)∣ν(φ,U)≠ν(φ′,U)].

Note that this is equivalent to EU∼D[ν(φ′,U)]≤c⋅EU∼D[ν(φ,U)] for exactly c=1, but not otherwise.

It's less obvious that this relationship is transitive, since we take the expectation over a different conditional distribution for each pair φ,φ′, but it turns out to in fact be the case^{[23]}.

For this relationship, we can define φ′≤G,c≠νφ to mean φ′≤D,c≠νφ for all G-invariant D, and have this be nontrivial for c>1.

Multiple G-injections

It's also this relationship ≤G,c≠ν which we can infer by generalizing the previous result about g-injections (paralleling the move from simple- to multiple- retargetability in the parametric retargetability context).
Intuitively, if there is not just one copy of D(φ′) within D(φ) via g, but k 'distinct' copies under different g1,...,gk, we should be able to say that φ is not just 'at least as good as φ′' but
'k times better than φ′' in some way. However, we need to be a bit careful with the details.

For this part, we'll apply a lemma from Turner & Tadepalli on "orbit-level tendencies" directly, and give the results only for IsOptΦ.

Specifically, for our family g1,...,gk with gi⋅D(φ′)⊆D(φ),
we'll additionally require their conditions^{[24]} for "containment of set copies" (Definition A.7):

We say that Bcontains k copies of A when there exist g1,...,gk such that
a) gi⋅A⊆B
b) gi are involutions: gi=g−1i
c) gi fix the image of other gj: gigj⋅A=gj⋅A for i≠j

Then by their Lemma B.9, we conclude that
k⋅∣∣{g:IsOptΦ(φ′,gU)>IsOptΦ(φ,gU)}∣∣≤∣∣{g:IsOptΦ(φ′,gU)<IsOptΦ(φ,gU)}∣∣
for any U (or in their notation, IsOptΦ(D(φ′)∣θ)≤nmost: ΘIsOptΦ(D(φ)∣θ), interpreting once again U as θ∈Θ=R|W|).
Since the value of IsOptΦ is in {0,1}, this immediately gives us^{[25]} that
k∑g∈G≠IsOptΦ(φ′,gU)≤∑g∈G≠IsOptΦ(φ,gU)
where G≠={g∈G:IsOptΦ(φ′,gU)≠IsOptΦ(φ,gU)}.
Since this holds for the orbit of any U, we can conclude that φ′≤G,k≠IsOptΦφ.

That is, we have the following theorem:

Theorem

Suppose D(φ) contains k copies of D(φ′) via g1,...,gk∈G.
Then φ′≤G,k≠IsOptΦφ.

The conclusion in english: according to any G-symmetric probability distribution, it is at least k times more likely that φ is optimal while φ′ isn't, than that φ′ is optimal while φ isn't.

While somewhat limited, this result gives us an initial scenario where we can establish a kind of quantitative dominance of one information structure over another, for a broad range of distributions of utility functions. The theorem can surely be improved; but for meaningfully stronger conclusions, we'd require stronger assumptions about the environment or the utility function distributions.

6.3 Blackwell-like relations correspond to ratio bounds

So far, we've framed our results in terms of various preorders on information structures.
Mostly the intuitive meanings of these "≤" relationships are basically their definitions. But
to make it clearer what they mean in terms of "convergence" of abstractions, especially for the quantitative relations, we'll mention another interpretation here: each relationship φ′≤∗φ corresponds to a lower bound on a ratio of some quantities related to φ and φ′.

The original Blackwell relation φ′≤BWφ, which states that U(φ′)≤U(φ) for all U, implies that U(φ)U(φ′)≥1 for all U - with the corollary that e.g. PD(OptΦ(φ))PD(OptΦ(φ′))≥1 for any D. Likewise, ≤S and ≤W imply the same for U (and distributions of U) defined on a system S or a world W.

Then, a relation φ′≤Gνφ corresponds to the bound
ED[ν(φ)]ED[ν(φ′)]≥1
for all G-invariant D.

And moving to our quantitative relations corresponds to changing the bound from 1 to c.
The hypothetical
φ′≤c,Gνφ
would correspond to a bound
ED[ν(φ)]ED[ν(φ′)]≥c - for ν the probability of an event (such as optimality with respect to Φ), this corresponds to a lower bound on the likelihood ratio of the events, e.g. PD[Opt(φ)]PD[Opt(φ′)]≥c.
However, these are exactly the relationships that we found it wasn't possible to guarantee (for c>1) for arbitrary symmetric distributions; which means there is no nontrivial bound on likelihood ratios with our assumptions (recalling e.g. the trivial but symmetric D={U1}, U1(w)=1). It would be possible to get such bounds, but it would require a different type of assumption on D.

Finally, our substitute relations like φ′≤G,c≠IsOptΦφ
correspond to bounds on more unusual ratios of the form:
EU∼D[ν(φ,U)∣ν(φ,U)≠ν(φ′,U)]EU∼D[ν(φ′,U)∣ν(φ,U)≠ν(φ′,U)]≥c
When ν is a binary indicator of an event like IsOptΦ, this gives likelihood ratios like:
PD(OptΦ(φ)∧¬OptΦ(φ′))PD(OptΦ(φ′)∧¬OptΦ(φ))≥c.

This unusual likelihood ratio highlights that "contains multiple copies"-style relations don't necessarily give us as strong of a form of convergence as we might hope: while they can tell us A and not B is at least k times more likely than B and not A, they can't unconditionally tell us that e.g. pselection(B) is k times more likely than pselection(A) over a symmetric distribution.

Perhaps a simpler takeaway from these ≠ bounds is this: if you can find a U so that the values of ν for A and B are never equal at any point in it's orbit, then the expectation for B is k times greater than for A. That is, if ν(A,gU)≠ν(B,gU) for all g∈G, then k⋅∑g∈Gν(A,gU)≤∑g∈Gν(B,gU). If such a U exists, there will be someG-symmetric distribution where k⋅EU∼D[ν(A,U)]≤EU∼D[ν(B,U)], though it need not hold for all of them.

7. Discussion

7.1 The Weak Natural Abstraction Principle

A (much) weaker version of the natural abstraction hypothesis would be just: "some abstractions are usually preferred to others" [by most agents, in natural environments]. In this form it is obviously true; if nothing else, surely we can come up with some abstractions which are quite useless, and some which are not. As we advanced through the post, we emphasized how we weren't yet able to guarantee strong convergence of abstractions, such that most agents prefer only a "small" number of natural ones. However, we can also see the theorems of this post as providing gradually stronger demonstrations of this weak natural abstraction principle (for our setting).

Already from the original Blackwell Informativeness Theorem, we saw that some information structures are strictly preferred to others (in the sense that φ′≤BWφ and φ′≰BWφ) - those providing a superset of information about the world, and so a superset of attainable outcomes given that information structure.
Through the GR and W settings, we saw that if there is non-trivial structure to the environment's "outcomes" (which agents are allowed to care about), then information structures need only provide a 'dominant' set of information relevant to controlling these outcomes. This still requires enabling a superset of attainable outcomes, but environmental structure makes this relationship more common. Finally, by moving from 'preferred by all' to 'preferred by more', we saw that the requirement could be softened from 'a superset' of outcomes, to 'unambiguously more' outcomes (in the sense that we could get a superset up to a permitted relabelling of outcomes).

Even the first type of relationship is guaranteed to exist in any nontrivial environment, and so to guarantee us common preferences: bigger information structures with more information will be preferred to similar smaller ones (as long as both are smaller than the whole environment).
But this doesn't really capture the spirit of the natural abstraction hypothesis. It tells us nothing about preferences between information structures with the same amount of information, or different amounts of distinct information. By the final case, however, we get something more in the right spirit: as long as the environment has at least some information which is more relevant to controlling outcomes than the rest, there will be convergent preferences towards abstractions which capture that information. Many more abstractions can be compared in terms of 'how much' policy-relevant information they provide.

We've then essentially proven an especially weak (and indeed 'obvious') form of the natural abstraction hypothesis. The setting where we prove this is bare-bones, but correspondingly universal: while there are many other elements we'd want to include for a more thorough study of abstractions, basic preferences over 'ways of coarse-graining information' will still apply.

Of course, it's only stronger forms of the hypothesis that would be of much practical use for alignment. Rather than "some abstractions are generally preferred to others", we'd need something more like "most agents will converge on a 'small' number of discrete potential abstractions^{[26]}". To have a chance to get a result like this, we would need to introduce some of those missing elements.

7.2 Weak natural abstraction as power-seeking

Intuitively, there's a clear connection between natural abstraction and instrumental convergence: where natural abstraction proposes that certain 'abstractions' are more useful to a wide range of agents (in a given environment), instrumental convergence proposes that certain states or actions are more preferred by a wide range of agents. Since here we have a formal working notion of 'abstractions', as information structures, we can make this connection more explicit. Indeed, in our power-seeking-theorem style analysis, we basically already have - but let's see directly how convergent preferences over abstractions can be seen as a special case of power seeking.

Recall that 'power' in the sense of these theorems is a concept about the choices available to you, so 'seeking power' only makes sense if you are making at least two successive choices.
We're then looking for a sequence of choices which occur in our setting - which are, naturally, 1) your choice of information structure φ, 2) your choice of policy π given the information structure.

We can choose to view this as an a two-timestep MDP, with choice of φ leading to a dedicated state sφ, and choice of π leading stochastically to an outcome w∈W via T. Intrinsic reward for each information state sφ is 0, and the reward of an outcome is it's utility^{[27]}.

Then, the standard power-seeking results applied to this MDP^{[28]} tell us that most parametrically retargetable decision-makers (including but not limited agents choosing according to some utility function) will 'tend' to choose information structures which give them 'more' attainable outcomes via their choice of policy, and hence have higher 'power': higher average optimal value^{[29]} attainable from that state, averaging over utility functions.

The original versions of these theorems give us this 'tendency' in a slightly different form than we've used here ("a larger number of orbit elements of a decision-making function which strictly prefer one information structure vs. another"). As discussed earlier, we deliberately use a different formulation to ensure our tendencies (common preferences) are transitive. But up to this reformulation, which could equally be applied to the general power-seeking context, these results are exactly the same ones we saw in section 6.

We can then say that "weak natural abstraction [exists, and] is equivalent to power seeking tendencies in the agent's choice of abstraction", and prove it in a particular formal sense. Tendencies towards preferring certain (natural) abstractions occur exactly when instrumental convergence occurs in an information-selection problem derived from the environment.

7.3 Limitations and future work

We've built up one step at a time, from the minimal possible setting and the simplest questions. As a result, we've so far ignored many key aspects of realistic abstractions. We'll briefly go over a few of the most important missing pieces of the story, and how they relate to this framework.

The first missing piece can be summarized as: we ignore "internal" and "local" structure of all kinds. We treat the environment, signal, actions, and outcomes as undifferentiated sets - we don't factor them into variables representing e.g. different parts of the environment, and relate such structure to the mappings between objects. Relatedly, we don't consider any notion of 'similarity' between different world states, signals, or objects. As an important special case, this includes a lack of any real temporal structure.

The real 'substance' of the natural abstraction hypothesis is about the structure of the environment. Local structure is key to stories of why natural abstractions should exist, and what kind of thing they should be - for example, "information relevant to 'far away' variables" inherently requires some notion of distance (usually, a distance in a causal graph). This is well motivated by the local causal structure of the real world. But local structure in the signal and the encoder may also play an important role. For instance: this is what's is required to represent ideas like "similar world states are encoded by similar signals" or "a particular 'part' of the signal always corresponds to a particular 'part' of the environment". Moreover, the signal and encoder will also be embodied in the physical world. I expect such structure may be necessary to properly understand e.g. the modularity of abstractions.

Introducing internal structure to the environment is the main bridge to Wentworth's work on abstractions, and an obvious next step^{[30]}. Introducing internal structure to the agent and it's boundaries
is less-explored, but likely important. This is also where we would model distributions over functional behavior pushed forward from distributions over parameters, via some parameter-function map.

Second, we touch only very lightly on similarities between abstractions. Of course, we should care not only whether different agents use exactly the same information structures, but also if they use 'similar' ones. While internal structure opens up more options, we could look at extrinsic similarities even using only the current setting. 'Contains a superset of the information' is one relationship of this type, and we mention in passing 'orthogonality' of deterministic information structures, but there are many more possibilities (starting from mutual information I(φ(X);φ′(X)) - but this alone doesn't constrain 'what' information is shared).

Third, we've ignored all computational aspects of the problem - and thereby any 'reasoning'. The message-size of an abstraction can be considered a particular kind of space complexity, but there are many other tradeoffs - we may be concerned with the the algorithmic (or circuit, etc.) complexity of encoders and policies, as well as of the problems of selecting them. In principle all of this could be cast in terms of cost functions on internal structure, but is also well worth considering from an abstract computational perspective.

Finally, we assumed throughout the optimal choice of policy; and towards the end, we considered optimality with respect to a set of information structures. These can (and should) be generalized from optimality to other criteria. Some of this generalization can be transferred directly from the parametric retargetability setting with a little more care (though there are some details to watch to maintain transitivity). While part of the motivation for non-optimal choice can be addressed through appropriate costs on structure and computation, it is also simply worth generalizing beyond deterministic selection.

A convenient property of our setting is that it's fairly clear how one could add all of these pieces.

7.4 Additional remarks

A few other miscellaneous remarks:

Adding a lossy 'perception' between X and φ (i.e. Xρ→Oφ→M) so that φ doesn't have direct access to the environment does nothing more, nor less, than restricting the space of possible information structures. Namely, it restricts to those of the form γρ, a.k.a. those in the cone ≤ρ.

Transferring some of the ideas here back to the general power-seeking context, we can observe for example that a) while no individual action strictly dominates any other, some sets of actions can strictly dominate other (even disjoint) sets, b) a state sα can be strictly preferred to sβ not just over all distributions symmetric under the permutation of every state, but even over all distributions (or U) symmetric only under interchanging the values of sα and sβ.

Another way to view this whole setting is as a problem of lossy compression, which we can analyze through rate-distortion theory. Our interest is different from the usual applications rate-distortion theory in that we're interested in commonalities between the encoders for broad families of abstract "distortions" (derived from utility functions) which may not have anything to do with 'reconstruction', as well as that we currently consider only a single timestep. But similarities among distortion-rate functions for different distortions, especially e.g. phase changes at consistent capacities, may certainly be relevant.

8. Conclusion

We started with a simple formal model of abstraction, where an agent must coarse-grain information about a larger environment into a smaller number of internal states. In this model, we asked: when do different agents prefer to abstract in the same way?

We found that while there are few preferences common among all general-form utility functions, as we add more structure to their domain, we can get proportionally stronger convergence. When restricted to preferences over a shared environment, all agents may prefer exactly the same abstractions - or indeed completely different ones, depending on the environment. We gave examples of several possible convergence behaviors, including cases where abstractions converge strongly at particular capacities, but are orthogonal across capacities. We then generalized these results, using a modified version of Turner's power-seeking formalism to show that many more preferences are shared by 'most' utility functions, under priors obeying certain symmetries. Based on this, we showed how natural abstractions can formally be viewed as a type of power-seeking.

Some high-level takeaways:

For agents facing the same environment, there is indeed almost always some convergence in preferred abstractions. How much depends on the environment, and the relationships it creates between the attainable outcomes using different abstractions.

Even if an environment leads to convergent abstractions, there's no general reason why it can't lead to unrelated abstractions for agents with different capacities. Quite likely, the same is true for other differences in constraints. There are arguments^{[14:1]} why this might not a problem, and there may be conditions which prevent this from being an obstacle in practice, but we so far lack a formal model of this.

And a meta takeaway: taking the perspective that 'abstractions are ways of coarse graining the environment' literally and building a straightforward model of it gives a very tractable setting, with connections to many established fields. By default it lacks key features we'd want to fully model abstractions, but it comes with handles to introduce several of them.

Overall, even if the strongest (and most convenient) forms of the natural abstraction hypothesis turn out to be false, there will surely be some degree of convergence among the abstractions used by different agents in practice. Understanding the factors behind this convergence, and behind the formation of abstractions generally, would be useful in order to know what to expect of AI systems. Even short of strong natural abstractions, these dynamics inform the viability of different interpretability and alignment techniques - under what conditions we can trust them, and when we can expect them to generalize. Furthermore, they have multiple connections to the dynamics of which goals agents will acquire (i.e. agent-selection-processes will bring about) in which circumstances - of obvious importance.

While the theory here is only a very early step, we hope it can help clarify some of the broadest strokes, and show directions for further development.

Appendix: Omitted Proofs

Proof of "g-injection of outcomes implies EU-dominated under G-invariant distributions"

Let ν be a function which scores a set of attainable outcome-distributions against a utility function, so ν:P(R|W|)×R|W|→R, with the following properties:

Monotonicity: if A⊆B⊆R|W|, then ν(A,U)≤ν(B,U) for all U.

G-invariance: for all A⊆R|W|, U∈R|W| and g∈G, we have ν(g⋅A,g⋅U)=ν(A,U)

Then ν also naturally scores information structures, by ν(φ,U)=ν(D(φ),U).

Lemma:
If g∗⋅A⊆B, then ∑Gν(A,gU)≤∑Gν(B,gU).

Proof:
We have
∑Gν(A,gU)=∑Gν(g∗A,g∗gU)=∑Gν(g∗A,gU)≤∑Gν(B,gU), with the three equalities following from G-invariance, the sum being over the same orbit, and monotonicity respectively.
□

Corollary:
For any G-invariant distribution D over utility functions, ED[ν(A,U

The natural abstraction hypothesis claims (in part) that a wide variety of agents will learn to use the same abstractions and concepts to reason about the world.

What's the simplest possible setting where we can state something like this formally? Under what conditions is it true?

One necessary condition to say that agents use 'the same abstractions' is that their decisions depend on the same coarse-grained information about the environment. Motivated by this, we consider a setting where an agent needs to decide which information to pass though an information bottleneck, and ask: when do different utility functions prefer to preserve the same information?

As we develop this setting, we:

(As far as I can tell, apart from the obvious cited Theorems, these results are original

^{[1]})Whereas Wentworth's abstraction work has focused on what natural abstractions might look like, and why we might expect them to exist, this work focuses on exploring what it would mean for something to be a natural abstraction in the first place. Rather than an attempt to answer the natural abstraction hypothesis, it is more an attempt to understand the question.

## 1. Base setting

Any agent exists within an environment that is bigger than itself. It therefore necessarily maps a large number of potential environment states to a smaller number of internal states. When it then chooses what action to take, this choice depends only on its internal state.

Roughly, we can consider this mapping from the environment to action-influencing internal states to be the agent's abstractions

^{[2]}. We want to understand when different utility functions will share preferences about how to do this mapping - under the natural abstraction hypothesis, in appropriate conditions, there should be certain abstractions that are convergent across most utility functions.To model this, we'll consider a game where:

We'll keep everything finite to start - any infinities we want we should come by honestly, by taking limits. Our one concession to this is that we'll allow normal real-valued probabilities and utilities (though we'll see eventually how we could do without if we felt like it).

Formally, define:

X: a set of context states M: a set of signals

A: a set of actions

U: (X,A)→R, a utility function

φ: X→ΔM, an encoder mapping states to a distribution of signals

π: M→ΔA, a policy mapping signals to a distribution over actions

We allow φ and π to be stochastic (stochastic maps), but we'll also pay special attention to the case where they are deterministic (so effectively φ:X→M, π:M→A), because it is especially clean and factors apart some of the dynamics we're interested in.

Now, we are interested in preferences over φ assuming that π is chosen optimally. When are these preferences, and the optimal encoders, the same for different U? What happens as we vary |M|? For the time being, we can equally consider different U to be different agents or different tasks faced by the same agent. Later, we'll see some places where the two interpretations diverge.

As one might expect of such a simple setup, similar formalisms have been considered in many other contexts. Most directly, exactly this game is studied in the decision theory and economics literature - with partial overlap with our questions. There, the objects (φ,M) are commonly referred to as 'information structures' or 'Blackwell experiments'; we'll use the former term.

One other remark on notation: we'll often be interested in comparing different encoders φ,φ′, which may have different signal spaces Mφ,Mφ′. We'll write |φ| for ∣∣Mφ∣∣, the cardinality of the signal set.

## 1.1 Equivalence classes of encoders

One thing to note out of the gate: 'the same encoder' here shouldn't mean equality as functions. For our current purposes, we care only about their information content - so if φ,φ′ are the same except for a relabelling of M, we want to consider them identical (and they will certainly have the same attainable utility for any U). Another way to say this: we want to quotient by Aut(M)=S|M|, i.e. the permutations of M, to get our real objects of interest. What are these objects?

In the deterministic case, they are the distinct possible sets of preimages {φ−1(m):m∈M} - which are just the |M|-part partitions of X. In the general case, they are a more general partition-like object. Note that we can represent a stochastic map φ as an |M|×|X| column-stochastic matrix: a matrix with elements in [0,1] such that the sum of each column is 1: ∑|M|i=1[φ]ij=1. Then [φ]ij gives the probability that we encode signal i given we are in state j - that is, pφ(mi|sj). If we are indifferent to permutations of M, then we are indifferent to permutations of the rows, so we have a set (rather than vector) of row vectors. (If X were instead a suitable topological space and φ continuous, then these would be exactly partitions of unity)

Sometimes it will be more convenient to think of φ as a function, sometimes to think of it as a partition Pφ, and sometimes as a matrix; we'll switch between all three as appropriate. However, keep in mind we really only care about φ up to equivalence in this sense.

## 1.2 Comparison of encoders

For a given utility function U, we take the value of an information structure to be the expected utility if we have that information structure and follow the optimal policy.

Formally, define U(φ)=maxπEX,π(φ(X))[U(x,a)]=maxπ∑X,A[π∘φ]xaU(x,a); we can also say it is maxπU((X,(π∘φ)(X))), extending U to a function on distributions by taking the expectation. (By convention we're assuming a uniform prior on X; this choice turns out to be irrelevant for our purposes).

We say that U prefers φ to φ′ if U(φ)≥U(φ′), which we'll also write φ≥Uφ′.

## 2. Basic properties for individual U

As a first step, to get a feel for the setting, let's start with some observations about what can happen for arbitrary individual U. These give us one bound on common properties - for something happen for 'many' U, it must certainly happen for some particular U.

## 2.0 M should be a bottleneck

One basic observation is that the problem becomes trivial if |M|≥|X| or |M|≥|A|. At that point, we can always pick the globally optimal action for each value of X. For this setting to be remotely interesting, M needs to be an information bottleneck.

## 2.1a Any deterministic partition is optimal for some U

This is also easy to see: for a partition P={p1,...,pk}, take any {a1,...,ak}⊆A and define U(x,ai)=1(x∈pi). Furthermore, any optimal partition for this U must be a refinement of P, and P is the unique optimal partition with k parts.

## 2.1b For any U, any nondeterministic φ is weakly dominated by some deterministic φ′

It is not quite literally the case that no nondeterministic φ is optimal for its size for any U. If U is indifferent between where to put x in the optimal policy, say U(x,πopt(m1))=U(x,πopt(m2)), then x can be freely sent to any mixture of m1 and m2. But there is always a deterministic φ′ of less than or equal size which does at least as well, and φ′ either does strictly better or is strictly smaller unless U is indifferent between some outcomes (which may have measure zero, depending on your assumptions).

Proof: See footnote

^{[3]}; nothing surprising.This motivates considering only partitions in the context of optimality for a single U (the remainder of section 2.)## 2.2 Optimal partitions Pi,Pj can be orthogonal

Fixing U, write Pi for the optimal partition of size i. Then, there's not necessarily any relationship between Pi and Pj for i≠j.

For instance, take X=[1..3]×[1..4], A=[1,2]×[1..4] and U(xi,∗,a1,i)=4U(x∗,i,a2,i)=5otherwise U(∗,∗)=0 Then the optimal partition of size 3 is {{(1,j):∀j},{(2,j):∀j},{(3,j):∀j}}, while the optimal partition of size 4 is {{(i,1):∀i},{(i,2):∀i},{(i,3):∀i},{(i,4):∀i}} (easy exercise: show this). These partitions are orthogonal - in other words, they have zero mutual information. This example can be extended to make any finite number of optimal Pj orthogonal.

## 2.3 Not every P1,...Pn is (uniquely) optimal for any U

Then, can any sequence of partitions whatsoever be optimal for the right U? Not uniquely so, at least (again ruling out e.g. the trivial case where U is constant and all partitions are optimal). Consider the following counterexample:

For P4 to be uniquely optimal, it must be that subdividing red provides more marginal benefit than subdividing green or blue, but optimality of P5 implies the opposite.

The general principle here: if two strictly size-optimal partitions both involve partitioning the same subset of X into k pieces, then they must do so the same way.

## 2.4 Strict monotonicity of ui

What about how the attainable utility varies with |M|? Write uk for the maximum expected utility attainable when |M|=k, and umax for the global maximum maxkuk. Obviously for i<j, we have ui≤uj; and in fact, if ui<umax, then ui<uj.

An easy way to see this is to consider Nmax=|Range(x→argmaxAU(x,a))| - the number of distinct optimal actions. Then if k<Nmax, we can always improve uk+1 by using the additional partition to move some k from a suboptimal action to an optimal action. If k≥Nmax then we can assign every x it's optimal action and uk=umax.

Naively, you might imagine there could be a scenario where more information doesn't help until you reach some threshold. For instance, suppose you can either a) do nothing or b) enter a 5-bit password to attempt to open a safe; the safe explodes if you fail, so it's only worth attempting if you definitely know the full password. However, even though you need to know the whole password to change your policy, you can convey the whole password a smaller fraction of the time. Even with only two states for M, you can have one state represent 'password unknown, do nothing', and the second (rare) state represent 'the password is exactly 00000, so enter that'. This result shows that to get that kind of thresholding behavior, we'd need to add something else to the model, i.e. that constrains the allowed partitions.

## 2.5 Marginal return can increase

We might expect that you use your first split to encode the most important information, the next split to encode the next most important information, etc., so that the marginal return to channel capacity is always decreasing. It turns out this is not necessarily the case. Consider the following counterexample:

X=[1..2]×[1..3], A=[0..2]×[1..3] and U(x∗,∗,a0,∗)=0U(xi,∗,a1,i)=8U(x∗,i,a2,i)=21otherwise U(∗,∗)=−1000 With a single part, the best we can do is A0 everywhere, so u1=0; with three parts, we can divide along the environment's second dimension and get 21 everywhere, so the average is u3=21. But we've chosen the utilities so the best we can do with two parts is to divide along the first dimension, achieving 8 average utility: any policy for a 2-part partition which uses a l=2 action must either suffer -1000 for some x, or divide between a0,0 and a single a2,i part on at most 1/3 of X, achieving at most 21/3 = 7 utility. So u2=8, and u2−u1=8<13=u3−u2.

## 3. Dominance over all U

Now that we've gotten a taste of the constraints that exist for individual U and ϕ, let's move to our main topic: common preferences among multiple U. Start from the opposite extreme: what preferences over information structures are shared by all possible utility functions?

This turns out to be exactly the question answered by the foundational result about information structures: the Blackwell Informativeness Theorem.

Unsurprisingly, given the strength of the requirement and lack of structure in our setting, these convergent preferences will be sparse. The result is not exactly a no-free-lunch theorem, since some information structures are indeed better than others, but it's not so far off in spirit: we can think of it stating that only the minimum possible preferences are shared.

Based on the barriers this case reveals, we'll then extend our setting so that non-trivial convergence is possible.

## 3.1 The Blackwell order

What is required for φ to be preferred to φ′ for all U? One clear sufficient condition is that given φ, we can use it to build φ′ by postprocessing - then we can imitate any policy for φ′. And we might expect that this is also necessary: if not, φ′ must not distinguish some situations which φ distinguishes, and we can construct

someU that cares about the difference.This is what the Blackwell Informativeness Theorem confirms; and once we cast it in just the right terms, the proof falls out almost immediately.

Since some of our later results have very similar proofs, we'll reproduce the argument here. We follow the presentation of the paper "Blackwell’s Informativeness Theorem Using Diagrams" and especially of this twitter thread.

We'll need one additional definition:

## Definition: Attainable outcomes

That is, an element d∈D(φ) is a probability distribution over (X,A) with pd(x,a)=pπ(a|m)pφ(m|x)p(x) for some π. Note that we can equivalently consider D(φ) to be the set of stochastic maps π∘φ themselves, i.e. the likelihoods pπ(a|m)pφ(m|x), up to isomorphism by application to our uniform prior on X

^{[4]}. In other words, D(φ)≅¯D(φ)={π∘φ:π∈M→ΔA}⊆{X→ΔA}; these can in turn be considered vectors in (ΔA)X.Then we can state the theorem:

## Blackwell Informativeness Theorem

Proof:

1)⟹2): If you φ′ is a garbling of φ, and you have φ, you can just do the garbling yourself to get φ′; so you can certainly act according to φ′ if you want to.

Let φ′=γ∘φ be a garbling of φ.

By definition, for any d′∈¯D(φ′) there is a π′ s.t. d′=π′∘φ′. Then defining π=π′∘γ, the diagram commutes

^{[5]}, showing d′∈¯D(φ).2)⟹1): If φ can achieve whatever φ′ can, then in particular it can achieve "be φ′", which makes φ′ a garbling.

Take A=M′ - then for π′=idM′, 2) says there is a π such that the diagram commutes. Then φ′=π∘φ is a garbling of φ.

2)⟹3): If D(φ) contains D(φ′), then it gives strictly more options, so your best option is at least as good - ∀U:maxD(φ′)U(d)≤maxD(φ)U(d).

3)⟹2): This is the one step which isn't immediate from the definitions - it's instead an application of a separation theorem.

Suppose 2) is false, say d′∈D(φ′)∖D(φ). Now D(φ) and {d′} are convex and compact, so the hyperplane separation theorem states that we can find a u∈R|X|⋅|A|,b∈R such that uTd<b for all d∈D(φ) and uTd′>b for d′∈{d′} - a hyperplane with normal vector u separating them. But this is exactly a U where φ does worse than φ′, contradicting 3). □

Notice that the equivalence classes of ≤BW are exactly what we said are really 'the same' information structure: one way to see this is to note that γA=B and γ′B=A imply γ′=γ−1, and the only stochastic matrices with an inverse within the stochastic matrices are permutation matrices, which just interchange the states of M. So the only way one information structure can be universally preferred to a second is if one 'contains' the other, and two information structures which all U are indifferent between are 'the same one'.

When φ and φ′ are deterministic, we can easily show that this is equivalent to Pφ being refinement of Pφ′ as a partition (from property 1, or by explicitly constructing U for property 3). For this case, we can then state the result as:

the partial order of dominance of deterministic information structures is equal to their standard partial order as partitions.We can also remark that this is a strictly stronger requirement than φ(X) having more mutual information with X than φ′(X). While I(X;φ′(X))≤I(X;φ(X)) is a necessary condition for φ′≤BWφ, it is not a sufficient one - φ must contain "a superset of" φ′'s information about X, rather than simply "more" information about X.

Some corollaries for partitions:

## 3.2 What's missing

So we've seen that by default, there's no nontrivial superiority of information structures over all possible utility functions. What's missing to allow for more interesting convergence behavior? Two things:

The symmetry is the sharpest obstacle to stronger convergence, so we'll address 1) first.

## 4. Adding structure

## 4.1 Adding a 'system': the Good(er) Regulator Theorem

As a first example of what happens when we introduce more structure - and because it leads us another existing theorem - let's ask: what if we restrict the distinctions between x which the utility function is allowed to care about? What does this change about the preference dominance order?

The discrete version of this idea is for U to treat some values of X identically - at which point we can consider U to be defined on the equivalence classes of X, giving the 'causal' structure X∼→C→C×AU→R. What's the probabilistic version?

Well, we can simply take a stochastic map to the intermediate object, giving the structure Xf→ΔS→Δ(S×A)U→R, for some set S and stochastic map f (which we'll assume to be surjective

^{[6]}for convenience; otherwise reduce S). This is a kind of dimensionality reduction (as even if |S|>|X|, certainly dim(Im(f))≤dim(X) as a vector space).Now our setting looks like this:

This may look familiar if you've read "Fixing The Good Regulator Theorem":

This is exactly the same setting, up to some choices of representation - the extra node Y just encodes the choice to look at a fixed encoder which must be shared

^{[7]}by many^{[8]}policies and utility functions.Taking the Good Regulator perspective, we can think of S being the system we care about, with f describing how its states depend on the observable X. The question the Gooder Regulator Theorem asks is in fact just: given a system (S,f), what's the minimal information structure that dominates all others?

The Gooder Regulator theorem tells us that it should in some sense be the posterior distribution P(S∣X) - we'll revisit this in a moment. (Meanwhile, in the discrete case: notice that X→C, as an equivalence relation, can also just be viewed as partition PC of X. We should expect that the optimal partition will just be PC.)

What about the full preference dominance order, like the Blackwell order gives us for the base setting?

## 4.1.1. The GR-Blackwell order

We can indeed give a characterization of this order which parallels the Blackwell Informativeness Theorem.

The key idea is to look at the new equivalence classes of φ with respect to U(φ): namely, the expected utility now depends exactly on what distribution of s∈S gets assigned each action a∈A. This suggests that we should look everything in terms of distributions over S.

We then find that for φ′ to be dominated by φ, it's not necessary for φ′ to be a garbling of φ (though this is of course still sufficient), but only necessary that "the mapping of system states to signals implied by φ′" is a garbling of "the mapping of system states to signals implied by φ". They will further be

equivalentif and only if they imply the same joint distribution of (S,M).Formally,

## GR setting definitions

Just as the elements of D(φ) correspond to stochastic maps X→ΔA formed by π∘φ, the elements of DS(φ) correspond to stochastic maps ΔS→ΔA formed by π∘F(φ).

Then we have:

## The GR-Blackwell order

This is the same result as the Blackwell Informativeness Theorem, but after applying a functor F which quotients out the equivalences induced by f:X→ΔS (while leaving everything else unchanged):

And once we've stated it like this, if we look at the proof of the regular Blackwell order, we can see that each part carries over almost exactly. Substitute S and F(φ), and you've proved this new equivalence.

The only place an additional step is added is in (3)=>(2). Our separation theorem gives us (towards contradiction) a π′, u∈RS×A such that ∑S,A[π′∘F(φ′)]sausa>∑S,A[π∘F(φ)]sausa for all π.

Meanwhile, U(φ) is maxπ∑X,A[π∘φ]xaU(f(x),a); but after some rearranging, this can be written maxπ∑S,Ap(s)[π∘F(φ)]saU(s,a), where p(s)=∑X[f]xs.

This extra factor of p(s) is then no problem for the proof - we can just take ¯U(s,a)=usa/p(s) (instead of ¯U(s,a)=usa) as the contradictory utility function preferring φ′. But it highlights how a) the likelihood of states doesn't impact preferences over

allutility functions (though it can matter for other questions), and b) even if we start by considering only a uniform prior on X, the introduction of the system S allows us get back a weighted version of our setting. (Indeed, if we redefine 'information structures' to be equivalence classes of F(φ), this is exactly what we would have - but with some restrictions on the set of possible information structures if f is nondeterministic).## Alternate precomposition form

In fact, another reflection of the same scaling invariance: while we normalized F(φ) to be a proper stochastic map (i.e. column-stochastic matrix) by dividing by ∑x[f]xs, the equation F(φ′)=γ∘F(φ) will hold iff the same equation holds

^{[9]}with unnormalized F(φ). Inspecting our equation for F(φ)(s), we can observe that this unnormalized form of F(φ) as a matrix is actually just φfT. This gives us a nice alternate statement of prong 1), equivalent to all the rest:## 4.1.2 Gooder Regulator revisited

Let's explicitly show how the Gooder Regulator Theorem relates to the GR-Blackwell order, and the minimal information structure which weakly dominates all others.

Let XS={f(x):x∈X} - as a set, so potentially |XS|<|X|. And to make it clearer what role M plays: we'll take M={1,...,|XS|} to be an enumeration of it, rather than XS itself; write M(x) for the index of f(x) in M.

Define φS by φS(x)=M(x) (deterministically).

Then the Gooder Regulator Theorem is to show that for all information structures φ:

We'll give a quick proof in these terms - not too different from Wentworth's, but taking advantage of the fact that φS allows for globally optimal actions.

Proof:

1) For the first part, we can just remark that for any U, the globally optimal action for x is argmaxAU(f(x),a)

^{[10]}, so the globally optimal behavior A(x)=argmaxAU(f(x),a) is achievable with a policy from φS. Hence φS dominates any possible information structure.2) For the second part: if |φ|<|φS|, by pigeonhole there necessarily exists an m∈Mφ such that [φ]x1m,[φ]x2m>0 with f(x1)≠f(x2).

It suffices to find a pair A,U such that the optimal action for x1 is different from the optimal action for x2 - then U(φ) will be lower than the global optimum, so φ<UφS and φ≱SφS.

Hence we need vectors v1=(U(si,a1))i, v2=(U(si,a2))i such that f(x1)⋅v1>f(x1)⋅v2f(x2)⋅v1<f(x2)⋅v2

Taking v1=f(x1)/||f(x1)||, v2=f(x2)/||f(x2)||, we have the desired result. □

## Where's the posterior?

What here is isomorphic to "the posterior distribution on S given X", (s↦P[S=s∣X]), promised by the Gooder Regulator theorem?

It's certainly not the states of M, in isolation - M is just an arbitrary set with the right cardinality. It's more reasonable to say that it's φS (a.k.a. M(X)). Indeed, φS:X→M and x→(s↦P[S=s∣x]) do induce the same equivalence classes of x, so if we look at the posterior as a function X→{P[S=s∣x]} (n.b. not as X→ΔS), then they are isomorphic as Set functions.

However, this isn't necessarily the equivalence we're looking for. Different systems (S,f) with different posteriors can induce the same optimal φS - as again, they just need to have the same equivalence classes of x. That is, there's no isomorphism between S↦(s↦P[S=s∣x]) and S↦φS. Nor are systems yielding the same optimal φS necessarily 'effectively identical' - they can induce different overall preorders over information structures, with e.g. different (and even different numbers of) k-optimal information structures. Contra Wentworth, the "model M(x)" (a.k.a φS) by itself does not contain all of the information from the posterior.

That said, when we consider a single agent that can optimally satisfy any U:S×A→R, it is still reasonable to say the agent as a whole must model the Bayesian posterior. This is because it must 'know' what distribution of states each signal m corresponds to in order to choose the optimal policies for each U (we can easily show this: the optimal policy for some U would shift if p(s∣m) were different). The distinction is just that this information doesn't have to be propagated from X→M; it doesn't have the type "something which must be a function of the observation". We can think of it as (allowed to be) precomputed, or built into the agent. Regardless, really it is the pair (φS,U↦πU) which must contain the

fullinformation from the posterior.This is a bit of a subtle distinction, but the kind which can be important.

## 4.1.3 Convergence is still limited

Has this additional structure allowed for the possibility of natural abstractions, given the right system (S,f)? Generally, does this setting allow us to model the kind of preference structures over abstractions that we're interested in? Not entirely.

The reduction by F does introduce additional convergence - and asymmetric convergence, as in general F will differentially expand the equivalence classes and dominated sets of different information structures. But, especially in the 'universal preference' setting, we're still restricted by the identical role each s∈S must play in the outcomes.

One reflection of this is that for any k<|ϕS| short of the critical size allowing full information of the system, it is still impossible to make all utility functions agree on a single ϕ of size k which they prefer to all others of that size. Surely we ought to at least be able to

representuniversal preferences for a particular compression.While a full discussion of the number of Pareto optimal information structures at a given size is out of scope, we'll sketch a few quick properties:

of Sis the unique smallest partition dominating itself.^{[11]}as O((|XS|k)), initially growing ~exponentially as k diverges from 1 or n.This limits the maximum possible convergence of abstractions. To go further, we must allow for more substantial shared structure between the utility functions.

## 4.2. Adding a common world

Specifically, the additional structure we need is a common world, so that different utility functions share the same relationships between context states x and actions.

Define:

W: a set of outcomes

T:(X,A)→W, a transition function

and redefine U:W→R.

We'll call the pair (W,T) a 'world'

^{[12]}.Our setting now looks like this:

Notice that if T happens to factor as T(x,a)=(f(x),a) for some S and f:X→ΔS, then we're back in the Gooder Regulator setting. Generally, for this additional structure to do anything new, T must be many-to-one, and the images of different actions must overlap.

## 4.2.1 Universal preferences in a common world

In this setting, what can we say about universal preferences?

The equivalence of prongs (2) and (3) from the Blackwell Informativeness Theorem carries over just fine.

For (2), our attainable outcome distributions are now distributions over W rather than over (X,A) or (S,A) - all along these have been 'distributions over whatever the utility function is allowed to care about', and now that doesn't (necessarily) factor in such a way. T is allowed to map arbitrary combinations of x,a to the same outcome.

In other words, there are still universal preferences for exactly those information structures which yield strictly larger sets of attainable outcomes, but with outcomes now coming through the world.

However, prong (1) is trickier. While it's easy to find sufficient conditions for φ to yield more attainable outcomes than φ′ (as the conditions from the original or good-regulation orders still work), it's harder to give meaningful necessary conditions. This is essentially because x and x′ can yield some of the same outcomes, and be equivalent for some purposes, without being globally equivalent. We can say that for all π′, there must exist some π such that T∘⟨idX,π∘φ⟩=T∘⟨idX,π′∘φ′⟩ but not necessarily that φ and φ′ have some simpler linear relationship. While there is likely more to say here, I don't know that (1) has a straightforward equivalent.

Then for now all we have is:

## Proposition:

The fact that universal preferences are less simple for arbitrary W,T is exactly why they can now start to exhibit more different behaviors.

## 5. Example (universal) convergence behaviors

On that note: let's now look at some possible convergence behaviors, as we vary the world. It's possible to control these behaviors quite a bit, even if we still only consider the preferences shared by all utility functions.

## 5.0 Redux: simple divergence and simple convergence

First, the convergence behaviors of the Blackwell and good-regulator settings are of course still possible. This will happen if our 'extra shared structure' doesn't actually add structure after all, or if it adds only GR-type structure.

That is, if W=X×A with T(x,a)=(x,a), then we are in the base setting and there is no "non-trivial" convergence. Similarly, if there exist S, f:X→ΔS such that W=S×A and T(x,a)=(f(x),a), then we are in the GR setting with "simple" convergence at the critical size |XS|, and variable but rapid divergence below.

## 5.1 Multi-capacity convergence

A new behavior in this setting is universal convergence at multiple scales.

Consider

X=[1..4]×[1..5]A=[1..2]×[1..5]×[1..10]W={∅}∪[0..10] with T(xi,∗,a1,i,r)=0.99∗wr+0.01∗w∅T(x∗,j,a2,j,r)=wrotherwise T(∗,∗)=w∅

The environment has two dimensions, one of size 4 and one of size 5. Each action ak,c,r has a 'kind' k, a 'condition' c, and a 'target' r - when value of c matches the kth dimension of the state, the result is the 'target' state wr, otherwise the result is the null state w∅. However, actions of kind 1 are fallible, and have a 1% chance to map to null state anyways. That is: the first dimension is smaller, so its conditions can be matched using a smaller partition, but it is less reliable.

In this setting, dividing along the first dimension is uniquely dominant among partitions of size 4, while dividing along the orthogonal(!) second dimension is uniquely dominant among partitions of size 5. For any state you might prefer, those partitions allow you to get the most of it (and there is no tradeoff among less-preferred states). This example can be extended to get arbitrarily long orthogonal chains of uniquely dominant partitions at different sizes.

We can also imitate this behavior using a fully deterministic T

^{[13]}.## 5.2 Capacity-dependent convergence and divergence

We can also have different convergence behaviors at different scales - including abstractions that converge at one capacity, but diverge non-trivially at larger sizes.

Consider

X=[1..4]×[1..10]A=[1..2]×[1..10]W={∅}∪[0..10] with T(xi,∗,a1,i,r)=0.99∗wr+0.01∗w∅T(xi,r,a2,i,r)=wrotherwise T(∗,∗)=w∅

Again dividing along the first dimension is uniquely dominant among partitions of size 4. However, there is no partition of size 5 (or 6..13) which dominates all others: if U most prefers wr, then it will most prefer separating x=(i,r) into it's own part. By size 14, the information structure can fully discriminate the states of the environment with different response characteristics, and there is once again a single dominant information structure.

We can glue multiple copies of this and the previous example together - leading to convergence and divergence at different scales of our choice.

## 5.3 Discussion

Overall, by funnelling all U through the same outcomes W, many of the behaviors that could hold for a single utility function in 2. can now be made to hold for all utility functions in an appropriate world.

A few things to highlight about example 5.2:

This is the kind of behavior we'd need to see for practically useful natural abstractions, and given the right (bounds on a) cost function for capacity would lead to the same or similar information structures for many U.

Of course, this just shows 'if we deliberately force our environment to exhibit convergent abstractions, then we get convergent abstractions'. We can also have no convergence, or convergence within a particular capacity range that shifts to a different convergent abstraction at a higher capacity.

This is all right and proper - the existence of natural abstractions is supposed to depend on specific kinds of regularity in the environment. This version of the formalism has made it

possibleto get convergence, but the real question is what realistic conditions on the environment would produce what behaviors. We've also confirmed that it's at least possible to come up with environments which produce abstractions that depend on the agent's capacity. To claim that differently-capable agents will use the same abstractions (if we care to^{[14]}), we'd need to find conditions which rule that back out.The shape of the examples also hints that while it's possible for abstractions of different sizes to be unrelated, it's probably not too hard to come up with conditions such that they 'usually' aren't. At the same time, it's not clear that realistic conditions would imply this

neverhappens.## 6. Beyond universal preferences

But before we go further on that front, let's develop a more granular and more practical means of comparison than 'preferred by all utility functions'. We want to be able to notice when 'most' utility functions share a preference, even if not strictly all.

If we want to talk about preferences 'many' or 'most' utility functions, we need a way to measure them. What should this be? Well, for any given application, what we really care about is the

probability measurecoming from our beliefs - for example, if we're interested in a potential agent created by some training procedure, then we care about our subjective distribution on U given that training procedure. But we don't know at this point what that will be, so we are interested in results that we can either parameterize by our probability distribution, or that hold for some class of distributions.It's... not actually quite redundant to look at what's true for all distributions, depending on what questions we ask; but for the most part this is covered by our discussion of what's true for all utility functions (consider the trivial distributions which assign all measure to a given U).

Our first step will instead be to look at 'uninformative' distributions which are invariant under particular symmetries of the problem. To do so, we'll apply ideas from Turner's power-seeking work.

We won't

exactlyfollow the formalism of Parametrically Retargetable Decision-Makers Tend To Seek Power, for the key reason that their central relation ≥nmost: Θ describing "inequalities which hold for most orbit elements" is not transitive. But several parts of this section will closely parallel their results (and at one point we'll directly apply a lemma from this paper). Apart from the issue of transitivity, we'll make some slightly different choices in coverage and presentation, generalizing in some ways, while (for expedience) losing generality in others. Properly reconciling these is a topic for another post.(Side note: it would also be natural to look at the 'maximum entropy distribution over all utility functions' in particular. We need to be slightly careful about what exactly this is

^{[15]}, but presumably one can show that for this case, information structures are preferred in direct proportion to their mutual information with the outcomes. We won't pursue this here, as it would take us a bit off-track, but leave it as a conjecture.)## 6.1 Dominance for all distributions from a class

Once we're measuring U according to some distribution D, there are a few natural questions we might ask in order to compare information structures φ and φ′ in terms of this measure, including:

In particular, we might wonder: can we get preorders out of these conditions which parallel the Blackwell and Blackwell-like orders, but allow for more granular comparisons?

For 1), it turns out the answer is no: comparing φ and φ′ in terms of the measure for which U(φ)>U(φ′) leads to a non-transitive relation even for individual (symmetric) distributions over U. That is, writing φ>!φ for PD(U(φ)>U(φ′))>PD(U(φ)<U(φ′)), there can be cycles

^{[16]}with φ1>!φ2>!φ3>!φ1, but φ1≮!φ2. The same holds for >! defined as PD(U(φ)>U(φ′))>c∈(0,1)).However, the latter two don't have this problem: the probability PD(OptΦ(φ)) that φ is optimal out of Φ, and the expected utility EU∼D[U(φ)], are functions from individual information structures to R. Thus, for any given D, they induce a total preorder on them. This allows us to safely define a preorder by intersection - for example, φ≥Cφ′ if ED[U(φ)]≥ED[U(φ′)] for all D in some class C.

We'll then see how these preorders correspond to bounds on ratios of probability-of-optimality and expected-utility between φ and φ′.

## 6.1.1 Dominance for G-invariant distributions

In particular, we'll look at the relationships between φ and φ′ in terms of the symmetries satisfied by D; that is, we take the class C to be "all distributions satisfying a given symmetry".

We can then give simple sufficient conditions and (weaker) necessary conditions for φ to be preferred to φ over all such distributions, in the sense of higher expected value and higher probability of optimality. First, φ will be always preferred to φ′ if we can imitate its outcomes up to a symmetry - this direction is the same essential idea as Turner's power-seeking results. And in the opposite direction, if φ is preferred for all symmetric D, then each outcome attainable by

allpermutations of φ′ must be imitable by some mixture of permutations of φ.To state this formally, we'll need a few preliminaries.

Given a subgroup G≤S|W| of the symmetric group with action on R|W|, we can take it to act on utility functions, by permuting the utilities assigned to each state. This has

^{[17]}the effect that g⋅U=U∘g−1.Then, we can define:

## Definition: G-invariant distribution

Now, distributions d∈ΔW are just vectors in RW which sum to 1, so we can consider the action of G on them as well

^{[18]}. We can naturally extend this action to sets of distributions over W, such as our attainable outcome distributions, by g⋅D={g⋅d:d∈D}.Finally, we'll write IsOptΦ(φ,U)=1(U(φ)≥maxx∈ΦU(x)), so that PD(OptΦ(φ))=EU∼D[IsOptΦ(φ,U)].

Then our sufficient condition (for the general W setting) will be the following:

## Theorem (g-covering of outcomes implies score-domination under G-invariant distributions)

In fact, this holds for the expectation of any 'scoring function' ν mapping a set of attainable outcomes (or information structure) and a utility function to a real number, which is

The proof follows more or less immediately from these properties, so we leave it to an appendix.

In the other direction, our necessary condition (which we'll state just in terms of expected utility) is:

Proof: Suppose the contrary, and take x∈⋂GD(g⋅φ)∖Conv(⋃GD(g⋅φ′)). As in the Blackwell order proof, we can take a hyperplane which separates {x} and Conv(⋃GD(g⋅φ′)), giving a U which prefers x to any point attainable by any g⋅φ′. Now x is attainable by each g⋅φ, so U(g⋅φ)>U(g′⋅φ′) for any g,g′, and hence certainly ∑GU(g⋅φ)>∑GU(g⋅φ′). Therefore EU∼D[U(φ′)]>EU∼D[U(φ)] for D uniform over the orbit of U - a contradiction. □

In a narrow sense, this is strict, as we can find counterexamples with EU∼D[U(φ′)]>EU∼D[U(φ)] even if |G|−1 of the orbits of each point in D(φ′) are contained by

everyorbit of D(φ). However, there should be a related necessary-and-sufficient characterization, giving a proper generalization of the Blackwell Informativeness Theorem; we set this aside for now.## Additional results for the Blackwell setting

To further show how this is all still connected to the Blackwell order, let's also give conditions corresponding to prong 1) of the Blackwell Informativeness Theorem, for the traditional Blackwell setting where W=(X,A) and T=id.

Suppose G acts independently on each of X and A - and permutations of A are in fact always irrelevant (when we allow all policies), so equivalently it acts only on X.

Then our sufficient condition

is equivalent to

^{[19]}This is because here the action of G on an outcome distribution is just a relabelling of X, and we can

^{[20]}equally perform this relabelling before applying φ. In fact, this characterization will work whenever we can define an action of G on X and A such that G 'commutes' with T, in the sense that g⋅T(x,a)=T(g⋅x,g⋅a) (which will not in general be possible).When G is the full symmetric group S|X|, this means that all information structures with the 'same weight distributions' across signals are equivalent - for deterministic partitions, this is 'the same set of part sizes'.

Beyond the independent case, when G acts arbitrarily on X×A and can permute action-values across states, then the condition on φ is less obvious, though we can at least show it is a) nontrivial, b) different from the independent case, c) likely some form of majorization condition

^{[21]}. We also set this aside for now.Finally, we'll note that our necessary condition can be translated to a similar form, but doesn't appear particularly enlightening

^{[22]}.## 6.2 Quantitative dominance

At this point, we've found a kind of superiority weaker (and so more general) than 'preferred for all possible utility functions', but we still haven't moved beyond a binary 'preferred' or 'not preferred' relationship for φ::φ′.

To do so, a natural idea is to move from simple inequalities EU∼D[ν(φ′,U)]≤EU∼D[ν(φ,U)] to inequalities parameterized by a scalar c∈R - for example, defining φ′≤G,cEUφ by EU∼D[U(φ′)]≤c⋅EU∼D[U(φ)] and similarly for PD(OptΦ(φ′))≤c⋅PD(OptΦ(φ)). This clearly gives another preorder, and is a perfectly reasonable way to compare information structures under a particular distribution D. But taking a lower bound c such that this holds for all symmetric distributions D is not actually interesting: if we take a trivial D={U1}, U1(w)=1 for all w, then the expectations will just be equal, making c always 1.

However, we can define a related relationship with less trivial bounds:

Note that this is equivalent to EU∼D[ν(φ′,U)]≤c⋅EU∼D[ν(φ,U)] for exactly c=1, but not otherwise.

It's less obvious that this relationship is transitive, since we take the expectation over a different conditional distribution for each pair φ,φ′, but it turns out to in fact be the case

^{[23]}.For this relationship, we can define φ′≤G,c≠νφ to mean φ′≤D,c≠νφ for all G-invariant D, and have this be nontrivial for c>1.

## Multiple G-injections

It's also this relationship ≤G,c≠ν which we can infer by generalizing the previous result about g-injections (paralleling the move from simple- to multiple- retargetability in the parametric retargetability context). Intuitively, if there is not just one copy of D(φ′) within D(φ) via g, but k 'distinct' copies under different g1,...,gk, we should be able to say that φ is not just 'at least as good as φ′' but 'k times better than φ′' in some way. However, we need to be a bit careful with the details.

For this part, we'll apply a lemma from Turner & Tadepalli on "orbit-level tendencies" directly, and give the results only for IsOptΦ.

Specifically, for our family g1,...,gk with gi⋅D(φ′)⊆D(φ), we'll additionally require their conditions

^{[24]}for "containment of set copies" (Definition A.7):Then by their Lemma B.9, we conclude that k⋅∣∣{g:IsOptΦ(φ′,gU)>IsOptΦ(φ,gU)}∣∣≤∣∣{g:IsOptΦ(φ′,gU)<IsOptΦ(φ,gU)}∣∣ for any U (or in their notation, IsOptΦ(D(φ′)∣θ)≤nmost: ΘIsOptΦ(D(φ)∣θ), interpreting once again U as θ∈Θ=R|W|). Since the value of IsOptΦ is in {0,1}, this immediately gives us

^{[25]}that k∑g∈G≠IsOptΦ(φ′,gU)≤∑g∈G≠IsOptΦ(φ,gU) where G≠={g∈G:IsOptΦ(φ′,gU)≠IsOptΦ(φ,gU)}. Since this holds for the orbit of any U, we can conclude that φ′≤G,k≠IsOptΦφ.That is, we have the following theorem:

## Theorem

The conclusion in english: according to any G-symmetric probability distribution, it is at least k times more likely that φ is optimal while φ′ isn't, than that φ′ is optimal while φ isn't.

While somewhat limited, this result gives us an initial scenario where we can establish a kind of quantitative dominance of one information structure over another, for a broad range of distributions of utility functions. The theorem can surely be improved; but for meaningfully stronger conclusions, we'd require stronger assumptions about the environment or the utility function distributions.

## 6.3 Blackwell-like relations correspond to ratio bounds

So far, we've framed our results in terms of various preorders on information structures. Mostly the intuitive meanings of these "≤" relationships are basically their definitions. But to make it clearer what they mean in terms of "convergence" of abstractions, especially for the quantitative relations, we'll mention another interpretation here: each relationship φ′≤∗φ corresponds to a lower bound on a ratio of some quantities related to φ and φ′.

The original Blackwell relation φ′≤BWφ, which states that U(φ′)≤U(φ) for all U, implies that U(φ)U(φ′)≥1 for all U - with the corollary that e.g. PD(OptΦ(φ))PD(OptΦ(φ′))≥1 for any D. Likewise, ≤S and ≤W imply the same for U (and distributions of U) defined on a system S or a world W.

Then, a relation φ′≤Gνφ corresponds to the bound ED[ν(φ)]ED[ν(φ′)]≥1 for all G-invariant D.

And moving to our quantitative relations corresponds to changing the bound from 1 to c. The hypothetical φ′≤c,Gνφ would correspond to a bound ED[ν(φ)]ED[ν(φ′)]≥c - for ν the probability of an event (such as optimality with respect to Φ), this corresponds to

a lower bound on the likelihood ratio of the events, e.g. PD[Opt(φ)]PD[Opt(φ′)]≥c. However, these are exactly the relationships that we found it wasn't possible to guarantee (for c>1) for arbitrary symmetric distributions; which means there is no nontrivial bound on likelihood ratios with our assumptions (recalling e.g. the trivial but symmetric D={U1}, U1(w)=1). It would be possible to get such bounds, but it would require a different type of assumption on D.Finally, our substitute relations like φ′≤G,c≠IsOptΦφ correspond to bounds on more unusual ratios of the form: EU∼D[ν(φ,U)∣ν(φ,U)≠ν(φ′,U)]EU∼D[ν(φ′,U)∣ν(φ,U)≠ν(φ′,U)]≥c When ν is a binary indicator of an event like IsOptΦ, this gives likelihood ratios like: PD(OptΦ(φ)∧¬OptΦ(φ′))PD(OptΦ(φ′)∧¬OptΦ(φ))≥c.

This unusual likelihood ratio highlights that "contains multiple copies"-style relations don't necessarily give us as strong of a form of convergence as we might hope: while they can tell us A and not B is at least k times more likely than B and not A, they can't unconditionally tell us that e.g. pselection(B) is k times more likely than pselection(A) over a symmetric distribution.

Perhaps a simpler takeaway from these ≠ bounds is this: if you can find a U so that the values of ν for A and B are never equal at any point in it's orbit, then the expectation for B is k times greater than for A. That is, if ν(A,gU)≠ν(B,gU) for all g∈G, then k⋅∑g∈Gν(A,gU)≤∑g∈Gν(B,gU). If such a U exists, there will be

someG-symmetric distribution where k⋅EU∼D[ν(A,U)]≤EU∼D[ν(B,U)], though it need not hold for all of them.## 7. Discussion

## 7.1 The Weak Natural Abstraction Principle

A (much) weaker version of the natural abstraction hypothesis would be just: "some abstractions are usually preferred to others" [by most agents, in natural environments]. In this form it is obviously true; if nothing else, surely we can come up with some abstractions which are quite useless, and some which are not. As we advanced through the post, we emphasized how we weren't yet able to guarantee

strongconvergence of abstractions, such that most agents prefer only a "small" number of natural ones. However, we can also see the theorems of this post as providing gradually stronger demonstrations of this weak natural abstraction principle (for our setting).Already from the original Blackwell Informativeness Theorem, we saw that some information structures are strictly preferred to others (in the sense that φ′≤BWφ and φ′≰BWφ) - those providing a superset of information about the world, and so a superset of attainable outcomes given that information structure. Through the GR and W settings, we saw that if there is non-trivial structure to the environment's "outcomes" (which agents are allowed to care about), then information structures need only provide a 'dominant' set of information relevant to controlling these outcomes. This still requires enabling a superset of attainable outcomes, but environmental structure makes this relationship more common. Finally, by moving from 'preferred by all' to 'preferred by more', we saw that the requirement could be softened from 'a superset' of outcomes, to 'unambiguously more' outcomes (in the sense that we could get a superset up to a permitted relabelling of outcomes).

Even the first type of relationship is guaranteed to exist in any nontrivial environment, and so to guarantee us common preferences: bigger information structures with more information will be preferred to similar smaller ones (as long as both are smaller than the whole environment). But this doesn't really capture the spirit of the natural abstraction hypothesis. It tells us nothing about preferences between information structures with the same amount of information, or different amounts of distinct information. By the final case, however, we get something more in the right spirit: as long as the environment has at least

someinformation which is more relevant to controlling outcomes than the rest, there will be convergent preferences towards abstractions which capture that information. Many more abstractions can be compared in terms of 'how much' policy-relevant information they provide.We've then essentially proven an especially weak (and indeed 'obvious') form of the natural abstraction hypothesis. The setting where we prove this is bare-bones, but correspondingly universal: while there are many other elements we'd want to include for a more thorough study of abstractions, basic preferences over 'ways of coarse-graining information' will still apply.

Of course, it's only stronger forms of the hypothesis that would be of much practical use for alignment. Rather than "some abstractions are generally preferred to others", we'd need something more like "most agents will converge on a 'small' number of discrete potential abstractions

^{[26]}". To have a chance to get a result like this, we would need to introduce some of those missing elements.## 7.2 Weak natural abstraction as power-seeking

Intuitively, there's a clear connection between natural abstraction and instrumental convergence: where natural abstraction proposes that certain 'abstractions' are more useful to a wide range of agents (in a given environment), instrumental convergence proposes that certain states or actions are more preferred by a wide range of agents. Since here we have a formal working notion of 'abstractions', as information structures, we can make this connection more explicit. Indeed, in our power-seeking-theorem style analysis, we basically already have - but let's see directly how convergent preferences over abstractions can be seen as a special case of power seeking.

Recall that 'power' in the sense of these theorems is a concept about the choices available to you, so '

seekingpower' only makes sense if you are making at least two successive choices. We're then looking for a sequence of choices which occur in our setting - which are, naturally, 1) your choice of information structure φ, 2) your choice of policy π given the information structure.We can choose to view this as an a two-timestep MDP, with choice of φ leading to a dedicated state sφ, and choice of π leading stochastically to an outcome w∈W via T. Intrinsic reward for each information state sφ is 0, and the reward of an outcome is it's utility

^{[27]}.Then, the standard power-seeking results applied to this MDP

^{[28]}tell us that most parametrically retargetable decision-makers (including but not limited agents choosing according to some utility function) will 'tend' to choose information structures which give them 'more' attainable outcomes via their choice of policy, and hence have higher 'power': higher average optimal value^{[29]}attainable from that state, averaging over utility functions.The original versions of these theorems give us this 'tendency' in a slightly different form than we've used here ("a larger number of orbit elements of a decision-making function which strictly prefer one information structure vs. another"). As discussed earlier, we deliberately use a different formulation to ensure our tendencies (common preferences) are transitive. But up to this reformulation, which could equally be applied to the general power-seeking context, these results are exactly the same ones we saw in section 6.

We can then say that "weak natural abstraction [exists, and] is equivalent to power seeking tendencies in the agent's choice of abstraction", and prove it in a particular formal sense. Tendencies towards preferring certain (natural) abstractions occur exactly when instrumental convergence occurs in an information-selection problem derived from the environment.

## 7.3 Limitations and future work

We've built up one step at a time, from the minimal possible setting and the simplest questions. As a result, we've so far ignored many key aspects of realistic abstractions. We'll briefly go over a few of the most important missing pieces of the story, and how they relate to this framework.

The first missing piece can be summarized as: we ignore "internal" and "local" structure of all kinds. We treat the environment, signal, actions, and outcomes as undifferentiated sets - we don't factor them into variables representing e.g. different

partsof the environment, and relate such structure to the mappings between objects. Relatedly, we don't consider any notion of 'similarity' between different world states, signals, or objects. As an important special case, this includes a lack of any real temporal structure.The real 'substance' of the natural abstraction hypothesis is about the structure of the environment. Local structure is key to stories of why natural abstractions should exist, and what kind of thing they should be - for example, "information relevant to 'far away' variables" inherently requires some notion of distance (usually, a distance in a causal graph). This is well motivated by the local causal structure of the real world. But local structure in the signal and the encoder may also play an important role. For instance: this is what's is required to represent ideas like "similar world states are encoded by similar signals" or "a particular 'part' of the signal always corresponds to a particular 'part' of the environment". Moreover, the signal and encoder will also be embodied in the physical world. I expect such structure may be necessary to properly understand e.g. the modularity of abstractions.

Introducing internal structure to the environment is the main bridge to Wentworth's work on abstractions, and an obvious next step

^{[30]}. Introducing internal structure to the agent and it's boundaries is less-explored, but likely important. This is also where we would model distributions over functional behavior pushed forward from distributions over parameters, via some parameter-function map.Second, we touch only very lightly on similarities between abstractions. Of course, we should care not only whether different agents use exactly the same information structures, but also if they use 'similar' ones. While internal structure opens up more options, we could look at extrinsic similarities even using only the current setting. 'Contains a superset of the information' is one relationship of this type, and we mention in passing 'orthogonality' of deterministic information structures, but there are many more possibilities (starting from mutual information I(φ(X);φ′(X)) - but this alone doesn't constrain 'what' information is shared).

Third, we've ignored all computational aspects of the problem - and thereby any 'reasoning'. The message-size of an abstraction can be considered a particular kind of space complexity, but there are many other tradeoffs - we may be concerned with the the algorithmic (or circuit, etc.) complexity of encoders and policies, as well as of the problems of selecting them. In principle all of this could be cast in terms of cost functions on internal structure, but is also well worth considering from an abstract computational perspective.

Finally, we assumed throughout the optimal choice of policy; and towards the end, we considered optimality with respect to a set of information structures. These can (and should) be generalized from optimality to other criteria. Some of this generalization can be transferred directly from the parametric retargetability setting with a little more care (though there are some details to watch to maintain transitivity). While part of the motivation for non-optimal choice can be addressed through appropriate costs on structure and computation, it is also simply worth generalizing beyond deterministic selection.

A convenient property of our setting is that it's fairly clear how one could add all of these pieces.

## 7.4 Additional remarks

A few other miscellaneous remarks:

Adding a lossy 'perception' between X and φ (i.e. Xρ→Oφ→M) so that φ doesn't have direct access to the environment does nothing more, nor less, than restricting the space of possible information structures. Namely, it restricts to those of the form γρ, a.k.a. those in the cone ≤ρ.

Transferring some of the ideas here back to the general power-seeking context, we can observe for example that a) while no individual action strictly dominates any other, some sets of actions can strictly dominate other (even disjoint) sets, b) a state sα can be strictly preferred to sβ not just over all distributions symmetric under the permutation of every state, but even over all distributions (or U) symmetric only under interchanging the values of sα and sβ.

Another way to view this whole setting is as a problem of lossy compression, which we can analyze through rate-distortion theory. Our interest is different from the usual applications rate-distortion theory in that we're interested in commonalities between the encoders for broad families of abstract "distortions" (derived from utility functions) which may not have anything to do with 'reconstruction', as well as that we currently consider only a single timestep. But similarities among distortion-rate functions for different distortions, especially e.g. phase changes at consistent capacities, may certainly be relevant.

## 8. Conclusion

We started with a simple formal model of abstraction, where an agent must coarse-grain information about a larger environment into a smaller number of internal states. In this model, we asked: when do different agents prefer to abstract in the same way?

We found that while there are few preferences common among all general-form utility functions, as we add more structure to their domain, we can get proportionally stronger convergence. When restricted to preferences over a shared environment, all agents may prefer exactly the same abstractions - or indeed completely different ones, depending on the environment. We gave examples of several possible convergence behaviors, including cases where abstractions converge strongly at particular capacities, but are orthogonal across capacities. We then generalized these results, using a modified version of Turner's power-seeking formalism to show that many more preferences are shared by 'most' utility functions, under priors obeying certain symmetries. Based on this, we showed how natural abstractions can formally be viewed as a type of power-seeking.

Some high-level takeaways:

unrelatedabstractions for agents with different capacities. Quite likely, the same is true for other differences in constraints. There are arguments^{[14:1]}why this might not a problem, and there may be conditions which prevent this from being an obstacle in practice, but we so far lack a formal model of this.And a meta takeaway: taking the perspective that 'abstractions are ways of coarse graining the environment' literally and building a straightforward model of it gives a very tractable setting, with connections to many established fields. By default it lacks key features we'd want to fully model abstractions, but it comes with handles to introduce several of them.

Overall, even if the strongest (and most convenient) forms of the natural abstraction hypothesis turn out to be false, there will surely be some degree of convergence among the abstractions used by different agents in practice. Understanding the factors behind this convergence, and behind the formation of abstractions generally, would be useful in order to know what to expect of AI systems. Even short of strong natural abstractions, these dynamics inform the viability of different interpretability and alignment techniques - under what conditions we can trust them, and when we can expect them to generalize. Furthermore, they have multiple connections to the dynamics of which goals agents will acquire (i.e. agent-selection-processes will bring about) in which circumstances - of obvious importance.

While the theory here is only a very early step, we hope it can help clarify some of the broadest strokes, and show directions for further development.

## Appendix: Omitted Proofs

## Proof of "g-injection of outcomes implies EU-dominated under G-invariant distributions"

Let ν be a function which scores a set of attainable outcome-distributions against a utility function, so ν:P(R|W|)×R|W|→R, with the following properties:

Then ν also naturally scores information structures, by ν(φ,U)=ν(D(φ),U).

Lemma: If g∗⋅A⊆B, then ∑Gν(A,gU)≤∑Gν(B,gU).

Proof: We have ∑Gν(A,gU)=∑Gν(g∗A,g∗gU)=∑Gν(g∗A,gU)≤∑Gν(B,gU), with the three equalities following from G-invariance, the sum being over the same orbit, and monotonicity respectively. □

Corollary: For any G-invariant distribution D over utility functions, ED[ν(A,U