Intelligent Agent Foundations Forumsign up / log in
Change utility, reduce extortion
post by Stuart Armstrong 571 days ago | 3 comments

A putative new idea for AI control; index here.

EDIT: This method is not intended to solve extortion, just to remove the likelihood of extremely terrible outcomes (and slightly reduce the vulnerability to extortion).

A full solution to the extortion problem is sorely elusive. However, there are crude hacks that we can use to mitigate the downside.

Suppose we figured out that a friendly AI should be maximising an unbounded utility function \(U\). The extortion risk is that another AI could threaten a FAI with unbounded disutility if it didn’t go along with its plans. This gives the extorting AI – the EAI – a lot of leverage, and things could end up badly if the EAI ends up acting on its threat.

To combat this, we first have to figure out a level \(z\) of utility that is a lower bound on what \(U\) could ever reach naturally and realistically.

By “naturally” we mean that \(U\) going below \(z\) would require not just incompetence or indifference, but some AI actively and deliberately arranging the lowering of \(U\). And “realistically” just means that we’re confident that getting \(U\) lower than \(z\) by chance, or having a \(U\)-minimising AI, are exceedingly low.

Then what we can do is to cut off \(U\) at the \(z\) level, replacing \(U\) with \(U'=\max(U,U(z))\). See \(z\) indicated by the red line on this graph of \(U'\) versus \(U\):

What’s the consequence of this? First of all, it ensures that no EAI would threaten to reduce \(U\) (the utility we really care about) below \(z\), because that is not a threat to the FAI. This reduces the leverage of the EAI, and reduces the impact of it acting on its threat.

Since levels of \(U\) below \(z\) are exceedingly unlikely to happen by chance, the fact the FAI has the wrong utility below \(z\) shouldn’t affect it’s performance much. And, even in that zone, the AI is still motivated to climb \(U\) above \(z\).

But we may still feel unhappy about the flatness of that curve, and want it to still prefer higher \(U\) to exceedingly low values. If so, we can replace \(U\) with \(U''\) as follows (the blue line is at \(z-1\)):

In this case, the EAI will not seek to reduce \(U\) below \(z-1\) (in fact, it will specifically target that value), while the FAI has the correct ordering of lower values of \(U\). The utility is weird around \(z\), granted, but this is a place where the FAI would not want to be and would almost certainly not reach by accident.

Though this method does not eliminate the threat of extortion, it does seem to reduce its impact.





NEW LINKS

NEW POSTS

NEW DISCUSSION POSTS

RECENT COMMENTS

[Note: This comment is three
by Ryan Carey on A brief note on factoring out certain variables | 0 likes

There should be a chat icon
by Alex Mennen on Meta: IAFF vs LessWrong | 0 likes

Apparently "You must be
by Jessica Taylor on Meta: IAFF vs LessWrong | 1 like

There is a replacement for
by Alex Mennen on Meta: IAFF vs LessWrong | 1 like

Regarding the physical
by Vadim Kosoy on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

I think that we should expect
by Vadim Kosoy on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

I think I understand your
by Jessica Taylor on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

This seems like a hack. The
by Jessica Taylor on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

After thinking some more,
by Vadim Kosoy on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

Yes, I think that we're
by Vadim Kosoy on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

My intuition is that it must
by Vadim Kosoy on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

To first approximation, a
by Vadim Kosoy on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

Actually, I *am* including
by Vadim Kosoy on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

Yeah, when I went back and
by Alex Appel on Optimal and Causal Counterfactual Worlds | 0 likes

> Well, we could give up on
by Jessica Taylor on The Learning-Theoretic AI Alignment Research Agend... | 0 likes

RSS

Privacy & Terms