Non-trivial informational closure of a Bayesian hyperparameter

10/05/2020
by   Martin Biehl, et al.
0

We investigate the non-trivial informational closure (NTIC) of a Bayesian hyperparameter inferring the underlying distribution of an identically and independently distributed finite random variable. For this we embed both the Bayesian hyper-parameter updating process and the random data process into a Markov chain. The original publication by Bertschinger et al. (2006) mentioned that NTIC may be able to capture an abstract notion of modeling that is agnostic to the specific internal structure of and existence of explicit representations within the modeling process. The Bayesian hyperparameter is of interest since it has a well defined interpretation as a model of the data process and at the same time its dynamics can be specified without reference to this interpretation. On the one hand we show explicitly that the NTIC of the hyperparameter increases indefinitely over time. On the other hand we attempt to establish a connection between a quantity that is a feature of the interpretation of the hyperparameter as a model, namely the information gain, and the one-step pointwise NTIC which is a quantity that does not depend on this interpretation. We find that in general we cannot use the one-step pointwise NTIC as an indicator for information gain. We hope this exploratory work can lead to further rigorous studies of the relation between NTIC and modeling.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2020

Quantity vs. Quality: On Hyperparameter Optimization for Deep Reinforcement Learning

Reinforcement learning algorithms can show strong variation in performan...
research
07/17/2023

Hyperparameter Tuning Cookbook: A guide for scikit-learn, PyTorch, river, and spotPython

This document provides a comprehensive guide to hyperparameter tuning us...
research
08/17/2022

Random Search Hyper-Parameter Tuning: Expected Improvement Estimation and the Corresponding Lower Bound

Hyperparameter tuning is a common technique for improving the performanc...
research
11/15/2019

A Generalized Markov Chain Model to Capture Dynamic Preferences and Choice Overload

Assortment optimization is an important problem that arises in many prac...
research
12/21/2017

A probabilistic interpretation of replicator-mutator dynamics

In this note, we investigate the relationship between probabilistic upda...
research
10/26/2022

History-Based, Bayesian, Closure for Stochastic Parameterization: Application to Lorenz '96

Physical parameterizations are used as representations of unresolved sub...
research
10/24/2020

Measuring the `I don't know' Problem through the Lens of Gricean Quantity

We consider the intrinsic evaluation of neural generative dialog models ...

Please sign up or login with your details

Forgot password? Click here to reset