Learning Gaussian Graphical Models with Latent Confounders
- URL: http://arxiv.org/abs/2105.06600v2
- Date: Mon, 24 Jul 2023 02:00:43 GMT
- Title: Learning Gaussian Graphical Models with Latent Confounders
- Authors: Ke Wang, Alexander Franks, Sang-Yun Oh
- Abstract summary: We compare and contrast two strategies for inference in graphical models with latent confounders.
While these two approaches have similar goals, they are motivated by different assumptions about confounding.
We propose a new method, which combines the strengths of these two approaches.
- Score: 74.72998362041088
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Gaussian Graphical models (GGM) are widely used to estimate the network
structures in many applications ranging from biology to finance. In practice,
data is often corrupted by latent confounders which biases inference of the
underlying true graphical structure. In this paper, we compare and contrast two
strategies for inference in graphical models with latent confounders: Gaussian
graphical models with latent variables (LVGGM) and PCA-based removal of
confounding (PCA+GGM). While these two approaches have similar goals, they are
motivated by different assumptions about confounding. In this paper, we explore
the connection between these two approaches and propose a new method, which
combines the strengths of these two approaches. We prove the consistency and
convergence rate for the PCA-based method and use these results to provide
guidance about when to use each method. We demonstrate the effectiveness of our
methodology using both simulations and in two real-world applications.
Related papers
- An unified approach to link prediction in collaboration networks [0.0]
This article investigates and compares three approaches to link prediction in colaboration networks.
The ERGM is employed to capture general structural patterns within the network.
The GCN and Word2Vec+MLP models leverage deep learning techniques to learn adaptive structural representations of nodes and their relationships.
arXiv Detail & Related papers (2024-11-01T22:40:39Z) - Sample Complexity Characterization for Linear Contextual MDPs [67.79455646673762]
Contextual decision processes (CMDPs) describe a class of reinforcement learning problems in which the transition kernels and reward functions can change over time with different MDPs indexed by a context variable.
CMDPs serve as an important framework to model many real-world applications with time-varying environments.
We study CMDPs under two linear function approximation models: Model I with context-varying representations and common linear weights for all contexts; and Model II with common representations for all contexts and context-varying linear weights.
arXiv Detail & Related papers (2024-02-05T03:25:04Z) - The Virtues of Laziness in Model-based RL: A Unified Objective and
Algorithms [37.025378882978714]
We propose a novel approach to addressing two fundamental challenges in Model-based Reinforcement Learning (MBRL)
Our "lazy" method leverages a novel unified objective, Performance Difference via Advantage in Model, to capture the performance difference between the learned policy and expert policy.
We present two no-regret algorithms to optimize the proposed objective, and demonstrate their statistical and computational gains.
arXiv Detail & Related papers (2023-03-01T17:42:26Z) - Bridging Mean-Field Games and Normalizing Flows with Trajectory
Regularization [11.517089115158225]
Mean-field games (MFGs) are a modeling framework for systems with a large number of interacting agents.
Normalizing flows (NFs) are a family of deep generative models that compute data likelihoods by using an invertible mapping.
In this work, we unravel the connections between MFGs and NFs by contextualizing the training of an NF as solving the MFG.
arXiv Detail & Related papers (2022-06-30T02:44:39Z) - Federated Learning Aggregation: New Robust Algorithms with Guarantees [63.96013144017572]
Federated learning has been recently proposed for distributed model training at the edge.
This paper presents a complete general mathematical convergence analysis to evaluate aggregation strategies in a federated learning framework.
We derive novel aggregation algorithms which are able to modify their model architecture by differentiating client contributions according to the value of their losses.
arXiv Detail & Related papers (2022-05-22T16:37:53Z) - LDDMM meets GANs: Generative Adversarial Networks for diffeomorphic
registration [1.2599533416395767]
We propose an adversarial learning method for pairs of 3D mono-modal images based on Generative Adrial Networks.
We have successfully implemented two models with the stationary and the EPDiff-constrained non-stationary parameterizations of diffeomorphisms.
Our method has shown similar results to model-based methods with a computational time under one second.
arXiv Detail & Related papers (2021-11-24T15:26:16Z) - Towards Domain-Agnostic Contrastive Learning [103.40783553846751]
We propose a novel domain-agnostic approach to contrastive learning, named DACL.
Key to our approach is the use of Mixup noise to create similar and dissimilar examples by mixing data samples differently either at the input or hidden-state levels.
Our results show that DACL not only outperforms other domain-agnostic noising methods, such as Gaussian-noise, but also combines well with domain-specific methods, such as SimCLR.
arXiv Detail & Related papers (2020-11-09T13:41:56Z) - MetaDistiller: Network Self-Boosting via Meta-Learned Top-Down
Distillation [153.56211546576978]
In this work, we propose that better soft targets with higher compatibil-ity can be generated by using a label generator.
We can employ the meta-learning technique to optimize this label generator.
The experiments are conducted on two standard classificationbenchmarks, namely CIFAR-100 and ILSVRC2012.
arXiv Detail & Related papers (2020-08-27T13:04:27Z) - Adversarial Bipartite Graph Learning for Video Domain Adaptation [50.68420708387015]
Domain adaptation techniques, which focus on adapting models between distributionally different domains, are rarely explored in the video recognition area.
Recent works on visual domain adaptation which leverage adversarial learning to unify the source and target video representations are not highly effective on the videos.
This paper proposes an Adversarial Bipartite Graph (ABG) learning framework which directly models the source-target interactions.
arXiv Detail & Related papers (2020-07-31T03:48:41Z) - Adaptive Graphical Model Network for 2D Handpose Estimation [19.592024471753025]
We propose a new architecture to tackle the task of 2D hand pose estimation from a monocular RGB image.
The Adaptive Graphical Model Network (AGMN) consists of two branches of deep convolutional neural networks for calculating unary and pairwise potential functions.
Our approach outperforms the state-of-the-art method used in 2D hand keypoints estimation by a notable margin on two public datasets.
arXiv Detail & Related papers (2019-09-18T04:19:51Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.