Learning Linear Non-Gaussian Graphical Models with Multidirected Edges

• URL: http://arxiv.org/abs/2010.05306v1
• Date: Sun, 11 Oct 2020 18:10:15 GMT
• Title: Learning Linear Non-Gaussian Graphical Models with Multidirected Edges
• Authors: Yiheng Liu, Elina Robeva, and Huanqing Wang
• Abstract summary: We propose a new method to learn the underlying acyclic mixed graph of a linear non-Gaussian structural equation model given observational data. We show that one can augment the hidden variable structure of the recovered model by learning em multidirected edges rather than only directed and bidirected ones.
• Score: 8.71151886950158
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we propose a new method to learn the underlying acyclic mixed graph of a linear non-Gaussian structural equation model given observational data. We build on an algorithm proposed by Wang and Drton, and we show that one can augment the hidden variable structure of the recovered model by learning {\em multidirected edges} rather than only directed and bidirected ones. Multidirected edges appear when more than two of the observed variables have a hidden common cause. We detect the presence of such hidden causes by looking at higher order cumulants and exploiting the multi-trek rule. Our method recovers the correct structure when the underlying graph is a bow-free acyclic mixed graph with potential multi-directed edges.

Related papers

• Causal Discovery for Linear Non-Gaussian Models with Disjoint Cycles [3.425341633647624]
  We develop an algorithm for learning causal structures with disjoint cycles.<n>We show that simple quadratic and cubic relations among low-order moments of a non-Gaussian distribution allow one to locate source cycles.
  arXiv  Detail & Related papers  (2025-07-14T19:45:23Z)
• Unfolding Tensors to Identify the Graph in Discrete Latent Bipartite Graphical Models [1.7132914341329848]
  We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models. Our result has useful implications for these models' trustworthy applications in scientific disciplines and interpretable machine learning.
  arXiv  Detail & Related papers  (2025-01-18T23:08:25Z)
• Graph-Dictionary Signal Model for Sparse Representations of Multivariate Data [49.77103348208835]
  We define a novel Graph-Dictionary signal model, where a finite set of graphs characterizes relationships in data distribution through a weighted sum of their Laplacians. We propose a framework to infer the graph dictionary representation from observed data, along with a bilinear generalization of the primal-dual splitting algorithm to solve the learning problem. We exploit graph-dictionary representations in a motor imagery decoding task on brain activity data, where we classify imagined motion better than standard methods.
  arXiv  Detail & Related papers  (2024-11-08T17:40:43Z)
• Gradformer: Graph Transformer with Exponential Decay [69.50738015412189]
  Self-attention mechanism in Graph Transformers (GTs) overlooks the graph's inductive biases, particularly biases related to structure. This paper presents Gradformer, a method innovatively integrating GT with the intrinsic inductive bias. Gradformer consistently outperforms the Graph Neural Network and GT baseline models in various graph classification and regression tasks.
  arXiv  Detail & Related papers  (2024-04-24T08:37:13Z)
• Graph Generation via Spectral Diffusion [51.60814773299899]
  We present GRASP, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and eigenvalues from which we can reconstruct the graph Laplacian and adjacency matrix. Our permutation invariant model can also handle node features by concatenating them to the eigenvectors of each node.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• Neural Gaussian Similarity Modeling for Differential Graph Structure Learning [24.582257964387402]
  We construct a differential graph structure learning model by replacing the non-differentiable nearest neighbor sampling with a differentiable sampling. To alleviate this issue, the bell-shaped Gaussian Similarity (GauSim) modeling is proposed to sample non-nearest neighbors. We develop a scalable method by transferring the large-scale graph to the transition graph to significantly reduce the complexity.
  arXiv  Detail & Related papers  (2023-12-15T02:45:33Z)
• Curve Your Attention: Mixed-Curvature Transformers for Graph Representation Learning [77.1421343649344]
  We propose a generalization of Transformers towards operating entirely on the product of constant curvature spaces. We also provide a kernelized approach to non-Euclidean attention, which enables our model to run in time and memory cost linear to the number of nodes and edges.
  arXiv  Detail & Related papers  (2023-09-08T02:44:37Z)
• Spectral Augmentations for Graph Contrastive Learning [50.149996923976836]
  Contrastive learning has emerged as a premier method for learning representations with or without supervision. Recent studies have shown its utility in graph representation learning for pre-training. We propose a set of well-motivated graph transformation operations to provide a bank of candidates when constructing augmentations for a graph contrastive objective.
  arXiv  Detail & Related papers  (2023-02-06T16:26:29Z)
• Joint graph learning from Gaussian observations in the presence of hidden nodes [26.133725549667734]
  We propose a joint graph learning method that takes into account the presence of hidden (latent) variables. We exploit the structure resulting from the previous considerations to propose a convex optimization problem. We compare the proposed algorithm with different baselines and evaluate its performance over synthetic and real-world graphs.
  arXiv  Detail & Related papers  (2022-12-04T13:03:41Z)
• Graph Polynomial Convolution Models for Node Classification of Non-Homophilous Graphs [52.52570805621925]
  We investigate efficient learning from higher-order graph convolution and learning directly from adjacency matrix for node classification. We show that the resulting model lead to new graphs and residual scaling parameter. We demonstrate that the proposed methods obtain improved accuracy for node-classification of non-homophilous parameters.
  arXiv  Detail & Related papers  (2022-09-12T04:46:55Z)
• Regularization of Mixture Models for Robust Principal Graph Learning [0.0]
  A regularized version of Mixture Models is proposed to learn a principal graph from a distribution of $D$-dimensional data points. Parameters of the model are iteratively estimated through an Expectation-Maximization procedure.
  arXiv  Detail & Related papers  (2021-06-16T18:00:02Z)
• Spatial-spectral Hyperspectral Image Classification via Multiple Random Anchor Graphs Ensemble Learning [88.60285937702304]
  This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE) Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
  arXiv  Detail & Related papers  (2021-03-25T09:31:41Z)
• Curvature Regularization to Prevent Distortion in Graph Embedding [15.383135890096462]
  We argue an important but neglected problem about proximity-preserving strategy. Graph topology patterns, while preserved well into an embedding manifold, may distort in the ambient embedding Euclidean space. We present a novel angle-based sectional curvature, termed ABS curvature, and accordingly three kinds of curvature regularization.
  arXiv  Detail & Related papers  (2020-11-28T20:16:24Z)
• The multilayer random dot product graph [6.722870980553432]
  We present a comprehensive extension of the latent position network model known as the random dot product graph. We propose a method for jointly embedding submatrices into a suitable latent space. Empirical improvements in link prediction over single graph embeddings are exhibited in a cyber-security example.
  arXiv  Detail & Related papers  (2020-07-20T20:31:39Z)

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.