Qサーチ木:計算資源制約下のエージェントのための情報理論的階層抽象化手法
Q-Search Trees: An Information-Theoretic Approach Towards Hierarchical Abstractions for Agents with Computational Limitations
計算資源が限られたエージェント向けに、情報理論的信号圧縮と結びつけて木構造の抽象化を生成する最適化問題を定式化し、2つのアルゴリズムを提案した論文。
著者: Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras
分類: cs.RO, cs.AI, cs.IT, math.IT, stat.ML
原文アブストラクト
In this paper, we develop a framework to obtain graph abstractions for decision-making by an agent where the abstractions emerge as a function of the agent's limited computational resources. We discuss the connection of the proposed approach with information-theoretic signal compression, and formulate a novel optimization problem to obtain tree-based abstractions as a function of the agent's computational resources. The structural properties of the new problem are discussed in detail, and two algorithmic approaches are proposed to obtain solutions to this optimization problem. We discuss the quality of, and prove relationships between, solutions obtained by the two proposed algorithms. The framework is demonstrated to generate a hierarchy of abstractions for a non-trivial environment.
