REVIEW 2 cited by
From pixels to planning: scale-free active inference
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper describes a discrete state-space model -- and accompanying methods -- for generative modelling. This model generalises partially observed Markov decision processes to include paths as latent variables, rendering it suitable for active inference and learning in a dynamic setting. Specifically, we consider deep or hierarchical forms using the renormalisation group. The ensuing renormalising generative models (RGM) can be regarded as discrete homologues of deep convolutional neural networks or continuous state-space models in generalised coordinates of motion. By construction, these scale-invariant models can be used to learn compositionality over space and time, furnishing models of paths or orbits; i.e., events of increasing temporal depth and itinerancy. This technical note illustrates the automatic discovery, learning and deployment of RGMs using a series of applications. We start with image classification and then consider the compression and generation of movies and music. Finally, we apply the same variational principles to the learning of Atari-like games.
Forward citations
Cited by 2 Pith papers
-
AXIOM: Learning to Play Games in Minutes with Expanding Object-Centric Models
AXIOM, a gradient-free active inference agent with growing and pruning object-centric mixture models, achieves better or similar reward than BBF and DreamerV3 after 10,000 interactions on the custom Gameworld 10k suite.
-
Intrinsic motivation as constrained entropy maximization
Three formal accounts of intrinsic motivation, active inference, empowerment, and maximum occupancy, are reframed as constrained entropy maximization, with maximum occupancy shown to lean on a hidden survival constraint.
Discussion (0). Continue with ORCID to comment.