Methods for Recovering Conditional Independence Graphs: A Survey
arXiv:2211.06829 · doi:10.1613/jair.1.14676
Abstract
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.
References in corpus (18)
- Scikit-learn: Machine Learning in Python
- SMOTE: Synthetic Minority Over-sampling Technique
- Deep Convolutional Networks on Graph-Structured Data
- High-dimensional regression with noisy and missing data: Provable guarantees with nonconvexity
- Stochastic Video Generation with a Learned Prior
- Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds
- DAG-GNN: DAG Structure Learning with Graph Neural Networks
- Missing values: sparse inverse covariance estimation and an extension to sparse regression
- Learning to Optimize: A Primer and A Benchmark
- D-VAE: A Variational Autoencoder for Directed Acyclic Graphs
- Iterative Thresholding Algorithm for Sparse Inverse Covariance Estimation
- The Case for Bayesian Deep Learning
- Learning to Discover Sparse Graphical Models
- A Fast and Scalable Joint Estimator for Learning Multiple Related Sparse Gaussian Graphical Models
- uGLAD: Sparse graph recovery by optimizing deep unrolled networks
- Missing Values and Imputation in Healthcare Data: Can Interpretable Machine Learning Help?
- Are uGLAD? Time will tell!
- Knowledge Propagation over Conditional Independence Graphs