Learning Regularization for Graph Inverse Problems

• URL: http://arxiv.org/abs/2408.10436v1
• Date: Mon, 19 Aug 2024 22:03:02 GMT
• Title: Learning Regularization for Graph Inverse Problems
• Authors: Moshe Eliasof, Md Shahriar Rahim Siddiqui, Carola-Bibiane Schönlieb, Eldad Haber,
• Abstract summary: We introduce a framework leveraging GNNs to solve Graph Inverse Problems (GRIP) The framework is based on a combination of likelihood and prior terms, which are used to find a solution that fits the data. We study our approach on a number of representative problems that demonstrate the effectiveness of the framework.
• Score: 16.062351610520693
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years, Graph Neural Networks (GNNs) have been utilized for various applications ranging from drug discovery to network design and social networks. In many applications, it is impossible to observe some properties of the graph directly; instead, noisy and indirect measurements of these properties are available. These scenarios are coined as Graph Inverse Problems (GRIP). In this work, we introduce a framework leveraging GNNs to solve GRIPs. The framework is based on a combination of likelihood and prior terms, which are used to find a solution that fits the data while adhering to learned prior information. Specifically, we propose to combine recent deep learning techniques that were developed for inverse problems, together with GNN architectures, to formulate and solve GRIP. We study our approach on a number of representative problems that demonstrate the effectiveness of the framework.

Related papers

• The Evolution of Distributed Systems for Graph Neural Networks and their Origin in Graph Processing and Deep Learning: A Survey [17.746899445454048]
  Graph Neural Networks (GNNs) are an emerging research field. GNNs can be applied to various domains including recommendation systems, computer vision, natural language processing, biology and chemistry. We aim to fill this gap by summarizing and categorizing important methods and techniques for large-scale GNN solutions.
  arXiv  Detail & Related papers  (2023-05-23T09:22:33Z)
• DEGREE: Decomposition Based Explanation For Graph Neural Networks [55.38873296761104]
  We propose DEGREE to provide a faithful explanation for GNN predictions. By decomposing the information generation and aggregation mechanism of GNNs, DEGREE allows tracking the contributions of specific components of the input graph to the final prediction. We also design a subgraph level interpretation algorithm to reveal complex interactions between graph nodes that are overlooked by previous methods.
  arXiv  Detail & Related papers  (2023-05-22T10:29:52Z)
• An Empirical Study of Retrieval-enhanced Graph Neural Networks [48.99347386689936]
  Graph Neural Networks (GNNs) are effective tools for graph representation learning. We propose a retrieval-enhanced scheme called GRAPHRETRIEVAL, which is agnostic to the choice of graph neural network models. We conduct comprehensive experiments over 13 datasets, and we observe that GRAPHRETRIEVAL is able to reach substantial improvements over existing GNNs.
  arXiv  Detail & Related papers  (2022-06-01T09:59:09Z)
• Automatic Relation-aware Graph Network Proliferation [182.30735195376792]
  We propose Automatic Relation-aware Graph Network Proliferation (ARGNP) for efficiently searching GNNs. These operations can extract hierarchical node/relational information and provide anisotropic guidance for message passing on a graph. Experiments on six datasets for four graph learning tasks demonstrate that GNNs produced by our method are superior to the current state-of-the-art hand-crafted and search-based GNNs.
  arXiv  Detail & Related papers  (2022-05-31T10:38:04Z)
• Towards Unsupervised Deep Graph Structure Learning [67.58720734177325]
  We propose an unsupervised graph structure learning paradigm, where the learned graph topology is optimized by data itself without any external guidance. Specifically, we generate a learning target from the original data as an "anchor graph", and use a contrastive loss to maximize the agreement between the anchor graph and the learned graph.
  arXiv  Detail & Related papers  (2022-01-17T11:57:29Z)
• GDDR: GNN-based Data-Driven Routing [0.0]
  We show that an approach using Graph Neural Networks (GNNs) performs at least as well as previous work using Multilayer Perceptron architectures. GNNs have the added benefit that they allow for the generalisation of trained agents to different network topologies with no extra work.
  arXiv  Detail & Related papers  (2021-04-20T12:12:17Z)
• Meta-Learning with Graph Neural Networks: Methods and Applications [5.804439462187914]
  Graph Neural Networks (GNNs) are generalizations of deep neural networks on graph data. GNNs are limited when there are few available samples. In recent years, researchers have started to apply meta-learning to GNNs.
  arXiv  Detail & Related papers  (2021-02-27T06:19:11Z)
• A Unified View on Graph Neural Networks as Graph Signal Denoising [49.980783124401555]
  Graph Neural Networks (GNNs) have risen to prominence in learning representations for graph structured data. In this work, we establish mathematically that the aggregation processes in a group of representative GNN models can be regarded as solving a graph denoising problem. We instantiate a novel GNN model, ADA-UGNN, derived from UGNN, to handle graphs with adaptive smoothness across nodes.
  arXiv  Detail & Related papers  (2020-10-05T04:57:18Z)
• Geom-GCN: Geometric Graph Convolutional Networks [15.783571061254847]
  We propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN, to perform transductive learning on graphs.
  arXiv  Detail & Related papers  (2020-02-13T00:03:09Z)
• Gated Graph Recurrent Neural Networks [176.3960927323358]
  We introduce Graph Recurrent Neural Networks (GRNNs) as a general learning framework for graph processes. To address the problem of vanishing gradients, we put forward GRNNs with three different gating mechanisms: time, node and edge gates. The numerical results also show that GRNNs outperform GNNs and RNNs, highlighting the importance of taking both the temporal and graph structures of a graph process into account.
  arXiv  Detail & Related papers  (2020-02-03T22:35:14Z)

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.