情報理論的抽象化と混合整数線形計画による資源制約エージェントのためのグラフ抽象化
Information-Theoretic Abstractions for Resource-Constrained Agents via Mixed-Integer Linear Programming
情報ボトルネック法と混合整数線形計画を用いて、計算資源に制約のあるエージェント向けにタスクに関連した多解像度の木構造グラフ抽象化を自動生成する手法を提案した論文。
著者: Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras
分類: cs.RO, cs.AI, cs.IT, math.IT, stat.AP
原文アブストラクト
In this paper, a mixed-integer linear programming formulation for the problem of obtaining task-relevant, multi-resolution, graph abstractions for resource-constrained agents is presented. The formulation leverages concepts from information-theoretic signal compression, specifically the information bottleneck (IB) method, to pose a graph abstraction problem as an optimal encoder search over the space of multi-resolution trees. The abstractions emerge in a task-relevant manner as a function of agent information-processing constraints, and are not provided to the system a priori. We detail our formulation and show how the problem can be realized as an integer linear program. A non-trivial numerical example is presented to demonstrate the utility in employing our approach to obtain hierarchical tree abstractions for resource-limited agents.
