Methods for Recovering Conditional Independence Graphs: A Survey

11/13/2022
by   Harsh Shrivastava, et al.
0

Conditional Independence (CI) graphs are a type of probabilistic graphical models that are primarily used to gain insights about feature relationships. Each edge represents the partial correlation between the connected features which gives information about their direct dependence. In this survey, we list out different methods and study the advances in techniques developed to recover CI graphs. We cover traditional optimization methods as well as recently developed deep learning architectures along with their recommended implementations. To facilitate wider adoption, we include preliminaries that consolidate associated operations, for example techniques to obtain covariance matrix for mixed datatypes.

READ FULL TEXT
research
08/10/2023

Knowledge Propagation over Conditional Independence Graphs

Conditional Independence (CI) graph is a special type of a Probabilistic...
research
10/02/2022

Neural Graphical Models

Graphs are ubiquitous and are often used to understand the dynamics of a...
research
04/28/2020

Dependence in elliptical partial correlation graphs

The Gaussian model is equipped with strong properties that facilitate st...
research
02/06/2013

Algorithms for Learning Decomposable Models and Chordal Graphs

Decomposable dependency models and their graphical counterparts, i.e., c...
research
06/30/2021

The geometry of Gaussian double Markovian distributions

Gaussian double Markovian models consist of covariance matrices constrai...
research
09/29/2022

Variance Covariance Regularization Enforces Pairwise Independence in Self-Supervised Representations

Self-Supervised Learning (SSL) methods such as VICReg, Barlow Twins or W...
research
10/22/2020

Conditional independence by typing

A central goal of probabilistic programming languages (PPLs) is to separ...

Please sign up or login with your details

Forgot password? Click here to reset