10 citations · 30 across the 6 of their papers we have counts for
6 papers
Limit-Computable Grains of Truth for Arbitrary Computable Extensive-Form (Un)Known Games
Cole Wyeth, Marcus Hutter, Jan Leike +1
A Bayesian player acting in an infinite multi-player game learns to predict the other players' strategies if his prior assigns positive probability to their play (or contains a gra…
A Formal Approach to the Problem of Logical Non-Omniscience
Scott Garrabrant, Tsvi Benson-Tilsen, Andrew Critch +2
We present the logical induction criterion for computable algorithms that assign probabilities to every logical statement in a given formal language, and refine those probabilities…
A Formal Solution to the Grain of Truth Problem
Jan Leike, Jessica Taylor, Benya Fallenstein
A Bayesian agent acting in a multi-agent environment learns to predict the other agents' policies if its prior assigns positive probability to them (in other words, its prior conta…
Logical Induction
Scott Garrabrant, Tsvi Benson-Tilsen, Andrew Critch +2
We present a computable algorithm that assigns probabilities to every logical statement in a given formal language, and refines those probabilities over time. For instance, if the…
Asymptotic Convergence in Online Learning with Unbounded Delays
Scott Garrabrant, Nate Soares, Jessica Taylor
We study the problem of predicting the results of computations that are too expensive to run, via the observation of the results of smaller computations. We model this as an online…
Reflective Oracles: A Foundation for Classical Game Theory
Benja Fallenstein, Jessica Taylor, Paul F. Christiano
Classical game theory treats players as special---a description of a game contains a full, explicit enumeration of all players---even though in the real world, "players" are no mor…