Champion, Théophile, Grzes, Marek, Bowman, Howard (2024) Multimodal and Multifactor Branching Time Active Inference. Neural Computation, . pp. 1-26. ISSN 1530-888X. (doi:10.1162/neco_a_01703) (KAR id:107152)
PDF
Author's Accepted Manuscript
Language: English |
|
Download this file (PDF/509kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: https://doi.org/10.1162/neco_a_01703 |
Resource title: | Multi-Modal and Multi-Factor Branching Time Active Inference |
---|---|
Resource type: | Pre-print |
DOI: | 10.48550/arXiv.2206.12503 |
KDR/KAR URL: | https://kar.kent.ac.uk/98786/ |
External URL: | https://doi.org/10.48550/arXiv.2206.12503 |
Abstract
Active inference is a state-of-the-art framework for modeling the brain that explains a wide range of mechanisms. Recently, two versions of branching time active inference (BTAI) have been developed to handle the exponential (space and time) complexity class that occurs when computing the prior over all possible policies up to the time horizon. However, those two versions of BTAI still suffer from an exponential complexity class with regard to the number of observed and latent variables being modeled. We resolve this limitation by allowing each observation to have its own likelihood mapping and each latent variable to have its own transition mapping. The implicit mean field approximation was tested in terms of its efficiency and computational cost using a dSprites environment in which the metadata of the dSprites data set was used as input to the model. In this setting, earlier implementations of branching time active inference (namely, BTAIVMP and BTAIBF) underperformed in relation to the mean field approximation (BTAI3MF) in terms of performance and computational efficiency. Specifically, BTAIVMP was able to solve 96.9% of the task in 5.1 seconds, and BTAIBF was able to solve 98.6% of the task in 17.5 seconds. Our new approach outperformed both of its predecessors by solving the task completely (100%) in only 2.559 seconds.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1162/neco_a_01703 |
Subjects: | Q Science > QA Mathematics (inc Computing science) |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Funders: | University of Kent (https://ror.org/00xkeyj56) |
SWORD Depositor: | JISC Publications Router |
Depositing User: | JISC Publications Router |
Date Deposited: | 04 Oct 2024 10:06 UTC |
Last Modified: | 05 Nov 2024 13:12 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/107152 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):