A computational-level explanation of the speed of goal inference
详细信息 查看全文
- 作者：Mark Blokpoel ; Johan Kwisthout ; Theo P. van der Weide ; Todd Wareham ; Iris van Rooij
- 关键词：Goal inference ; Abduction ; Inverse planning ; Computational complexity ; Intractability ; NP-hard ; Fixed-parameter tractability
- 刊名：Journal of Mathematical Psychology
- 出版年：2013
- 出版时间：June-August, 2013
- 年：2013
- 卷：57
- 期：3-4
- 页码：117-133
- 全文大小：913 K
文摘
The ability to understand the goals that drive another person¡¯s actions is an important social and cognitive skill. This is no trivial task, because any given action may in principle be explained by different possible goals (e.g., one may wave ones arm to hail a cab or to swat a mosquito). To select which goal best explains an observed action is a form of abduction. To explain how people perform such abductive inferences, proposed a computational-level theory that formalizes goal inference as Bayesian inverse planning (BIP). It is known that general Bayesian inference-be it exact or approximate-is computationally intractable (NP-hard). As the time required for computationally intractable computations grows excessively fast when scaled from toy domains to the real world, it seems that such models cannot explain how humans can perform Bayesian inferences quickly in real world situations. In this paper we investigate how the BIP model can nevertheless explain how people are able to make goal inferences quickly. The approach that we propose builds on taking situational constraints explicitly into account in the computational-level model. We present a methodology for identifying situational constraints that render the model tractable. We discuss the implications of our findings and reflect on how the methodology can be applied to alternative models of goal inference and Bayesian models in general.