The central limitation the authors identify is architectural. Traditional graph neural networks, from the original graph neural network model through graph convolutional networks, GraphSAGE, and graph attention networks, operate through local message passing between connected nodes. This design encodes pairwise interactions well but struggles to represent higher-order structures explicitly. Research on higher-order network organization has shown that many real systems, from protein interaction networks to transportation systems, cannot be fully described by pairwise edges alone. Group interactions, hierarchies, and multiscale dependencies require richer mathematical objects than simple graphs can provide.

Compounding this expressive bottleneck are well-documented pathologies of message passing. Over-smoothing causes node representations to become indistinguishable as networks grow deeper, while over-squashing compresses information from distant parts of a graph into a fixed-size vector, degrading performance on tasks requiring long-range dependencies. Studies connecting these failures to graph curvature have sharpened the diagnosis, and work on the Weisfeiler-Lehman hierarchy has clarified exactly what graph neural networks can and cannot distinguish. The review positions topological deep learning as a principled response to these constraints rather than an incremental patch.

Topological deep learning draws on topological data analysis, a field rooted in the computation of persistent homology. The idea is elegant: rather than describing data at a single scale, one examines how topological features such as connected components, loops, and voids appear and disappear as a scale parameter varies. The resulting persistence diagrams, often visualized as barcodes, are stable under small perturbations of the data, a property formalized in classical stability theorems for persistence modules. This stability is what makes topological summaries usable as features in machine learning pipelines, since small changes in input should not produce wildly different representations.

The review traces how these topological signals enter neural architectures through several distinct mechanisms. In one family of approaches, persistence diagrams are converted into fixed-length vectors using persistence images, persistence landscapes, or kernels such as the sliced Wasserstein kernel, and then fed to standard learners. In another, differentiable topology layers allow topological quantities to be optimized directly within a network, as in topological autoencoders that regularize latent spaces to preserve topological structure. A third family builds the topology into the architecture itself: simplicial neural networks, cell complex neural networks, and combinatorial complex networks generalize message passing from graphs to higher-dimensional domains, enabling information to flow along boundaries of simplices and between cells of varying dimension.

Sheaf-based models represent a particularly intriguing branch. Neural sheaf diffusion reframes graph neural networks through the lens of cellular sheaves, attaching vector spaces to nodes and restriction maps to edges. This perspective offers a topological explanation for heterophily and over-smoothing problems, suggesting that the failure modes of standard architectures are not accidental but reflect a mismatch between the underlying topology and the assumed uniformity of message passing. The review treats these developments as part of a coherent progression from classical structural features toward increasingly expressive topological models.

Where do topological features actually earn their keep? The review identifies application domains in which they carry meaningful interpretations. In neuroscience, persistent homology has revealed cliques and cavities in the human connectome, and homological scaffolds of brain functional networks have exposed architecture invisible to pairwise correlation analysis. In structural biology, topology-based networks such as TopologyNet have predicted biomolecular properties, while persistent homology has been applied to protein folding, flexibility, and binding analysis. Sensor network coverage has been verified through persistent homology, and neural codes have been decoded through the topology of stimulus spaces. In software engineering, code property graphs and vulnerability detection systems illustrate how structured program representations benefit from richer relational modeling.

The authors are careful to avoid overclaiming. Their review proposes criteria for sound model comparison, noting that a graph baseline alone does not constitute a topology-specific ablation, that asymptotic complexity claims do not substitute for measured preprocessing costs, and that visualizing a persistence diagram counts as localization only when it can be traced back to structure in the original sample. An appendix auditing a subset of method papers found that many empirical studies fall short on these reporting standards, a finding that echoes broader concerns about benchmarking rigor in the field. Frameworks such as TopoBench and the TopoX suite of Python packages are highlighted as infrastructure that could make comparisons more systematic.

The expressivity question remains open. Recent work on topological blindspots has shown that even topological neural networks have limits in what they can distinguish, and the relationship between the Weisfeiler-Lehman hierarchy and simplicial or cellular expressivity is still being mapped. Differentiable lifting, the process of converting graph data into higher-order complexes, introduces its own design choices that can dominate downstream performance. The review emphasizes that these choices are not neutral: how one lifts data into a simplicial or cellular complex determines which topological features become visible to the model at all.

The practical takeaway for practitioners is a decision framework rather than a slogan. If a task is dominated by local pairwise structure, standard graph neural networks remain efficient, well-understood, and supported by mature libraries such as PyTorch Geometric and the Deep Graph Library. But when the signal lives in cycles, cavities, flows, or group interactions, when the global shape of the data matters, topological deep learning offers tools that graph models cannot replicate. Shymkovych and Hryshyn’s synthesis makes a compelling case that the field has matured enough to move from mathematical promise to disciplined application, provided that future studies meet the reporting standards the review lays out. As complex systems generate ever richer structured data, the shape of that data, quite literally, may become the most informative feature of all.

Subject of Research: Topological deep learning methods for analyzing structured data in complex systems

Article Title: Topological deep learning for the analysis of structured data in complex systems: a structured critical review

Article References: Shymkovych, V., & Hryshyn, O. (2026). Topological deep learning for the analysis of structured data in complex systems: a structured critical review. International Journal of Data Science and Analytics, 22(1), Article 314. https://doi.org/10.1007/s41060-026-01304-5

Image Credits: AI Generated

DOI: 10.1007/s41060-026-01304-5

Keywords: topological deep learning, graph neural networks, persistent homology, simplicial complexes, cellular complexes, higher-order networks, topological data analysis, sheaf neural networks, complex systems, structured data, message passing, benchmarking

In a paper published in Knowledge and Information Systems, a team led by Tianyi Ma and Yanfang Ye of the University of Notre Dame, together with collaborators at the University of Connecticut and Amazon GenAI, introduces BHyGNN+, a self-supervised framework for learning representations of heterophilic hypergraphs, structures in which a single relationship, called a hyperedge, can link any number of entities that may have little or nothing in common. The work extends the group’s earlier supervised model, BHyGNN, and removes its most restrictive requirement: the need for labeled training data.

The heterophily problem is easy to illustrate. Consider a shopping dataset in which each hyperedge is a shopping cart. A single cart routinely contains products from wildly different categories, such as diapers, a phone charger, and a novel, so the items joined by that hyperedge are semantically dissimilar by design. Political datasets behave similarly: a bill co-sponsored by legislators spans party lines, so nodes connected through the same hyperedge often belong to different classes. When a neural network averages information across such dissimilar neighbors, it blurs the very distinctions that downstream tasks, like classifying a product or predicting a legislator’s party, depend on. The researchers found that on heterophilic benchmarks, even a simple multilayer perceptron that ignores network structure entirely can outperform several sophisticated hypergraph neural networks, a striking sign that conventional message passing can actively hurt in these settings.

The earlier BHyGNN model tackled this by making propagation selective. Rather than forcing every node to exchange information with every hyperedge it touches, the model learns, for each node-hyperedge pair, whether the node should broadcast its features into the hyperedge or receive information back from it. This decision is made by a Variational Broadcast Autoencoder Network that samples discrete broadcast and receive actions through a Gumbel-Softmax relaxation, and the resulting representations are refined by an incorporation transformer with multi-head attention. Trained end to end, the model worked well, but its propagation actions were guided by downstream class labels, which are precisely the resource that is scarce, expensive, or entirely absent in many practical applications, from emerging illicit drug trafficking networks to newly formed e-commerce catalogs.

BHyGNN+ replaces that label dependence with a contrastive self-supervised objective built on an elegant structural idea: hypergraph duality. Every hypergraph has a dual in which the roles of nodes and hyperedges are swapped. Each original hyperedge becomes a node in the dual, and each original node becomes a hyperedge connecting the dual nodes it belonged to. Mathematically, this amounts to transposing the incidence matrix, and it is a lossless operation. The authors prove that the dual preserves all task-relevant information, since the transform is its own inverse, and that the normalized walk operators of a hypergraph and its dual share the same nonzero eigenvalues. In spectral terms, the two views are isospectral: they encode identical nontrivial structure while exposing complementary, node-centric versus hyperedge-centric, pathways through the data.

The training procedure capitalizes on this complementarity. The framework applies four stochastic augmentations, namely node attribute masking, hyperedge perturbation that only removes members to avoid injecting noisy connections, hyperedge dropping, and node dropping, to generate corrupted views of both the original hypergraph and its dual. Each augmented view is passed through the shared hypergraph encoder, and a readout function pools node and hyperedge embeddings into a single global representation. The contrastive loss then maximizes the cosine similarity between the representation of an augmented view and that of its corresponding augmented dual. Crucially, this formulation needs no negative samples at all. Most existing hypergraph contrastive methods, such as TriCL and HyperGCL, rely on negative pairs to prevent representation collapse, but constructing high-quality negatives in large hypergraphs is difficult and computationally costly. By contrasting a structure against its own dual, BHyGNN+ sidesteps the problem entirely, using only positive pairs.

The authors also supply a theoretical argument for why duality is especially well suited to heterophilic data. They show that two hyperedges sharing even a single node, which become neighbors in the dual, have provably higher expected similarity in their class composition than random hyperedge pairs, with a strictly positive contribution arising from the shared structure alone. In a heterophilic hypergraph, where members of one hyperedge span many classes, this means the dual view reorganizes apparently incoherent node-level structure into locally coherent hyperedge-level neighborhoods. Because the global readout aggregates over all of these dual neighbors, the coherence propagates into the contrastive signal, giving the encoder a stable learning signal even when node-level homophily is absent. The bound is tightest precisely when shared nodes carry maximally diverse labels, which is exactly the heterophilic regime where other methods struggle most.

The empirical evaluation is unusually broad, spanning eleven datasets and thirteen baselines. The heterophilic benchmarks include Senate, Congress, and House, where nodes are legislators labeled by party affiliation, and Walmart, where nodes are co-purchased products; the homophilic set covers co-authorship networks such as Cora-CA and DBLP, co-citation networks including Cora, PubMed, and Citeseer, and a Twitter hypergraph for classifying roles in illicit drug trafficking networks, plus a synthetic four-class heterophilic hypergraph generated from a contextual stochastic block model. Across these benchmarks, BHyGNN+ consistently outperformed both supervised and self-supervised state-of-the-art methods, including ED-HNN, SheafHGNN, TriCL, and HypeBoy, despite never seeing a label during pretraining. Paired t-tests with Bonferroni correction confirmed that the improvements over most baselines are statistically significant, with adjusted p-values near zero on the heterophilic datasets, and the advantage was most pronounced against structure-ignoring MLPs and the generative method HypeBoy.

The framework’s advantages widen as labels become scarcer. Under a split in which only ten percent of nodes are used for training, BHyGNN+ showed a substantial improvement over its supervised predecessor BHyGNN, which struggles to learn sensible propagation actions from limited supervision. In controlled experiments on synthetic hypergraphs with homophily scores ranging from 0.4 to 0.8, all methods improved as homophily increased, but BHyGNN+ achieved the best results in the most heterophilic settings, beating the strongest baseline, TriCL, by roughly four percentage points under both moderate and high feature noise. Sensitivity analyses showed stable performance across hidden dimensions from 64 to 1024, with an augmentation ratio of 0.2 proving optimal, since heavier perturbation injects too much noise. Diagnostic plots of the embedding space ruled out representation collapse: training loss never reached zero, embedding norms remained stable, and the effective rank of the embedding matrix stayed high, notably higher for heterophilic datasets, suggesting the model automatically allocates richer representational capacity to harder structures.

The implications reach well beyond benchmark tables. Hypergraphs arise wherever group interactions matter, including biochemical networks, transaction records, legislative activity, and online communities, and in most of these domains, ground-truth labels are rare or lag reality. A method that extracts usable representations from raw structure alone, without negatives and without annotations, lowers the barrier to applying higher-order network learning in exactly those settings. The authors note open questions that remain, including extending the framework to hyperedge-level and graph-level tasks, designing augmentations tailored specifically to heterophilic structure, and deepening the theory of why duality works so well. For now, though, the message is clear: when a network looks incoherent from one angle, its mirror image may hold the pattern.

Subject of Research: Self-supervised representation learning on heterophilic hypergraphs using hypergraph duality

Article Title: Bhygnn+: unsupervised representation learning for heterophilic hypergraphs

Article References: Ma, T., Qian, Y., Wang, Z., Zhang, Z., Zhang, C., & Ye, Y. (2026). Bhygnn+: unsupervised representation learning for heterophilic hypergraphs. Knowledge and Information Systems, 68(1), Article 265. https://doi.org/10.1007/s10115-026-02834-x

Image Credits: AI Generated

DOI: 10.1007/s10115-026-02834-x

Keywords: hypergraph neural networks, self-supervised learning, contrastive learning, heterophily, hypergraph duality, representation learning, graph neural networks, unsupervised learning, node classification, higher-order networks, machine learning, Knowledge and Information Systems