paper-with-me

Papers

Convolutional Learning on Multigraphs

2022-09-23 · Landon Butler, Alejandro Parada-Mayorga, Alejandro Ribeiro

Graph convolutional learning has led to many exciting discoveries in diverse areas. However, in some applications, traditional graphs are insufficient to capture the structure and intricacies of the data. In such scenarios, multigraphs arise naturally as discrete structures in which complex dynamics can be embedded. In this paper, we develop convolutional information processing on multigraphs and introduce convolutional multigraph neural networks (MGNNs). To capture the complex dynamics of information diffusion within and across each of the multigraph's classes of edges, we formalize a convolutional signal processing model, defining the notions of signals, filtering, and frequency representations on multigraphs. Leveraging this model, we develop a multigraph learning architecture, including a sampling procedure to reduce computational complexity. The introduced architecture is applied towards optimal wireless resource allocation and a hate speech localization task, offering improved performance over traditional graph neural networks.

📄 PDF Abstract BibTeX arXiv:2209.11354

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Learning with Multigraph Convolutional Filters

2022-10-28 · Landon Butler, Alejandro Parada-Mayorga, Alejandro Ribeiro

In this paper, we introduce a convolutional architecture to perform learning when information is supported on multigraphs. Exploiting algebraic signal processing (ASP), we propose a convolutional signal processing model …

End-to-End Learning from Complex Multigraphs with Latent-Graph Convolutional Networks

2019-08-14 · Floris Hermsen, Peter Bloem, Fabian Jansen, Wolf Vos

We study the problem of end-to-end learning from complex multigraphs with potentially very large numbers of edges between two vertices, each edge labeled with rich information. Examples range from communication networks …

General ClassificationNode Classification

A Nonparametric Bayesian Model for Sparse Dynamic Multigraphs

2019-10-11 · Elahe Ghalebi, Hamidreza Mahyar, Radu Grosu, Graham W. Taylor 외

As the availability and importance of temporal interaction data--such as email communication--increases, it becomes increasingly important to understand the underlying structure that underpins these interactions. Often t…

Clustering

A Multi-Task Perspective for Link Prediction with New Relation Types and Nodes

2023-07-12 · Jincheng Zhou, Beatrice Bevilacqua, Bruno Ribeiro

The task of inductive link prediction in (discrete) attributed multigraphs infers missing attributed links (relations) between nodes in new test multigraphs. Traditional relational learning methods face the challenge of …

Inductive Link PredictionLink PredictionPredictionRelation+1

On the existence of EFX allocations in multigraphs

2025-02-13 · Alkmini Sgouritsa, Minas Marios Sotiriou

We study the problem of "fairly" dividing indivisible goods to several agents that have valuation set functions over the sets of goods. As fair we consider the allocations that are envy-free up to any good (EFX), i.e., n…