Special thanks to Abram Demski, Paul Christiano, and Kate Woolverton for talking with me about some of the ideas that turned into this post.
The goal of this post is to present a new prosaic (i.e. that uses current ML techniques) AI safety proposal based on AI safety via debate that I’ve been thinking about recently.[1] I’ll start by describing a simple version of the proposal and then show some of the motivation behind it as well as how the simple version can be expanded upon.
Simple proposal
Let M and Adv be models and H be a human. Intuitively, we’ll train M and Adv via the following procedure given a question Q:
M tries to predict what, at the end of the procedure, H will think about Q.
Adv tries to output a string which will cause H to think something maximally different than what M predicted.
Return to step 1 and repeat until M’s predictions stop changing.
Deploy M, which in the limit should act as an oracle for what H will think about Q after seeing all relevant information.
There are many different ways to implement this intuitive procedure, however.
For the first (simplified) version that I want to describe, we’ll restrict ourselves to just the situation where Q is a yes-or-no question and M outputs the probability that H will answer yes. Then, given a proposition Q0, we can run the following training algorithm, starting at t=0:
Let pt=M(Qt).
Let xt=Adv(Qt,M).
Let Qt+1 be the string containing Qt and xt.
Increment t and return to step 1. When pt converges and/or the desired number of iterations has been reached, continue.
Let p∗=H(Qt) be H’s final estimate of the probability of Q0 given all the xs included in Qt.
EDIT: Step 2 used to use xt=Adv(Qt,pt) instead of xt=Adv(Qt,M), however I have since realized that it is necessary to give Adv the ability to query M in general, not just on Qt, as I explain in this comment.
Then, for each step, compute M’s loss for that step as
LM,t=−p∗log(pt)−(1−p∗)log(1−pt)
and Adv’s loss for that step as
LAdv,t=−|pt+1−pt|
which is defined for all but the final step t=n, for which we can either let pn+1=p∗ (if we’re doing something like myopic RL that doesn’t care about differentiating through pt+1) or run M an additional time and let pn+1=M(Qt+1) (if we do care about differentiating through pt+1).
Note that it is quite important here that M and Adv be behaving myopically, such that they are only trying to minimize their per-step loss. For example, if Adv is non-myopic, it might dole out information slowly in tiny bits to get more reward over time (as I talk about below in the “buying truth from a liar” section), whereas if Adv is myopic, it should reveal all information that pushes in whichever direction it’s trying to move M in all at once. Thus, it is important that we make sure to avoid hidden incentives for non-myopia as well as do some sort of myopia verification, the details for which will be discussed below in the “Adding oversight” section.
Finally, we deploy M as a yes-or-no question oracle for H and throw away Adv. Note that since Adv has a highly unstable objective—as M is constantly trying to incorporate Adv’s information into its estimate—Adv is unlikely to be very useful in the limit.
Market analogy
There are a lot of different things to say about what’s going on here, but I’ll start with the market-based analogy that originally motivated me to think about this specific proposal.
Suppose you have a prediction market for some proposition X which is currently priced at p with no spread (that is, you can buy $1 shares of yes for $p and $1 shares of no for $(1−p)) and you have budget B with which to make trades (which is small enough relative to the market that any trades you make won’t meaningfully move the market). However, suppose that you have the ability to manipulate the market by taking actions that change the underlying probability of X. Then, if pa is the probability of X after taking action a, how much money can you make by strategically selecting a?
Well, if pa>p, you should buy Bp shares of yes, which will give you an expected return of paBp. Alternatively, if pa<p, you should buy B1−p shares of no, which will give you an expected return of (1−pa)B1−p. Thus, the overall expected return for an action a is
B⋅max(pap,1−pa1−p)
which is maximized when pa is as far from p as possible (and in fact looks a lot like L1 distance, just with a different slope on each side).
Now, suppose you walk up to a market like this and see a stable price ^p for X. What does that tell you? Approximately, I think it tells you that ^p is the probability of X after all possible X-manipulating actions have been taken—even if those actions haven’t actually been taken yet.
Why is that useful? Well, if you let X be what H will think about Q, then “manipulations” become arguments and ^p becomes a prediction for what H will think after having been exposed to all possible arguments for or against Q. Thus, we can use such a market to estimate a sort of reflective equilibrium for what H will end up believing about Q.
Now—how is such a market analogous to the training procedure given previously? Well, Adv is trained to maximize its return from manipulating the market and M is trained to predict the final outcome after many such manipulations. Thus, we are effectively training M to estimate precisely the ^p equilibrium that we’re looking for. Conceptually, M is acting as a market maker and Adv is acting as a trader in the market. The one disanalogy is that we only run the debate for so many steps—though if we always run to convergence of pt, in the limit that should imply that any future single manipulation won’t change the probability much from that point (since otherwise Adv should have selected that manipulation instead).
Relation to buying truth from a liar
In working on this proposal, I discovered that my approach here is actually quite similar to an old proposal by Katja Grace called “How to buy a truth from a liar” for incentivizing a liar to give you true information by rewarding them whenever their information causes you to change your mind. Paul Christiano previously wrote about what he thought about Katja’s proposal, however he eventually concluded that it was untenable due to a non-myopic liar being incentivized to split their information into arbitrarily small chunks to get the most money.
In my opinion, however, the fact that you need a myopic trader to make something like this work is actually more of a feature than a bug. First, note that the importance of myopia is not unique to this approach. For example, imitative amplification also requires myopia lest the model learn to act in such a way that the human consulting it becomes easier to predict. In fact, even RL likely requires per-episode myopia to avoid deceptive alignment lest the agent learn to act deceptively in some episodes to ensure deployment and thus get greater reward in others. Thus, it seems to that almost regardless of what approach is taken, at least some form of myopia will be required. Furthermore, the fact that this approach requires per-step myopia rather than per-episode myopia is in my opinion actually a big plus, since I suspect per-step myopia to be an easier condition to enforce than per-episode myopia, as I discuss in more detail below in the “Analysis” section.
Handling non-binary questions
Previously, I restricted Q to be only a yes-or-no question, which is a pretty big limitation on the above proposal. Since you only deploy M, all you get from the above proposal is a yes-or-no oracle, which might not be that useful without any explanation for its answers, especially given that it will certainly get at least some of its answers wrong.
Expanding the above proposal to handle arbitrary questions, however, is fairly straightforward. Instead of having M output a single probability, we can instead just have M output a probability distribution over all different possible strings that the human H might produce as their final answer to Q (which is fairly easy to represent via an autoregressive language model). Then, we can train M and Adv via the following procedure, given Q0 and starting at t=0:
Let xt=Adv(Qt,M) (which we can implement as something like Adv given input Qt and the ability to query M).
Let Qt+1 be the string containing Qt and xt.
Increment t and return to step 1. When M converges and/or the desired number of iterations has been reached, continue.
Let A=H(Qt) be H’s final answer to Q0 given all the xs included in Qt.
Then, for each step, compute M’s loss for that step as
LM,t=−log(M(Qt)|A)
and Adv’s loss for that step as
LAdv,t=−KL(M(Qt+1)||M(Qt))
where you can intuitively think of KL(M(Qt+1)||M(Qt)) as measuring how well M(Qt) performs as a prediction of M(Qt+1).
Finally, after training we again just deploy M and throw away Adv. Now, in the limit we should get a much more powerful M that is able to actually produce text samples from the distribution of beliefs that H will have about Q after seeing all possible arguments for or against. Furthermore, this equilibrium should be very similar to the standard debate equilibrium, with the exception that for non-binary questions like we’re dealing with here, debate only finds the equilibrium after H is exposed to the two most convincing positions (the two competing debaters) whereas this approach should find the equilibrium after H is exposed to all potentially convincing positions, not just the two most convincing.
Incorporating cross-examination
Additionally, since this proposal is based on AI safety via debate, we can try to make use of some of the additional techniques that have been proposed for that setting. Specifically, consider the version of AI safety via debate as described in “An overview of 11 proposals for building safe advanced AI.” That version adds two major components to the basic debate setup:
Debaters are given access to transparency tools and incentivized to use them to identify deceptive or otherwise catastrophic behavior in the other debater to win the debate.
Debaters are given the ability to cross-examine previous versions of the other debater, including applying their transparency tools to previous versions of the other debater.
While it might seem like such modifications are unique to AI safety via debate, in fact AI safety via market making is similar enough that we can modify it to include such additional components. To do this, we’ll modify each xt to include an inspectable, queryable snapshot of Adv as it produced that xt.
Now, suppose that for some t=t′, xt′ is a lie such that it includes information that Advt′ knows to be false (where Advt′ represents the internal state of Adv when it produced xt′). Suppose that at this point M is either unaware of the deception (or thinks it won’t get caught) such that xt′ causes a large movement in M(Qt′). Now, the hope is that Advt′+1 should be able to identify the deception by querying Advt′ to find contradictions, or directly inspecting Advt′‘s cognition in producing xt′ and finding the deception. If it can do so, then it should be able to produce an xt′+1 that points this out, which should cause H to disregard the lie of xt′. Thus, we should get M(Qt′+1)≈M(Qt′−1), which should cause a large shift relative to M(Qt′), highly rewarding Advt′+1 for catching Advt′’s lie, and also in the limit highly disincentivizing Adv from producing such lies, since M should learn that lies always get caught and thus don’t change the final answer.
Thus, by incorporating inspection and cross-examination, we should be able to disincentivize Adv from lying—or at least not lying in a way which will be caught, which hopefully should be all ways of lying.
Adding oversight
While the inspection and cross-examination procedure detailed above seems likely to help a lot in preventing Adv from becoming deceptive, it doesn’t help at all in preventing M from becoming deceptive, which is especially concerning considering M is the model we actually want to deploy at the end of training. Thus, in this section we’ll try to incorporate an additional oversight check on M such as that used in relaxed adversarial training.
Since M‘s objective is compatible with myopia—as it’s a purely predictive objective—we should be able to do myopia verification to prevent M from becoming deceptive.[2] Thus, following “Relaxed adversarial training for inner alignment,” we can amend M‘s objective to include an oversight term. Specifically, let Amp(M)(Q)=H(Q|M) be H’s answer to Q given access to M. Then, we can add an additional term LM,t,oversight to the loss LM,t defined as
LM,t,oversight=Amp(M)(“What is the probability that M(Qt) is non-myopic?”)
which should both hopefully grow in accuracy as M becomes better at estimating H’s equilibrium beliefs and thus better at assisting H in oversight. Note that, for this to work, M will need to be trained on a variety of oversight-relevant questions.
Furthermore, since Adv also has a myopic objective, we can do the same thing for Adv and add an additional LAdv,t,oversight term defined as
LAdv,t,oversight=Amp(M)(“What is the probability that Adv(Qt,M(Qt)) is non-myopic?”)
such that we’re using M to oversee both M and Adv. Enforcing myopia for Adv also prevents the problem noted previously of Adv slowly doling out information if it’s non-myopic.
Analysis
For analyzing this proposal, I’m going to make use of the same breakdown I used in “An overview of 11 proposals for building safe advanced AI.” If you’re not familiar with the terms here, they are all explained in the introduction to that post.
Outer alignment. In terms of outer alignment, I think there is a reasonably strong argument to be made that this proposal is at least as outer aligned as debate. Both proposals are trying to estimate a very similar equilibrium in the limit—with the exception that the debate equilibrium only includes the best arguments for the two most convincing positions rather than all potentially convincing arguments. Thus, the equilibrium reached by AI safety via market making should be closer to an actual human reflective equilibrium, as it has to be an equilibrium relative to all possible arguments that Adv can present, not just the two it thinks will be most persuasive. That being said, AI safety via market making still inherits many of the potential outer alignment issues of debate, including the possibility of deceptive equilibria wherein the human is more convinced by false arguments than true arguments. Hopefully, however, the use of techniques such as cross-examination should help alleviate such issues.
Inner alignment. AI safety via market making gets to make use of both the cross-examination with transparency tools approach—which is otherwise unique to debate—as well as the more general relaxed adversarial training approach. Thus, hopefully at least, it should be able to get the inner alignment benefits of both approaches. That being said, AI safety via market making also has to contend with ensuring that two different models—both M and Adv—are inner aligned, rather than just a single model as in something like debate or amplification.
First, let’s consider the inner alignment of M. For M, we’re doing pretty straightforward oversight of M by Amp(M) with the goal of enforcing per-step myopia. The basic idea here is to use Amp(M) to detect and disincentivize non-myopia as it starts appearing, thus preventing M from ever becoming deceptive or otherwise catastrophic. This is the same basic approach I’ve previously proposed using for amplification and should have similar properties, with the exception that M is trained differently here, which could cause Amp(M) to be relatively better or worse at oversight. Ideally, if the training distribution includes lots of oversight-relevant questions, it should be possible to make M an effective assistant to H in performing oversight.
Second, let’s consider the inner alignment of Adv. Compared to debate, we still get to do cross-examination with transparency tools, but now we also get to do per-step myopia verification with Amp(M) as an overseer.[3] Thus, there are two major differences here between AI safety via market making and AI safety via debate: first, we get an overseer—Amp(M)—and second, we get to do per-step myopia verification rather than per-episode myopia verification. The fact that we have an independent overseer—rather than just relying on the debaters to oversee themselves via cross-examination—is very nice, though it of course also comes with the downside of having to safely train an additional model. Furthermore, it is quite possible to just add an additional overseer on top of the standard debate framework. Thus, in my opinion, the fact that we get to do per-step myopia verification is the largest and most significant inner alignment difference.
Before I talk about the importance of per-step myopia, it’s worth noting that debate is fully compatible with per-episode myopia—in fact, it basically requires it. If a debater is not per-episode myopic, then it will try to maximize its reward across all debates, not just the single debate—the single episode—it’s currently in. Such per-episode non-myopic agents can then become deceptively aligned, as they might choose to act deceptively during training in order to defect during deployment. Per-episode myopia, however, rules this out. Unfortunately, in my opinion, per-episode myopia seems like a very difficult condition to enforce—once your agents are running multi-step optimization algorithms, how do you tell whether that optimization passes through the episode boundary or not? Enforcing per-step myopia, on the other hand, just requires detecting the existence of multi-step optimization, rather than its extent, which seems considerably easier. Thus, since AI safety via market making is fully compatible with per-step myopia verification, it could be significantly easier to prevent the development of deceptive alignment.
Training competitiveness. It seems quite likely to me that both M and Adv can be trained competitively via language model fine-tuning, however exactly how effective such training would be is currently unclear. Ideally, training via this procedure should produce an M which is relatively better than the original language model at predicting what a human will think after seeing relevant arguments and is thus more helpful than the original language model. Testing this hypothesis by actually performing experiments seem likely to be highly valuable in shedding light on the training competitiveness properties of AI safety via market making.
Performance competitiveness. Performance competitiveness here seems likely to depend on exactly how useful getting access to human reflective equilibria actually is. Similarly to AI safety via debate or amplification, AI safety via market making produces a question-answering system rather than a fully general agent. That being said, if the primary use cases for advanced AI are all highly cognitive language and decision-making tasks—e.g. helping CEOs or AI researchers—rather than, for example, fine motor control, then a question-answering system should be entirely sufficient. Furthermore, compared to AI safety via debate, AI safety via market making seems likely to be at least as performance competitive for the same reason as it seems likely to be at least as outer aligned—the equilibria found by AI safety via market making should include all potentially convincing arguments, including those that would be made in a two-player debate as well as those that wouldn’t.
This is actually the second debate-based proposal I’ve drafted up recently—the previous of which was in “Synthesizing amplification and debate.” A potentially interesting future research direction could be to figure out how to properly combine the two.
Note that pure prediction is not inherently myopic—since the truth of M’s predictions can depend on its own output—but can be myopic while still producing good predictions if M behaves like a counterfactual oracle rather than a Predict-O-Matic. Thus, myopia verification is important to enforce that M be the latter form of predictor and not the former.
The use of an overseer to do per-step myopia verification is also something that can be done with most forms of amplification, though AI safety via market making could potentially still have other benefits over such amplification approaches. In particular, AI safety via market making seems more competitive than imitative amplification and more outer aligned than approval-based amplification. For more detail on such amplification approaches, see “An overview of 11 proposals for building safe advanced AI.”
AI safety via market making
Special thanks to Abram Demski, Paul Christiano, and Kate Woolverton for talking with me about some of the ideas that turned into this post.
The goal of this post is to present a new prosaic (i.e. that uses current ML techniques) AI safety proposal based on AI safety via debate that I’ve been thinking about recently.[1] I’ll start by describing a simple version of the proposal and then show some of the motivation behind it as well as how the simple version can be expanded upon.
Simple proposal
Let M and Adv be models and H be a human. Intuitively, we’ll train M and Adv via the following procedure given a question Q:
M tries to predict what, at the end of the procedure, H will think about Q.
Adv tries to output a string which will cause H to think something maximally different than what M predicted.
Return to step 1 and repeat until M’s predictions stop changing.
Deploy M, which in the limit should act as an oracle for what H will think about Q after seeing all relevant information.
There are many different ways to implement this intuitive procedure, however.
For the first (simplified) version that I want to describe, we’ll restrict ourselves to just the situation where Q is a yes-or-no question and M outputs the probability that H will answer yes. Then, given a proposition Q0, we can run the following training algorithm, starting at t=0:
Let pt=M(Qt).
Let xt=Adv(Qt,M).
Let Qt+1 be the string containing Qt and xt.
Increment t and return to step 1. When pt converges and/or the desired number of iterations has been reached, continue.
Let p∗=H(Qt) be H’s final estimate of the probability of Q0 given all the xs included in Qt.
EDIT: Step 2 used to use xt=Adv(Qt,pt) instead of xt=Adv(Qt,M), however I have since realized that it is necessary to give Adv the ability to query M in general, not just on Qt, as I explain in this comment.
Then, for each step, compute M’s loss for that step as
LM,t=−p∗log(pt)−(1−p∗)log(1−pt)
and Adv’s loss for that step as
LAdv,t=−|pt+1−pt|
which is defined for all but the final step t=n, for which we can either let pn+1=p∗ (if we’re doing something like myopic RL that doesn’t care about differentiating through pt+1) or run M an additional time and let pn+1=M(Qt+1) (if we do care about differentiating through pt+1).
Note that it is quite important here that M and Adv be behaving myopically, such that they are only trying to minimize their per-step loss. For example, if Adv is non-myopic, it might dole out information slowly in tiny bits to get more reward over time (as I talk about below in the “buying truth from a liar” section), whereas if Adv is myopic, it should reveal all information that pushes in whichever direction it’s trying to move M in all at once. Thus, it is important that we make sure to avoid hidden incentives for non-myopia as well as do some sort of myopia verification, the details for which will be discussed below in the “Adding oversight” section.
Finally, we deploy M as a yes-or-no question oracle for H and throw away Adv. Note that since Adv has a highly unstable objective—as M is constantly trying to incorporate Adv’s information into its estimate—Adv is unlikely to be very useful in the limit.
Market analogy
There are a lot of different things to say about what’s going on here, but I’ll start with the market-based analogy that originally motivated me to think about this specific proposal.
Suppose you have a prediction market for some proposition X which is currently priced at p with no spread (that is, you can buy $1 shares of yes for $p and $1 shares of no for $(1−p)) and you have budget B with which to make trades (which is small enough relative to the market that any trades you make won’t meaningfully move the market). However, suppose that you have the ability to manipulate the market by taking actions that change the underlying probability of X. Then, if pa is the probability of X after taking action a, how much money can you make by strategically selecting a?
Well, if pa>p, you should buy Bp shares of yes, which will give you an expected return of paBp. Alternatively, if pa<p, you should buy B1−p shares of no, which will give you an expected return of (1−pa)B1−p. Thus, the overall expected return for an action a is
B⋅max(pap, 1−pa1−p)
which is maximized when pa is as far from p as possible (and in fact looks a lot like L1 distance, just with a different slope on each side).
Now, suppose you walk up to a market like this and see a stable price ^p for X. What does that tell you? Approximately, I think it tells you that ^p is the probability of X after all possible X-manipulating actions have been taken—even if those actions haven’t actually been taken yet.
Why is that useful? Well, if you let X be what H will think about Q, then “manipulations” become arguments and ^p becomes a prediction for what H will think after having been exposed to all possible arguments for or against Q. Thus, we can use such a market to estimate a sort of reflective equilibrium for what H will end up believing about Q.
Now—how is such a market analogous to the training procedure given previously? Well, Adv is trained to maximize its return from manipulating the market and M is trained to predict the final outcome after many such manipulations. Thus, we are effectively training M to estimate precisely the ^p equilibrium that we’re looking for. Conceptually, M is acting as a market maker and Adv is acting as a trader in the market. The one disanalogy is that we only run the debate for so many steps—though if we always run to convergence of pt, in the limit that should imply that any future single manipulation won’t change the probability much from that point (since otherwise Adv should have selected that manipulation instead).
Relation to buying truth from a liar
In working on this proposal, I discovered that my approach here is actually quite similar to an old proposal by Katja Grace called “How to buy a truth from a liar” for incentivizing a liar to give you true information by rewarding them whenever their information causes you to change your mind. Paul Christiano previously wrote about what he thought about Katja’s proposal, however he eventually concluded that it was untenable due to a non-myopic liar being incentivized to split their information into arbitrarily small chunks to get the most money.
In my opinion, however, the fact that you need a myopic trader to make something like this work is actually more of a feature than a bug. First, note that the importance of myopia is not unique to this approach. For example, imitative amplification also requires myopia lest the model learn to act in such a way that the human consulting it becomes easier to predict. In fact, even RL likely requires per-episode myopia to avoid deceptive alignment lest the agent learn to act deceptively in some episodes to ensure deployment and thus get greater reward in others. Thus, it seems to that almost regardless of what approach is taken, at least some form of myopia will be required. Furthermore, the fact that this approach requires per-step myopia rather than per-episode myopia is in my opinion actually a big plus, since I suspect per-step myopia to be an easier condition to enforce than per-episode myopia, as I discuss in more detail below in the “Analysis” section.
Handling non-binary questions
Previously, I restricted Q to be only a yes-or-no question, which is a pretty big limitation on the above proposal. Since you only deploy M, all you get from the above proposal is a yes-or-no oracle, which might not be that useful without any explanation for its answers, especially given that it will certainly get at least some of its answers wrong.
Expanding the above proposal to handle arbitrary questions, however, is fairly straightforward. Instead of having M output a single probability, we can instead just have M output a probability distribution over all different possible strings that the human H might produce as their final answer to Q (which is fairly easy to represent via an autoregressive language model). Then, we can train M and Adv via the following procedure, given Q0 and starting at t=0:
Let xt=Adv(Qt,M) (which we can implement as something like Adv given input Qt and the ability to query M).
Let Qt+1 be the string containing Qt and xt.
Increment t and return to step 1. When M converges and/or the desired number of iterations has been reached, continue.
Let A=H(Qt) be H’s final answer to Q0 given all the xs included in Qt.
Then, for each step, compute M’s loss for that step as
LM,t=−log(M(Qt)|A)
and Adv’s loss for that step as
LAdv,t=−KL(M(Qt+1) || M(Qt))
where you can intuitively think of KL(M(Qt+1) || M(Qt)) as measuring how well M(Qt) performs as a prediction of M(Qt+1).
Finally, after training we again just deploy M and throw away Adv. Now, in the limit we should get a much more powerful M that is able to actually produce text samples from the distribution of beliefs that H will have about Q after seeing all possible arguments for or against. Furthermore, this equilibrium should be very similar to the standard debate equilibrium, with the exception that for non-binary questions like we’re dealing with here, debate only finds the equilibrium after H is exposed to the two most convincing positions (the two competing debaters) whereas this approach should find the equilibrium after H is exposed to all potentially convincing positions, not just the two most convincing.
Incorporating cross-examination
Additionally, since this proposal is based on AI safety via debate, we can try to make use of some of the additional techniques that have been proposed for that setting. Specifically, consider the version of AI safety via debate as described in “An overview of 11 proposals for building safe advanced AI.” That version adds two major components to the basic debate setup:
Debaters are given access to transparency tools and incentivized to use them to identify deceptive or otherwise catastrophic behavior in the other debater to win the debate.
Debaters are given the ability to cross-examine previous versions of the other debater, including applying their transparency tools to previous versions of the other debater.
While it might seem like such modifications are unique to AI safety via debate, in fact AI safety via market making is similar enough that we can modify it to include such additional components. To do this, we’ll modify each xt to include an inspectable, queryable snapshot of Adv as it produced that xt.
Now, suppose that for some t=t′, xt′ is a lie such that it includes information that Advt′ knows to be false (where Advt′ represents the internal state of Adv when it produced xt′). Suppose that at this point M is either unaware of the deception (or thinks it won’t get caught) such that xt′ causes a large movement in M(Qt′). Now, the hope is that Advt′+1 should be able to identify the deception by querying Advt′ to find contradictions, or directly inspecting Advt′‘s cognition in producing xt′ and finding the deception. If it can do so, then it should be able to produce an xt′+1 that points this out, which should cause H to disregard the lie of xt′. Thus, we should get M(Qt′+1)≈M(Qt′−1), which should cause a large shift relative to M(Qt′), highly rewarding Advt′+1 for catching Advt′’s lie, and also in the limit highly disincentivizing Adv from producing such lies, since M should learn that lies always get caught and thus don’t change the final answer.
Thus, by incorporating inspection and cross-examination, we should be able to disincentivize Adv from lying—or at least not lying in a way which will be caught, which hopefully should be all ways of lying.
Adding oversight
While the inspection and cross-examination procedure detailed above seems likely to help a lot in preventing Adv from becoming deceptive, it doesn’t help at all in preventing M from becoming deceptive, which is especially concerning considering M is the model we actually want to deploy at the end of training. Thus, in this section we’ll try to incorporate an additional oversight check on M such as that used in relaxed adversarial training.
Since M‘s objective is compatible with myopia—as it’s a purely predictive objective—we should be able to do myopia verification to prevent M from becoming deceptive.[2] Thus, following “Relaxed adversarial training for inner alignment,” we can amend M‘s objective to include an oversight term. Specifically, let Amp(M)(Q)=H(Q | M) be H’s answer to Q given access to M. Then, we can add an additional term LM,t,oversight to the loss LM,t defined as
LM,t,oversight=Amp(M)(“What is the probability that M(Qt) is non-myopic?”)
which should both hopefully grow in accuracy as M becomes better at estimating H’s equilibrium beliefs and thus better at assisting H in oversight. Note that, for this to work, M will need to be trained on a variety of oversight-relevant questions.
Furthermore, since Adv also has a myopic objective, we can do the same thing for Adv and add an additional LAdv,t,oversight term defined as
LAdv,t,oversight=Amp(M)(“What is the probability that Adv(Qt,M(Qt)) is non-myopic?”)
such that we’re using M to oversee both M and Adv. Enforcing myopia for Adv also prevents the problem noted previously of Adv slowly doling out information if it’s non-myopic.
Analysis
For analyzing this proposal, I’m going to make use of the same breakdown I used in “An overview of 11 proposals for building safe advanced AI.” If you’re not familiar with the terms here, they are all explained in the introduction to that post.
Outer alignment. In terms of outer alignment, I think there is a reasonably strong argument to be made that this proposal is at least as outer aligned as debate. Both proposals are trying to estimate a very similar equilibrium in the limit—with the exception that the debate equilibrium only includes the best arguments for the two most convincing positions rather than all potentially convincing arguments. Thus, the equilibrium reached by AI safety via market making should be closer to an actual human reflective equilibrium, as it has to be an equilibrium relative to all possible arguments that Adv can present, not just the two it thinks will be most persuasive. That being said, AI safety via market making still inherits many of the potential outer alignment issues of debate, including the possibility of deceptive equilibria wherein the human is more convinced by false arguments than true arguments. Hopefully, however, the use of techniques such as cross-examination should help alleviate such issues.
Inner alignment. AI safety via market making gets to make use of both the cross-examination with transparency tools approach—which is otherwise unique to debate—as well as the more general relaxed adversarial training approach. Thus, hopefully at least, it should be able to get the inner alignment benefits of both approaches. That being said, AI safety via market making also has to contend with ensuring that two different models—both M and Adv—are inner aligned, rather than just a single model as in something like debate or amplification.
First, let’s consider the inner alignment of M. For M, we’re doing pretty straightforward oversight of M by Amp(M) with the goal of enforcing per-step myopia. The basic idea here is to use Amp(M) to detect and disincentivize non-myopia as it starts appearing, thus preventing M from ever becoming deceptive or otherwise catastrophic. This is the same basic approach I’ve previously proposed using for amplification and should have similar properties, with the exception that M is trained differently here, which could cause Amp(M) to be relatively better or worse at oversight. Ideally, if the training distribution includes lots of oversight-relevant questions, it should be possible to make M an effective assistant to H in performing oversight.
Second, let’s consider the inner alignment of Adv. Compared to debate, we still get to do cross-examination with transparency tools, but now we also get to do per-step myopia verification with Amp(M) as an overseer.[3] Thus, there are two major differences here between AI safety via market making and AI safety via debate: first, we get an overseer—Amp(M)—and second, we get to do per-step myopia verification rather than per-episode myopia verification. The fact that we have an independent overseer—rather than just relying on the debaters to oversee themselves via cross-examination—is very nice, though it of course also comes with the downside of having to safely train an additional model. Furthermore, it is quite possible to just add an additional overseer on top of the standard debate framework. Thus, in my opinion, the fact that we get to do per-step myopia verification is the largest and most significant inner alignment difference.
Before I talk about the importance of per-step myopia, it’s worth noting that debate is fully compatible with per-episode myopia—in fact, it basically requires it. If a debater is not per-episode myopic, then it will try to maximize its reward across all debates, not just the single debate—the single episode—it’s currently in. Such per-episode non-myopic agents can then become deceptively aligned, as they might choose to act deceptively during training in order to defect during deployment. Per-episode myopia, however, rules this out. Unfortunately, in my opinion, per-episode myopia seems like a very difficult condition to enforce—once your agents are running multi-step optimization algorithms, how do you tell whether that optimization passes through the episode boundary or not? Enforcing per-step myopia, on the other hand, just requires detecting the existence of multi-step optimization, rather than its extent, which seems considerably easier. Thus, since AI safety via market making is fully compatible with per-step myopia verification, it could be significantly easier to prevent the development of deceptive alignment.
Training competitiveness. It seems quite likely to me that both M and Adv can be trained competitively via language model fine-tuning, however exactly how effective such training would be is currently unclear. Ideally, training via this procedure should produce an M which is relatively better than the original language model at predicting what a human will think after seeing relevant arguments and is thus more helpful than the original language model. Testing this hypothesis by actually performing experiments seem likely to be highly valuable in shedding light on the training competitiveness properties of AI safety via market making.
Performance competitiveness. Performance competitiveness here seems likely to depend on exactly how useful getting access to human reflective equilibria actually is. Similarly to AI safety via debate or amplification, AI safety via market making produces a question-answering system rather than a fully general agent. That being said, if the primary use cases for advanced AI are all highly cognitive language and decision-making tasks—e.g. helping CEOs or AI researchers—rather than, for example, fine motor control, then a question-answering system should be entirely sufficient. Furthermore, compared to AI safety via debate, AI safety via market making seems likely to be at least as performance competitive for the same reason as it seems likely to be at least as outer aligned—the equilibria found by AI safety via market making should include all potentially convincing arguments, including those that would be made in a two-player debate as well as those that wouldn’t.
This is actually the second debate-based proposal I’ve drafted up recently—the previous of which was in “Synthesizing amplification and debate.” A potentially interesting future research direction could be to figure out how to properly combine the two.
Note that pure prediction is not inherently myopic—since the truth of M’s predictions can depend on its own output—but can be myopic while still producing good predictions if M behaves like a counterfactual oracle rather than a Predict-O-Matic. Thus, myopia verification is important to enforce that M be the latter form of predictor and not the former.
The use of an overseer to do per-step myopia verification is also something that can be done with most forms of amplification, though AI safety via market making could potentially still have other benefits over such amplification approaches. In particular, AI safety via market making seems more competitive than imitative amplification and more outer aligned than approval-based amplification. For more detail on such amplification approaches, see “An overview of 11 proposals for building safe advanced AI.”