no code implementations • 16 Sep 2016 • Jan Leike, Jessica Taylor, Benya Fallenstein
In this paper we present a formal and general solution to the full grain of truth problem: we construct a class of policies that contains all computable policies as well as Bayes-optimal policies for every lower semicomputable prior over the class.
no code implementations • 18 Apr 2016 • Scott Garrabrant, Benya Fallenstein, Abram Demski, Nate Soares
While probability theory is normally applied to external environments, there has been some recent interest in probabilistic modeling of the outputs of computations that are too expensive to run.