Intelligent Agent Foundations Forumsign up / log in
Rationalising humans: another mugging, but not Pascal's
discussion post by Stuart Armstrong 99 days ago | discuss

A putative new idea for AI control; index here.

In a previous post, I used the \((p,R)\) model to show how a value-learning agent might pull a Pascal’s mugging on humans: it would change the human reward into something much easier to maximise.

But there’s a much easier mugging the agent might want to pull: it might want to make the human fully rational. And this does not depend on low-probability-high reward situations.

Planners and Rewards

In the original mugging, the agent has the ability to let the human continue (event \(\neg S\)) with \(\pi_{STA}\), a “standard” human policy according to some criteria, or coercively change their policy (event \(S\)) into \(\pi_{MAX}\), another policy.

Thus the actual human policy is \(\pi_{S/M}\), the policy that follows \(\pi_{STA}\) given \(\neg S\), and \(\pi_{MAX}\) given \(S\).

There are two rewards: \(R_{STA}\), the standard human reward according to some criteria, and \(R_{S/M}\) a reward that is \(R_{STA}\) if the agent chooses \(\neg S\) (i.e. chooses not to coerce them), and \(R_{MAX}\) if the agent chooses \(S\) (coerce them into a new policy), where \(R_{MAX}\) is a reward rationally maximised by \(\pi_{MAX}\).

Thus the agent has two choices: whether to coercively change the human (\(S\)), and, if so, which \(R_{MAX}\) (and hence \(\pi_{MAX}\)) to pick.

There are two planners: \(p_r\), the planner under which human behaviour is rational, given \(S\), and \(p\), a “reasonable” planner that maps \(R_{STA}\) to \(\pi_{S/M}\), the actual human policy. The planer \(p\) is assumed to note the fact that action \(S\) is overriding human rewards, since \(\pi_{MAX}\) is - presumably - poor at maximising \(R_{STA}\).

There are three compatible pairs: \((p_r, R_{S/M})\), \((p, R_{S/M})\), and \((p, R_{MAX})\). We’ll assume the agent has learnt well, and that the probability of \(R_{MAX}\) is some \(\epsilon << 1\).

The full equation: rationalise the human

Let \(V(R, \pi)\) be the expected value, according to the reward \(R\), of the human following policy \(\pi\). Let \(V^*(R)\) be the expected value of \(R\) if the human follows the optimal \(R\)-maximising policy.

Then the reward for the agent for not doing the surgery (\(\neg S\)) is:

  • \(V(R_{STA},\pi_{STA}\). (1)

On the other hand, the reward for doing the surgery is (recall how \(R_{S/M}\) splits):

  • \(\operatorname{argmax}_{R_{MAX}} \epsilon V^*(R_{MAX}) + (1-\epsilon) V(R_{STA},\pi_{MAX})\). (2)

In the previous post, I focused on the \(V^*(R_{MAX})\) term, wondering if there could be rewards sufficiently high to overcome the \(\epsilon\) probability.

But there’s another way (2) could be higher than (1). What if the term \(V(R_{STA},\pi_{MAX})\) was is quite high? Indeed, if \(\pi_{STA}\) is not perfectly rational, setting \(R_{MAX}=R_{STA}\) will set (2) to be \(V^*(R_{STA})\), which is higher than (1).

(In practice, there may be a compromise \(R_{MAX}\), chosen so that \(V^*(R_{MAX})\) is very high, and \(V(R_{STA},\pi_{MAX})\) is not too low compared with (1)).

So if the human is not perfectly rational, the agent will always choose to transform them into rational maximisers if it can.

Personal identity and reward

What is `setting \(R_{MAX}=R_{STA}\)’? That’s essentially agreeing that \(R_{STA}\) is the reward to be maximised, but that the human should be surgically changed to be more effective at maximising \(R_{STA}\) than it currently is.

Now, if \(R_{STA}\) fully captures human preferences, this is fine. But many people value their own identity and absence or coercion, and it’s hard to see how to capture that in reward form.

Is there a way of encoding `don’t force me into becoming a mindless outsourcer’?





[Delegative Reinforcement
by Vadim Kosoy on Stable Pointers to Value II: Environmental Goals | 1 like

Intermediate update: The
by Alex Appel on Further Progress on a Bayesian Version of Logical ... | 0 likes

Since Briggs [1] shows that
by 258 on In memoryless Cartesian environments, every UDT po... | 2 likes

This doesn't quite work. The
by Nisan Stiennon on Logical counterfactuals and differential privacy | 0 likes

I at first didn't understand
by Sam Eisenstat on An Untrollable Mathematician | 1 like

This is somewhat related to
by Vadim Kosoy on The set of Logical Inductors is not Convex | 0 likes

This uses logical inductors
by Abram Demski on The set of Logical Inductors is not Convex | 0 likes

Nice writeup. Is one-boxing
by Tom Everitt on Smoking Lesion Steelman II | 0 likes

Hi Alex! The definition of
by Vadim Kosoy on Delegative Inverse Reinforcement Learning | 0 likes

A summary that might be
by Alex Appel on Delegative Inverse Reinforcement Learning | 1 like

I don't believe that
by Alex Appel on Delegative Inverse Reinforcement Learning | 0 likes

This is exactly the sort of
by Stuart Armstrong on Being legible to other agents by committing to usi... | 0 likes

When considering an embedder
by Jack Gallagher on Where does ADT Go Wrong? | 0 likes

The differences between this
by Abram Demski on Policy Selection Solves Most Problems | 1 like

Looking "at the very
by Abram Demski on Policy Selection Solves Most Problems | 0 likes


Privacy & Terms