Bounded Rationality, Abstraction, and Hierarchical Decision-Making: An Information-Theoretic Optimality Principle

被引:63
作者
Genewein, Tim [1 ,2 ,3 ]
Leibfried, Felix [1 ,2 ,3 ]
Grau-Moya, Jordi [1 ,2 ,3 ]
Braun, Daniel Alexander [1 ,2 ,3 ]
机构
[1] Max Planck Inst Intelligent Syst, Tubingen, Germany
[2] Max Planck Inst Biol Cybernet, Tubingen, Germany
[3] Grad Training Ctr Neurosci, Tubingen, Germany
来源
FRONTIERS IN ROBOTICS AND AI | 2015年
关键词
information theory; bounded rationality; computational rationality; rate-distortion; decision-making; hierarchical architecture; perception-action system; lossy compression;
D O I
10.3389/frobt.2015.00027
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Abstaction and hierarchical information processing are hallmarks of human and animal intelligence underlying the unrivaled flexibility of behavior in biological systems. Achieving such flexibility in artificial systems is challenging, even with more and more computational power. Here, we investigate the hypothesis that abstraction and hierarchical information processing might in fact be the consequence of limitations in information-processing power. In particular, we study an information-theoretic framework of bounded rational decision-making that trades off utility maximization against information-processing costs. We apply the basic principle of this framework to perception-action systems with multiple information-processing nodes and derive bounded-optimal solutions. We show how the formation of abstractions and decision-making hierarchies depends on information-processing costs. We illustrate the theoretical ideas with example simulations and conclude by formalizing a mathematically unifying optimization principle that could potentially be extended to more complex systems.
引用
收藏
页数:24
相关论文
共 50 条