.png){kind=icon}
.png){kind=icon}
Return
On efficient computation in active inference
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2024.124315.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Biological agents demonstrate a remarkable proficiency in calibrating appropriate scales of planning and evaluation when interacting with their environments. It follows logically that any decision -making algorithm aspiring to neurobiological plausibility must mirror these attributes, particularly regarding computational expenditure and the intricacy of evaluative processes. However, active inference encounters notable challenges in simulating apt behaviours within complex environments. These stem chiefly from its substantial computational demands and the intricate task of defining the agent's behaviour preference. We address these through a two -fold approach. First, we introduce a planning algorithm by using the Bellman-optimality principle to minimise the planning cost function (i.e., expected free energy). Briefly, we recursively compute the expected free energy of actions in reverse temporal sequence to significantly reduce the computational complexity. Secondly, inspired by the Z -learning algorithm, we propose a novel method to learn time -constrained agent preferences. We face -validate the efficacy of these through grid -world simulations and demonstrate precise model learning and planning, even under uncertainty. These algorithmic advances create new opportunities for various applications-in neuroscience and machine learning.
Keywords:
Free energy principle
Active inference
Dynamic programming
Stochastic control
Reinforcement learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W
View more organizations