Intelligent Agent Foundations Forumsign up / log in
The Ubiquitous Converse Lawvere Problem
post by Scott Garrabrant 341 days ago | Marcello Herreshoff, Sam Eisenstat, Jessica Taylor and Patrick LaVictoire like this | discuss

In this post, I give a stronger version of the open question presented here, and give a motivation for this stronger property. This came out of conversations with Marcello, Sam, and Tsvi.

Definition: A continuous function \(f:X\rightarrow Y\) is called ubiquitous if for every continuous function \(g:X\rightarrow Y\), there exists a point \(x\in X\) such that \(f(x)=g(x)\).

Open Problem: Does there exist a topological space \(X\) with a ubiquitous function \(f:X\rightarrow[0,1]^X\)?

I will refer to the original problem as the Converse Lawvere Problem, and the new version as the the Ubiquitous Converse Lawvere Problem. I will refer to a space satisfying the conditions of (Ubiquitous) Converse Lawvere Problem, a (Ubiquitous) Converse Lawvere Space, abbreviated (U)CLS. Note that a UCLS is also a CLS, since a ubiquitous is always surjective, since \(g\) can be any constant function.

Motivation: True FairBot

Let \(X\) be a Converse Lawvere Space. Note that since such an \(X\) might not exist, the following claims might be vacuous. Let \(f:X\rightarrow[0,1]^X\) be a continuous surjection.

We will view \(X\) as a space of possible agents in an open source prisoner’s dilemma game. Given two agents \(A,B\in X\), we will interpret \(f_{A}(B)\) as the probability with which A cooperates when playing against \(B\). We will define \(U_A(B):=2f_B(A)-f_A(B)\), and interpret this as the utility of agent \(A\) when playing in the prisoner’s dilemma with \(B\).

Since \(f\) is surjective, every continuous policy is implemented by some agent. In particular, this means gives:

Claim: For any agent \(A\in X\), there exists another agent \(A^\prime\in X\) such that \(f_{A^\prime}(B)=f_B(A)\). i.e. \(A^\prime\) responds to \(B\) the way that \(B\) responds to \(A\).

Proof: The function \(B\mapsto f_B(A)\) is a continuous function, since \(B\mapsto f_B\) is continuous, and evaluation is continuous. Thus, there is a policy \(B\mapsto f_B(A)\) in \([0,1]^X\). Since \(f\) is surjective, this policy must be the image under \(f\) of some agent \(A^\prime\), so \(f_{A^\prime}(B)=f_B(A)\).

Thus, for any fixed agent \(A\), we have some other agent \(A^\prime\) that responds to any \(B\) the way \(B\) responds to \(A\). However, it would be nice if \(A^\prime=A\), to create a FairBot that responds to any opponent the way that that opponent responds to it. Unfortunately, to construct such a FairBot, we need the extra assumption that \(f\) is ubiquitous.

Claim: If \(f\) is ubiquitous, then exists a true fair bot in \(X\): an agent \(FB\in X\), such that \(f_{FB}(A)=f_A(FB)\) for all agents \(A\in X\).

Proof: Given an agent \(B\in X\), there exists an policy \(g_B\in [0,1]^X\) such that \(g_B(A)=f_A(B)\) for all \(A\), since \(A\mapsto f_A(B)\) is continuous. Further, the function \(B\mapsto g_B\) is continuous, since the function \(A,B\mapsto f_A(B)\) and the definition of the exponential topology. Since \(f\) is ubiquitous, there must be some \(FB\in X\) such that \(f_{FB}=g_{FB}\). But then, for all \(A\), we have \(f_{FB}(A)=g_{FB}(A)=f_A(FB)\).

Note that we may not need the full power of ubiquitous here, but it is the simplest property I see that gets the result.

Note that this FairBot is fair in a stronger sense than the FairBot of modal combat, in that it always has the same output as its opponent. This may make you suspicious, since the you can also construct an UnfairBot, \(UB\) such that \(f_{UB}(A)=1-f_A(UB)\) for all \(A\). This would have caused a problem in the modal combat framework, since you can put a FairBot and an UnfairBot together to form a paradox. However, we do not have this problem, since we deal with probabilities, and simply have \(f_{UB}(FB)=f_{FB}(UB)=1/2\). Note that the exact phenomenon that allows this to possibly work is the fixed point property of the interval \([0,1]\) which is the only reason that we cannot use diagonalization to show that no CLS exists.

Finally, note that we already have a combat framework that has a true FairBot: the reflective oracle framework. In fact, the reflective oracle framework may have all the benefits we would hope to get out of a UCLS. (other than the benefit of simplicity of not having to deal with computability and hemicontinuity).





If you drop the
by Alex Appel on Distributed Cooperation | 0 likes

Cool! I'm happy to see this
by Abram Demski on Distributed Cooperation | 0 likes

Caveat: The version of EDT
by 258 on In memoryless Cartesian environments, every UDT po... | 2 likes

[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


Privacy & Terms