Searcharxiv⌕ Search

arXiv subjects

Lilian Aline Weber

Publications and source records attributed to Lilian Aline Weber.

2 recordsLinked to original sources

Robust volatility updates for Hierarchical Gaussian Filtering

Hierarchical Gaussian Filtering (HGF) networks allow for efficient updating of posterior distributions (beliefs) about hidden states of an agent's environment. HGF parent nodes can target the mean or variance of their children. New information entering at input nodes leads to a cascade of belief updates across the network according to one-step update equations for each node's mean and precision (inverse variance). However, the original form of the update equations for variance-targeting parents(volatility coupling) can in some regions of parameter space lead to negative posterior precision, a logical impossibility which causes the updating algorithm to terminate with an error. In this report, we introduce a modified quadratic approximation to the variational energy of volatility-coupled nodes that avoids negative posterior precision. The key idea is to interpolate between two quadratic expansions of the variational energy: one at the prior prediction and one at a second mode whose location is obtained in closed form via the Lambert W function. The resulting update equations are robust across the entire parameter space and faithfully track the variational posterior even for large prediction errors.

cs.LG↗

The generalized Hierarchical Gaussian Filter

Hierarchical Bayesian models of perception and learning feature prominently in contemporary cognitive neuroscience where, for example, they inform computational concepts of mental disorders. This includes predictive coding and hierarchical Gaussian filtering (HGF), which differ in the nature of hierarchical representations. In this work, we present a new class of artificial neural networks that unifies computational principles of PC and HGFs. We extend the space of generative models underlying HGF to include a form of nonlinear hierarchical coupling between state values akin to predictive coding and artificial neural networks in general. We derive the update equations corresponding to this generalization of HGF and conceptualize them as connecting a network of (belief) nodes where parent nodes either predict the state of child nodes or their rate of change. This enables us to (1) create modular architectures with generic computational steps in each node of the network, and (2) disclose the hierarchical message passing implied by generalized HGF models and to compare this to comparable schemes under predictive coding. The practical advances of this work are twofold: on the one hand, our extension allows for a modular construction of ANNs of arbitrarily complex hierarchical structure under the general principles of HGF. On the other hand, by providing a highly flexible implementation of hierarchical Bayesian models available as open source software, it enables new types of empirical data analysis in computational psychiatry.

cs.NE↗