Champion, Théophile and Grzes, Marek and Bowman, Howard (2022) Multi-Modal and Multi-Factor Branching Time Active Inference. [Preprint] (doi:10.48550/arXiv.2206.12503) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:98786)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: https://doi.org/10.48550/arXiv.2206.12503 |
Resource title: | A survey for variable young stars with small telescopes – VIII. Properties of 1687 Gaia selected members in 21 nearby clusters |
---|---|
Resource type: | Publication |
DOI: | 10.1162/neco_a_01703 |
KDR/KAR URL: | https://kar.kent.ac.uk/107152/ |
External URL: | https://doi.org/10.1162/neco_a_01703 |
Abstract
Active inference is a state-of-the-art framework for modelling the brain that explains a wide range of mechanisms such as habit formation, dopaminergic discharge and curiosity. Recently, two versions of branching time active inference (BTAI) based on Monte-Carlo tree search 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 w.r.t the number of observed and latent variables being modelled. In the present paper, we resolve this limitation by first allowing the modelling of several observations, each of them having its own likelihood mapping. Similarly, we allow each latent state to have its own transition mapping. The inference algorithm then exploits the factorisation of the likelihood and transition mappings to accelerate the computation of the posterior. Those two optimisations were tested on the dSprites environment in which the metadata of the dSprites dataset was used as input to the model instead of the dSprites images. On this task, BTAIVMP (Champion et al., 2022b,a) was able to solve 96.9\% of the task in 5.1 seconds, and BTAIBF (Champion et al., 2021a) was able to solve 98.6\% of the task in 17.5 seconds. Our new approach (BTAI3MF) outperformed both of its predecessors by solving the task completly (100\%) in only 2.559 seconds. Finally, BTAI3MF has been implemented in a flexible and easy to use (python) package, and we developed a graphical user interface to enable the inspection of the model's beliefs, planning process and behaviour.
Item Type: | Preprint |
---|---|
DOI/Identification number: | 10.48550/arXiv.2206.12503 |
Refereed: | No |
Other identifier: | https://arxiv.org/abs/2206.12503 |
Name of pre-print platform: | arXiv |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Funders: | University of Kent (https://ror.org/00xkeyj56) |
Depositing User: | Marek Grzes |
Date Deposited: | 06 Dec 2022 11:02 UTC |
Last Modified: | 05 Nov 2024 13:04 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/98786 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):