Self-Optimizing and Pareto-Optimal Policies in General Environments Based on Bayes-Mixtures-Reference-Cited by-同舟云学术

Self-Optimizing and Pareto-Optimal Policies in General Environments Based on Bayes-Mixtures

Published:2002 Issue: Volume: Page:364-379
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hutter Marcus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45435-7_25

Reference14 articles.

1. R. Bellman. Dynamic Programming. Princeton University Press, New Jersey, 1957.

2. D. P. Bertsekas. Dynamic Programming and Optimal Control, Vol. (I) and (II). Athena Scientific, Belmont, Massachusetts, 1995. Volumes 1 and 2.

3. R. I. Brafman and M. Tennenholtz. A near-optimal polynomial time algorithm for learning in certain classes of stochastic games. Artificial Intelligence, 121(1–2):31–47, 2000.

4. J. L. Doob. Stochastic Processes. John Wiley & Sons, New York, 1953.

5. M. Hutter. A theory of universal artificial intelligence based on algorithmic complexity. Technical Report cs.AI/0004001, 62 pages, 2000. http://arxiv.org/abs/cs.AI/0004001 .

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Safe Policies for Reinforcement Learning via Primal-Dual Methods;IEEE Transactions on Automatic Control;2023-03

2. Ideas for a Reinforcement Learning Algorithm that Learns Programs;Artificial General Intelligence;2016

3. Bayesian Reinforcement Learning with Exploration;Lecture Notes in Computer Science;2014

4. Asymptotically Optimal Agents;Lecture Notes in Computer Science;2011

5. Optimality Issues of Universal Greedy Agents with Static Priors;Lecture Notes in Computer Science;2010