Uncertainty quantification for Markov Random Fields

08/31/2020
by   Panagiota Birmpa, et al.
0

We present an information-based uncertainty quantification method for general Markov Random Fields. Markov Random Fields (MRF) are structured, probabilistic graphical models over undirected graphs, and provide a fundamental unifying modeling tool for statistical mechanics, probabilistic machine learning, and artificial intelligence. Typically MRFs are complex and high-dimensional with nodes and edges (connections) built in a modular fashion from simpler, low-dimensional probabilistic models and their local connections; in turn, this modularity allows to incorporate available data to MRFs and efficiently simulate them by leveraging their graph-theoretic structure. Learning graphical models from data and/or constructing them from physical modeling and constraints necessarily involves uncertainties inherited from data, modeling choices, or numerical approximations. These uncertainties in the MRF can be manifested either in the graph structure or the probability distribution functions, and necessarily will propagate in predictions for quantities of interest. Here we quantify such uncertainties using tight, information based bounds on the predictions of quantities of interest; these bounds take advantage of the graphical structure of MRFs and are capable of handling the inherent high-dimensionality of such graphical models. We demonstrate our methods in MRFs for medical diagnostics and statistical mechanics models. In the latter, we develop uncertainty quantification bounds for finite size effects and phase diagrams, which constitute two of the typical predictions goals of statistical mechanics modeling.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2021

Model Uncertainty and Correctability for Directed Graphical Models

Probabilistic graphical models are a fundamental tool in probabilistic m...
research
04/25/2012

Learning Loosely Connected Markov Random Fields

We consider the structure learning problem for graphical models that we ...
research
02/02/2021

Gaussian Experts Selection using Graphical Models

Local approximations are popular methods to scale Gaussian processes (GP...
research
05/17/2015

Hinge-Loss Markov Random Fields and Probabilistic Soft Logic

A fundamental challenge in developing high-impact machine learning techn...
research
05/21/2019

Lagrangian uncertainty quantification and information inequalities for stochastic flows

We develop a systematic information-theoretic framework for quantificati...
research
09/19/2009

Extension of Path Probability Method to Approximate Inference over Time

There has been a tremendous growth in publicly available digital video f...
research
09/30/2019

A Quotient Space Formulation for Statistical Analysis of Graphical Data

Complex analyses involving multiple, dependent random quantities often l...

Please sign up or login with your details

Forgot password? Click here to reset