Fetching the paper…
Reading the bibliography…
The goal of this paper is to introduce pooling strategies for simplicial convolutional neural networks.
“Combinatorial laplacians of simplicial complexes,”
T.E. Goldberg, · 2002
Earlier work this paper cites.
“Weighted graph cuts without eigenvectors a multilevel approach,”
Inderjit S Dhillon, Yuqiang Guan, and Brian Kulis, · 2007
Earlier work this paper cites.
“Finite impulse response filters for simplicial complexes,”
Maosheng Yang, Elvin Isufi, Michael T. Schaub, and Geert Leus, · 2009
Earlier work this paper cites.
“The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,”
D. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, · 2012
Earlier work this paper cites.
“Spectral networks and locally connected networks on graphs,”
Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun, · 2013
Earlier work this paper cites.
“Adam: A method for stochastic optimization,”
Diederik P Kingma and Jimmy Ba, · 2015
Earlier work this paper cites.
“Semi-supervised classification with graph convolutional networks,”
Thomas N Kipf and Max Welling, · 2016
Earlier work this paper cites.
“Geometric deep learning: going beyond euclidean data,”
Michael M Bronstein, Joan Bruna, Yann LeCun, Arthur Szlam, and Pierre Vandergheynst, · 2017
Earlier work this paper cites.
“Towards sparse hierarchical graph classifiers,”
Cătălina Cangea, Petar Veličković, Nikola Jovanović, Thomas Kipf, and Pietro Liò, · 2018
Earlier work this paper cites.
“Representation learning on graphs with jumping knowledge networks,”
Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka, · 2018
Cited alongside, same era.
“Graph convolutional networks with eigenpooling,”
Yao Ma, Suhang Wang, Charu C. Aggarwal, and Jiliang Tang, · 2019
Cited alongside, same era.
“Hierarchical graph pooling with structure learning,”
Zhen Zhang, Jiajun Bu, Martin Ester, Jianfeng Zhang, Chengwei Yao, Zhi Yu, and Can Wang, · 2019
Cited alongside, same era.
“Graph u-nets,”
Hongyang Gao and Shuiwang Ji, · 2019
Cited alongside, same era.
“Self-attention graph pooling,”
Junhyun Lee, Inyeop Lee, and Jaewoo Kang, · 2019
Cited alongside, same era.
“Topological signal processing over simplicial complexes,”
Sergio Barbarossa and Stefania Sardellitti, · 2020
“Tudataset: A collection of benchmark datasets for learning with graphs,”
Christopher Morris, Nils M. Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, and Marion Neumann, · 2020
Later among the works it cites.
“Cell complex neural networks,”
Mustafa Hajij, Kyle Istvan, and Ghada Zamzmi, · 2020
Later among the works it cites.
“Weisfeiler and lehman go topological: Message passing simplicial networks,”
Cristian Bodnar, Fabrizio Frasca, Yu Guang Wang, Nina Otter, Guido Montufar, Pietro Liò, and Michael M Bronstein, · 2021
Later among the works it cites.
“Understanding pooling in graph neural networks,”
Daniele Grattarola, Daniele Zambon, Filippo Maria Bianchi, and Cesare Alippi, · 2021
Later among the works it cites.
“Weisfeiler and lehman go cellular: Cw networks,”
Cristian Bodnar, Fabrizio Frasca, Nina Otter, Yuguang Wang, Pietro Lio, Guido F Montufar, and Michael Bronstein, · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Random walks on simplicial complexes and the normalized hodge 1-laplacian,”
Michael T Schaub, Austin R Benson, Paul Horn, Gabor Lippner, and Ali Jadbabaie, · 2020
Cited alongside, same era.
“Simplicial neural networks,”
Stefania Ebli, Michaël Defferrard, and Gard Spreemann, · 2020
Cited alongside, same era.
“Hodge laplacians on graphs,”
Lek-Heng Lim, · 2020
Cited alongside, same era.
“Simplicial convolutional neural networks,”
Maosheng Yang, Elvin Isufi, and Geert Leus, · 2022
Closest in time.
“Simplicial attention neural networks,”
L. Giusti, Claudio Battiloro, Paolo Di Lorenzo, Stefania Sardellitti, and Sergio Barbarossa, · 2022
Closest in time.
“Simplicial attention networks,”
Christopher Wei Jin Goh, Cristian Bodnar, and Pietro Lio, · 2022
Closest in time.
Lorenzo Giusti, Claudio Battiloro, Lucia Testa, Paolo Di Lorenzo, Stefania Sardellitti, and Sergio Barbarossa, · 2022
Closest in time.