Learning Higher-Order Graph Structure with Features by Structure Penalty
In discrete undirected graphical models, the conditional independence of node labels Y is specified by the graph structure. We study the case where there is another input random vector X (e.g. observed features) such that the distribution P (Y | X) is determined by functions of X that characterize the (higher-order) interactions among the Y ’s. The main contribution of this paper is to learn the graph structure and the functions conditioned on X at the same time. We prove that discrete undirected graphical models with feature X are equivalent to mul- tivariate discrete models. The reparameterization of the potential functions in graphical models by conditional log odds ratios of the latter offers advantages in representation of the conditional independence structure. The functional spaces can be flexibly determined by kernels. Additionally, we impose a Structure Lasso (SLasso) penalty on groups of functions to learn the graph structure. These groups with overlaps are designed to enforce hierarchical function selection. In this way, we are able to shrink higher order interactions to obtain a sparse graph structure.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Higher-order Structure Boosts Link Prediction on Temporal Graphs
Temporal Graph Neural Networks (TGNNs) have gained growing attention for modeling and predicting structures in temporal graphs. However, existing TGNNs primarily focus on pairwise interactions while overlooking higher-or…
Dynamic Link PredictionGraph LearningGraph Neural NetworkHypergraph representations+1CliquePH: Higher-Order Information for Graph Neural Networks through Persistent Homology on Clique Graphs
Graph neural networks have become the default choice by practitioners for graph learning tasks such as graph classification and node classification. Nevertheless, popular graph neural network models still struggle to cap…
Graph ClassificationGraph LearningGraph Neural NetworkNode Classification+1HOSE-Net: Higher Order Structure Embedded Network for Scene Graph Generation
Scene graph generation aims to produce structured representations for images, which requires to understand the relations between objects. Due to the continuous nature of deep neural networks, the prediction of scene grap…
General ClassificationGraph GenerationKnowledge Graphsobject-detection+3Hypergraph Echo State Network
A hypergraph as a generalization of graphs records higher-order interactions among nodes, yields a more flexible network model, and allows non-linear features for a group of nodes. In this article, we propose a hypergrap…
Binary ClassificationSelf-Attention in Colors: Another Take on Encoding Graph Structure in Transformers
We introduce a novel self-attention mechanism, which we call CSA (Chromatic Self-Attention), which extends the notion of attention scores to attention _filters_, independently modulating the feature channels. We showcase…
Graph Regression