Scaling active inference
Alexander Tschantz, Manuel Baltieri, Anil. K. Seth, Christopher L., Buckley

TL;DR
This paper demonstrates a scalable implementation of active inference in high-dimensional reinforcement learning tasks, showing significant improvements in exploration efficiency over traditional model-free methods.
Contribution
It introduces a practical, high-dimensional active inference framework, bridging the gap between theoretical models and real-world RL applications.
Findings
Achieved an order of magnitude increase in sample efficiency.
Demonstrated effective exploration in complex environments.
Showed operational similarities between active inference and model-based RL.
Abstract
In reinforcement learning (RL), agents often operate in partially observed and uncertain environments. Model-based RL suggests that this is best achieved by learning and exploiting a probabilistic model of the world. 'Active inference' is an emerging normative framework in cognitive and computational neuroscience that offers a unifying account of how biological agents achieve this. On this framework, inference, learning and action emerge from a single imperative to maximize the Bayesian evidence for a niched model of the world. However, implementations of this process have thus far been restricted to low-dimensional and idealized situations. Here, we present a working implementation of active inference that applies to high-dimensional tasks, with proof-of-principle results demonstrating efficient exploration and an order of magnitude increase in sample efficiency over strong model-free…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
