Unsupervised Multi-Scale Gromov-Wasserstein Hypergraph Alignment

• URL: http://arxiv.org/abs/2608.29635v1
• Date: Sun, 30 Aug 2026 07:55:35 GMT
• Title: Unsupervised Multi-Scale Gromov-Wasserstein Hypergraph Alignment
• Abstract summary: We introduce FALCON, an unsupervised optimal-transport framework for hypergraph alignment.<n>FALCON is robust to structural noise and in almost all cases outperforms strong graph- and hypergraph-alignment baselines.
• Score: 17.88280607029242
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study unsupervised hypergraph alignment, where the goal is to infer node correspondences between two hypergraphs using only structural information, without node features, labels, seed matches, or side information. Direct higher-order formulations can represent hyperedge interactions faithfully, but they can be computationally demanding and cumbersome for non-uniform hypergraphs. Graph-reduction approaches introduce a different challenge: clique expansions keep the alignment problem on the original node set but collapse all hyperedge evidence into one pairwise graph, whereas bipartite expansions preserve incidence structure but enlarge the problem from nodes to nodes plus hyperedges. We introduce FALCON (Filtration-based hypergrAph aLignment via Cross-scale Optimal traNsport), an unsupervised optimal-transport framework for hypergraph alignment. Instead of representing each hypergraph by a single collapsed clique graph, FALCON constructs a filtration-induced sequence of clique-based co-occurrence dissimilarity matrices and jointly aligns all levels through one shared multi-scale Gromov--Wasserstein (GW) objective. The shared transport plan enforces a globally consistent node correspondence across filtration levels while avoiding the auxiliary hyperedge nodes introduced by bipartite expansion. Experiments on perturbation benchmarks derived from real-world hypergraphs show that FALCON is robust to structural noise and in almost all cases outperforms strong graph- and hypergraph-alignment baselines.

Related papers

• Hypergraph as Language [49.35033483821496]
  We propose a hypergraph-native alignment framework for large language models.<n>For hypergraph structures, existing methods often fail to preserve the native semantics that multiple objects are jointly connected by the same high-order relation.<n>We show that Hyper-Align significantly outperforms existing methods across in-domain and zero-shot evaluations.
  arXiv  Detail & Related papers  (2026-05-21T01:09:48Z)
• BHyGNN+: Unsupervised Representation Learning for Heterophilic Hypergraphs [50.161252392272324]
  We introduce BHyGNN+, a self-supervised learning framework for representation learning on heterophilic hypergraphs.<n>By contrasting augmented views of a hypergraph against its dual using cosine similarity, our framework captures essential structural patterns in a fully unsupervised manner.<n>Our results validate the effectiveness of leveraging hypergraph duality for self-supervised learning.
  arXiv  Detail & Related papers  (2026-02-16T16:55:37Z)
• Hyperedge Modeling in Hypergraph Neural Networks by using Densest Overlapping Subgraphs [0.0]
  One of the most important problems in graph clustering is to find densest overlapping subgraphs (DOS) In this paper, we propose a solution to the DOS problem via Agglomerativedyion (DOSAGE) algorithm as a novel approach to enhance the process of generating the densest overlapping subgraphs. Experiments on standard benchmarks show that the DOSAGE algorithm significantly outperforms the HGNNs and six other methods on the node classification task.
  arXiv  Detail & Related papers  (2024-09-16T14:56:10Z)
• Hypergraph Transformer for Semi-Supervised Classification [50.92027313775934]
  We propose a novel hypergraph learning framework, HyperGraph Transformer (HyperGT) HyperGT uses a Transformer-based neural network architecture to effectively consider global correlations among all nodes and hyperedges. It achieves comprehensive hypergraph representation learning by effectively incorporating global interactions while preserving local connectivity patterns.
  arXiv  Detail & Related papers  (2023-12-18T17:50:52Z)
• Enhancing Hyperedge Prediction with Context-Aware Self-Supervised Learning [57.35554450622037]
  We propose a novel hyperedge prediction framework (CASH)<n>CASH employs context-aware node aggregation to capture complex relations among nodes in each hyperedge for (C1) and (2) self-supervised contrastive learning in the context of hyperedge prediction to enhance hypergraph representations for (C2)<n>Experiments on six real-world hypergraphs reveal that CASH consistently outperforms all competing methods in terms of the accuracy in hyperedge prediction.
  arXiv  Detail & Related papers  (2023-09-11T20:06:00Z)
• A Markov Random Field model for Hypergraph-based Machine Learning [38.44721289347428]
  This paper addresses the challenge of modelling the data generation processes on hypergraphs.<n>The proposed data-generating process provides a valuable inductive bias for various hypergraph machine learning tasks.<n>We introduce two novel frameworks: 1) an original hypergraph structure inference framework named HGSI, and 2) a novel learning framework entitled Hypergraph-MLP for node classification on hypergraphs.
  arXiv  Detail & Related papers  (2023-08-27T18:28:58Z)
• BOURNE: Bootstrapped Self-supervised Learning Framework for Unified Graph Anomaly Detection [50.26074811655596]
  We propose a novel unified graph anomaly detection framework based on bootstrapped self-supervised learning (named BOURNE) By swapping the context embeddings between nodes and edges, we enable the mutual detection of node and edge anomalies. BOURNE can eliminate the need for negative sampling, thereby enhancing its efficiency in handling large graphs.
  arXiv  Detail & Related papers  (2023-07-28T00:44:57Z)
• Classification of Edge-dependent Labels of Nodes in Hypergraphs [17.454063924648896]
  We introduce a classification of edge-dependent node labels as a new problem. This problem can be used as a benchmark task for hypergraph neural networks. We propose WHATsNet, a novel hypergraph neural network that represents the same node differently depending on the hyperedges it participates in.
  arXiv  Detail & Related papers  (2023-06-05T16:50:34Z)
• Learning Hypergraphs From Signals With Dual Smoothness Prior [41.43504601820411]
  Hypergraph structure learning ( HGSL) aims to learn the hypergraph structures from the observed signals to capture intrinsic high-order relationships.<n>This paper addresses two challenges: how to handle the huge search space of potential hyperedges, and how to define meaningful criteria to measure the relationship between the signals observed on nodes and the hypergraph structure.<n> Experiments show that HGSL can efficiently infer meaningful hypergraph topologies from observed signals.
  arXiv  Detail & Related papers  (2022-11-03T11:13:02Z)
• Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphs [59.71134113268709]
  We present General Hypergraph Spectral Convolution(GHSC), a general learning framework that can handle EDVW and EIVW hypergraphs. In this paper, we show that the proposed framework can achieve state-of-the-art performance. Experiments from various domains including social network analysis, visual objective classification, protein learning demonstrate that the proposed framework can achieve state-of-the-art performance.
  arXiv  Detail & Related papers  (2022-03-31T10:46:47Z)
• Semi-supervised Hypergraph Node Classification on Hypergraph Line Expansion [7.933465724913661]
  We propose a new hypergraph formulation named the emphline expansion (LE) for hypergraphs learning. The proposed emphline expansion makes existing graph learning algorithms compatible with the higher-order structure. We evaluate the proposed line expansion on five hypergraph datasets, the results show that our method beats SOTA baselines by a significant margin.
  arXiv  Detail & Related papers  (2020-05-11T03:02:21Z)

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.