mlsanityData to 14 Oct 2026

Hodge-Aware Contrastive Learning

arXiv 2309.07364 ↗First posted 14 Sep 2023cs.LG cs.AI eess.SPcited by 0

Not on the map. Why?

Abstract (arXiv)

Simplicial complexes prove effective in modeling data with multiway dependencies, such as data defined along the edges of networks or within other higher-order structures. Their spectrum can be decomposed into three interpretable subspaces via the Hodge decomposition, resulting foundational in numerous applications. We leverage this decomposition to develop a contrastive self-supervised learning approach for processing simplicial data and generating embeddings that encapsulate specific spectral information.Specifically, we encode the pertinent data invariances through simplicial neural networks and devise augmentations that yield positive contrastive examples with suitable spectral properties for downstream tasks. Additionally, we reweight the significance of negative examples in the contrastive loss, considering the similarity of their Hodge components to the anchor. By encouraging a stronger separation among less similar instances, we obtain an embedding space that reflects the spectral properties of the data. The numerical results on two standard edge flow classification tasks show a superior performance even when compared to supervised learning techniques. Our findings underscore the importance of adopting a spectral perspective for contrastive learning with higher-order data.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 28 references that are in the map. First posted on arXiv 14 Sep 2023.

Builds on

22 of 28 references.

References · 22

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  3. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  4. 2020What Makes for Good Views for Contrastive Learning?cited by 846
  5. 2020Deep Graph Contrastive Representation Learningcited by 539
  6. 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
  7. 2020Debiased Contrastive Learningcited by 356
  8. 2021Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networkscited by 221
  9. 2022Data Augmentation for Deep Graph Learning: A Surveycited by 133
  10. 2020Networks beyond pairwise interactions: structure and dynamicscited by 130
  11. 2020Simplicial Neural Networkscited by 110
  12. 2019Topological Signal Processing over Simplicial Complexescited by 96
10 more
  1. 2018Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplaciancited by 86
  2. 2021Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyondcited by 82
  3. 2021Principled Simplicial Neural Networks for Trajectory Predictioncited by 77
  4. 2022Hard Sample Aware Network for Contrastive Deep Graph Clusteringcited by 61
  5. 2022Revisiting Graph Contrastive Learning from the Perspective of Graph Spectrumcited by 43
  6. 2021Simplicial Convolutional Neural Networkscited by 40
  7. 2022Spectral Augmentation for Self-Supervised Learning on Graphscited by 39
  8. 2021Finite Impulse Response Filters for Simplicial Complexescited by 15
  9. 2021Hodgelets: Localized Spectral Representations of Flows on Simplicial Complexescited by 11
  10. 2022Convolutional Filtering in Simplicial Complexescited by 8

Built on by

Not cited yet.