Valid belief updates for prequentially additive loss functions arising in Semi-Modular Inference

01/24/2022
by   Geoff K. Nicholls, et al.
0

Model-based Bayesian evidence combination leads to models with multiple parameteric modules. In this setting the effects of model misspecification in one of the modules may in some cases be ameliorated by cutting the flow of information from the misspecified module. Semi-Modular Inference (SMI) is a framework allowing partial cuts which modulate but do not completely cut the flow of information between modules. We show that SMI is part of a family of inference procedures which implement partial cuts. It has been shown that additive losses determine an optimal, valid and order-coherent belief update. The losses which arise in Cut models and SMI are not additive. However, like the prequential score function, they have a kind of prequential additivity which we define. We show that prequential additivity is sufficient to determine the optimal valid and order-coherent belief update and that this belief update coincides with the belief update in each of our SMI schemes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2020

Semi-Modular Inference: enhanced learning in multi-modular models by tempering the influence of components

Bayesian statistical inference loses predictive optimality when generati...
research
01/26/2023

Guaranteed Accuracy of Semi-Modular Posteriors

Bayesian inference has widely acknowledged advantages in many problems, ...
research
04/01/2022

Scalable Semi-Modular Inference with Variational Meta-Posteriors

The Cut posterior and related Semi-Modular Inference are Generalised Bay...
research
03/06/2013

Additive Belief-Network Models

The inherent intractability of probabilistic inference has hindered the ...
research
07/27/2014

Modular Belief Updates and Confusion about Measures of Certainty in Artificial Intelligence Research

Over the last decade, there has been growing interest in the use or meas...
research
07/19/2019

Override and update

Override and update are natural constructions for combining partial func...
research
04/18/2018

Online Non-Additive Path Learning under Full and Partial Information

We consider the online path learning problem in a graph with non-additiv...

Please sign up or login with your details

Forgot password? Click here to reset