Training Garrabrant inductors to predict counterfactuals

[TsviBT]

---

author:

• ‘Tsvi Benson-Tilsen’ title: Training Garrabrant inductors to predict counterfactuals …

The ideas in this post are due to Scott, me, and possibly others. Thanks to Nisan Stiennon for working through the details of an earlier version of this post with me.

Github pdf: https://​​github.com/​​tsvibt/​​public-pdfs/​​blob/​​master/​​decision-theory/​​training-counterfactuals/​​main.pdf

We will use the notation and definitions given in https://​​github.com/​​tsvibt/​​public-pdfs/​​blob/​​master/​​decision-theory/​​notation/​​main.pdf. Let $\overline{P}$ be a universal Garrabrant inductor and let $\overline{U}:N^{+}\to \text{Expr}(2^{\omega }\to R)$ be a sequence of utility function machines. We will define an agent schema $\left(A_n^{U_n}\right)$.

We give a schema where each agent selects a single action with no observations. Roughly, $A_n^{U_n}$ learns how to get what it wants by computing what the $A_i^{U_i}$ with $i<n$ did, and also what various traders predicted would happen, given each action that the $A_i^{U_i}$ could have taken. The traders are rewarded for predicting what (counterfactually) would be the case in terms of bitstrings, and then their predictions are used to evaluate expected utilities of actions currently under consideration. This requires modifying our UGI and the traders involved to take a possible action as input, so that we get a prediction (a “counterfactual distribution over worlds”) for each action.

More precisely, define $$\begin{array}{cc}{A}_n^{U_n}:=& \text{let}{\hat{P}}_n:=\text{Counterfactuals}\left(n\right)\\ & \text{return}{argmax}_{a\in \text{Act}}{\hat{E}}_n\left[a\right]\left(U_n\right)\end{array}$$

where $${\hat{E}}_n\left[a\right]\left(U_n\right):=\sum _{\sigma \in 2^n}{\hat{P}}_n\left[a\right]\left(\sigma \right)\cdot U_n\left(\sigma \right).$$ Here ${\hat{P}}_n$ is a dictionary of belief states, one for each action, defined by the function $\text{Counterfactuals}:N^{+}\to (\text{Act}\to \Delta (2^{\omega }\left)\right)$ using recursion as follows:

<span>input:</​span> $n\in N^{+}$

<span>output:</​span> A dictionary of belief states $P:\text{Act}\to \Delta \left(2^{\omega }\right)$

<span>initialize: </​span>${\text{hist}}_{n-1}\leftarrow$ array of belief states of length $n-1$

<span>for</​span> $i\le n-1$:

${\hat{P}}_i\leftarrow \text{Counterfactuals}\left(i\right)$

$a_i\leftarrow {argmax}_{a\in \text{Act}}{\sum }_{\sigma \in 2^i}{\hat{P}}_i\left[a\right]\left(\sigma \right)\cdot U_i\left(\sigma \right)$

${\text{hist}}_{n-1}\left[i\right]\leftarrow {\hat{P}}_i\left[a_i\right]$

<span>for </​span> $(a:\text{Act})$:

$P\left[a\right]\leftarrow \text{MarketMaker}({\text{hist}}_{n-1},{\text{TradingFirm}}^{\prime }(a,a_{\le n-1},{\text{hist}}_{n-1}\left)\right)$

<span>return </​span> $P$

Here, we use a modified form of traders and of the ${\text{TradingFirm}}^{\prime }$ function from the $LIA$ algorithm given in the logical induction paper. In detail, let traders have the type $$N^{+}\times \text{Act}\to \text{trading strategy}.$$ On day $n$, traders are passed a possible action $a\in \text{Act}$, which we interpret as “an action that $A_n^{U_n}$ might take”. Then each trader returns a trading strategy, and those trading strategies are used as usual to construct a belief state $P\left[a\right]$. We pass to ${\text{TradingFirm}}^{\prime }$ the full history $a_{\le n-1}$ of the actions taken by the previous $A_i^{U_i}$, since ${\text{TradingFirm}}^{\prime }$ calls the Budgeter function; that function requires computing the traders’s previous trading strategies, which require passing the $a_i$ as arguments.

Thus, traders are evaluated based on the predictions they made about logic when given the actual action $a_n$ as input. In particular, the sequence $\left(P_n\right[a_n\left]\right)$ is a UGI over the class of efficient traders given access to the actual actions taken by the agent $A_n^{U_n}$.

This scheme probably suffers from spurious counterfactuals, but feels like a natural baseline proposal.