mlsanityData to 14 Oct 2026

Topo-MLP : A Simplicial Network Without Message Passing

arXiv 2312.11862 ↗First posted 19 Dec 2023cs.LG cs.AI cs.CVcited by 7

Not on the map. Why?

Abstract (arXiv)

Due to their ability to model meaningful higher order relations among a set of entities, higher order network models have emerged recently as a powerful alternative for graph-based network models which are only capable of modeling binary relationships. Message passing paradigm is still dominantly used to learn representations even for higher order network models. While powerful, message passing can have disadvantages during inference, particularly when the higher order connectivity information is missing or corrupted. To overcome such limitations, we propose Topo-MLP, a purely MLP-based simplicial neural network algorithm to learn the representation of elements in a simplicial complex without explicitly relying on message passing. Our framework utilizes a novel Higher Order Neighborhood Contrastive (HONC) loss which implicitly incorporates the simplicial structure into representation learning. Our proposed model's simplicity makes it faster during inference. Moreover, we show that our model is robust when faced with missing or corrupted connectivity structure.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 31 of its 39 references that are in the map. First posted on arXiv 19 Dec 2023.

Builds on

31 of 39 references.

References · 31

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2017Graph Attention Networkscited by 8,923
  4. 2016Gaussian Error Linear Units (GELUs)cited by 3,502
  5. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  6. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  7. 2014DeepWalk: Online Learning of Social Representationscited by 1,547
  8. 2019Simplifying Graph Convolutional Networkscited by 1,477
  9. 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
  10. 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 881
  11. 2016Interaction Networks for Learning about Objects, Relations and Physicscited by 509
  12. 2018Hypergraph Neural Networkscited by 488
19 more
  1. 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 413
  2. 2019What graph neural networks cannot learn: depth vs widthcited by 201
  3. 2020Simplicial Neural Networkscited by 110
  4. 2018Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplaciancited by 86
  5. 2021Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyondcited by 82
  6. 2021Principled Simplicial Neural Networks for Trajectory Predictioncited by 77
  7. 2021Graph-MLP: Node Classification without Message Passing in Graphcited by 73
  8. 2020Cell Complex Neural Networkscited by 67
  9. 2021What are higher-order networks?cited by 66
  10. 2021The physics of higher-order interactions in complex systemscited by 63
  11. 2022Simplicial Attention Networkscited by 41
  12. 2021Simplicial Convolutional Neural Networkscited by 40
  13. 2019HodgeNet: Graph Neural Networks for Edge Datacited by 39
  14. 2021Signal Processing on Cell Complexescited by 31
  15. 2021BScNets: Block Simplicial Complex Neural Networkscited by 21
  16. 2022Simplicial Attention Neural Networkscited by 21
  17. 2021Simplicial Complex Representation Learningcited by 17
  18. 2021Dist2Cycle: A Simplicial Neural Network for Homology Localizationcited by 16
  19. 2022Dynamics on higher-order networks: A reviewcited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 6; 2025: 0; 2026: 1.

7 papers.