h1

h2

h3

h4

h5
h6

HIGH-HOPeS

Higher-Order Hodge Laplacians for Processing of multi-way Signals

Grant period2023-01-01 - 2027-12-31
Funding bodyEuropean Union
Call numberERC-2021-STG
Grant number101039827
IdentifierG:(EU-Grant)101039827

Note: Network analysis has revolutionized our understanding of complex systems, and graph-based methods have emerged as powerful tools to process signals on non-Euclidean domains via graph signal processing and graph neural networks. The graph Laplacian and related matrices are pivotal to such analyses: i) the Laplacian serves as algebraic descriptor of the relationships between nodes; moreover, it is key for the analysis of network structure, for local operations such as averaging over connected nodes, and for network dynamics like diffusion and consensus; ii) Laplacian eigenvectors are natural basis-functions for data on graphs and endowed with meaningful variability notions for graph signals, akin to Fourier analysis in Euclidean domains. However, graphs are ill-equipped to encode multi-way and higher-order relations that are becoming increasingly important to comprehend complex datasets and systems in many applications, e.g., to understand group-dynamics in social systems, multi-gene interactions in genetic data, or multi-way drug interactions. The goal of this project is to develop methods that can utilize such higher-order relations, going from mathematical models to efficient algorithms and software. Specifically, we will focus on ideas from algebraic topology and discrete calculus, according to which the graph Laplacian can be seen as part of a hierarchy of Hodge-Laplacians that emerge from treating graphs as instances of more general cell complexes that systematically encode couplings between node-tuples of any size. Our ambition is to i) provide more informative ways to represent and analyze the structure of complex systems, paying special attention to computational efficiency; ii) translate the success of graph-based signal processing to data on general topological spaces defined by cell complexes; and iii) by generalizing from graphs to neural networks on complexes, gain deeper theoretical insights on the principles of graph neural networks as special case.
   

Recent Publications

All known publications ...
Download: BibTeX | EndNote XML,  Text | RIS | 

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Preprint  ;  ;
Faster Inference of Cell Complexes from Flows via Matrix Factorization
5 Seiten () [10.48550/arXiv.2508.21372]  GO arXiv  Download fulltext Files  Download fulltextFulltext by arXiv.org BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Contribution to a book/Contribution to a conference proceedings  ;  ;
Faster Inference of Cell Complexes from Flows via Matrix Factorization
2025 33rd European Signal Processing Conference (EUSIPCO) : [Proceedings]
33. European Signal Processing Conference, EUSIPCO 2025, PalermoPalermo, Italy, 8 Sep 2025 - 12 Sep 20252025-09-082025-09-12
IEEE 2487-2491 () [10.23919/EUSIPCO63237.2025.11226659]  GO  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Preprint  ;  ;
Don't be Afraid of Cell Complexes : An Introduction from an Applied Perspective
41 Seiten () [10.48550/arXiv.2506.09726]  GO arXiv  Download fulltext Files  Download fulltextFulltext by arXiv.org BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Preprint  ;
HLSAD: Hodge Laplacian-based Simplicial Anomaly Detection
11 Seiten () [10.48550/arXiv.2505.24534]  GO OpenAccess  Download fulltext Files  Download fulltextFulltext by arXiv.org BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Contribution to a book/Contribution to a conference proceedings  ;
A Bayesian Perspective on Uncertainty Quantification for Estimated Graph Signals
2025 IEEE International Conference on Acoustics, Speech, and Signal Processing : conference proceedings : Hyderabad, India / sponsors and organizer: IEEE, IEEE Signal Processing Society ; K V S Hari, V John Mathews, general chairs
2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025, HyderabadHyderabad, India, 6 Apr 2025 - 11 Apr 20252025-04-062025-04-11
[Piscataway, NJ] : IEEE 5 Seiten () [10.1109/ICASSP49660.2025.10889783]  GO  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Preprint  ;  ;  ;
Efficient Sparsification of Simplicial Complexes via Local Densities of States
10 Seiten () [10.48550/arXiv.2502.07558]  GO OpenAccess  Download fulltext Files  Download fulltextFulltext by arXiv.org BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Contribution to a book/Contribution to a conference proceedings  ;  ;  ;
Graph Neural Networks Do Not Always Oversmooth
Advances in Neural Information Processing Systems 37 (NeurIPS 2024) / edited by: A. Globerson and L. Mackey and D. Belgrave and A. Fan and U. Paquet and J. Tomczak and C. Zhang
38. Conference on Neural Information Processing Systems, NeurIPS 2024, VancouverVancouver, Canada, 10 Dec 2024 - 15 Dec 20242024-12-102024-12-15
[Erscheinungsort nicht ermittelbar] : [Verlag nicht ermittelbar], Advances in neural information processing systems 37, [1]-25 ()  GO   Download fulltextFulltext Download fulltextHomepage of book BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Preprint  ;  ;  ;
Graph Neural Networks Do Not Always Oversmooth
38. Conference on Neural Information Processing Systems, NeurIPS 2024, VancouverVancouver, Canada, 9 Dec 2024 - 15 Dec 20242024-12-092024-12-15 19 Seiten () [10.48550/arXiv.2406.02269]  GO OpenAccess  Download fulltext Files  Download fulltextFulltext by arXiv.org BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Contribution to a book/Contribution to a conference proceedings  ;  ;  ;
Topological Trajectory Classification and Landmark Inference on Simplicial Complexes
Conference record of the Fifty-Eighth Asilomar Conference on Signals, Systems & Computers : October 27 - 30, 2024, Pacific Grove, California / edited by: Michael B. Matthews, ICR ; technical co-sponsor: the IEEE Signal Processing Society
58. Asilomar Conference on Signals, Systems, and Computers, Pacific GrovePacific Grove, USA, 27 Oct 2024 - 30 Oct 20242024-10-272024-10-30
[Piscataway, NJ] : IEEE 44-48 () [10.1109/IEEECONF60004.2024.10942887]  GO BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;
TopoX: A Suite of Python Packages for Machine Learning on Topological Domains
Journal of machine learning research : JMLR 25(374), 1-8 () [10.18154/RWTH-2025-00049]  GO OpenAccess  Download fulltext Files  Download fulltextFulltext BibTeX | EndNote: XML, Text | RIS

All known publications ...
Download: BibTeX | EndNote XML,  Text | RIS | 


 Datensatz erzeugt am 2023-03-03, letzte Änderung am 2023-03-04



Dieses Dokument bewerten:

Rate this document:
1
2
3
 
(Bisher nicht rezensiert)