Universal knowledge-seeking agents for stochastic environments

26Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We define an optimal Bayesian knowledge-seeking agent, KL-KSA, designed for countable hypothesis classes of stochastic environments and whose goal is to gather as much information about the unknown world as possible. Although this agent works for arbitrary countable classes and priors, we focus on the especially interesting case where all stochastic computable environments are considered and the prior is based on Solomonoff's universal prior. Among other properties, we show that KL-KSA learns the true environment in the sense that it learns to predict the consequences of actions it does not take. We show that it does not consider noise to be information and avoids taking actions leading to inescapable traps. We also present a variety of toy experiments demonstrating that KL-KSA behaves according to expectation. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Orseau, L., Lattimore, T., & Hutter, M. (2013). Universal knowledge-seeking agents for stochastic environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8139 LNAI, pp. 158–172). https://doi.org/10.1007/978-3-642-40935-6_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free