Graph Neural Networks (GNNs) have shown great promise in modeling relationships between nodes in a graph, but capturing higher-order relationships remains a challenge for large-scale networks. Previous studies have primarily attempted to utilize the information from higher-order neighbors in the graph, involving the incorporation of powers of the shift operator, such as the graph Laplacian or adjacency matrix. This approach comes with a trade-off in terms of increased computational and memory demands. Relying on graph spectral theory, we make a fundamental observation: the regular and the Hadamard power of the Laplacian matrix behave similarly in the spectrum. This observation has significant implications for capturing higher-order information in GNNs for various tasks such as node classification and semi-supervised learning. Consequently, we propose a novel graph convolutional operator based on the sparse Sobolev norm of graph signals. Our approach, known as Sparse Sobolev GNN (S2-GNN), employs Hadamard products between matrices to maintain the sparsity level in graph representations. S2-GNN utilizes a cascade of filters with increasing Hadamard powers to generate a diverse set of functions. We theoretically analyze the stability of S2-GNN to show the robustness of the model against possible graph perturbations. We also conduct a comprehensive evaluation of S2-GNN across various graph mining, semi-supervised node classification, and computer vision tasks. In particular use cases, our algorithm demonstrates competitive performance compared to state-of-the-art GNNs in terms of performance and running time.
When GNNs meet symmetry in ILPs: an orbit-based feature augmentation approach
School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)理工学院);Shenzhen International Center for Industrial and Applied Mathematics(深圳国际工业与应用数学中心);Shenzhen Research Institute of Big Data(深圳大数据研究院);School of Data Science, The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)数据科学学院);School of Artificial Intelligence, The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)人工智能学院);School of Software Engineering, Tongji University, Shanghai(同济大学软件学院)
Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining
School of Computer Science and Engineering(计算机科学与工程学院);University of Electronic Science and Technology of China(电子科技大学);th Research Institute of CETC(中国电子科技集团公司第五十四研究所)
Indian Institute of Information Technology Kottayam (IIITK)(印度信息技术学院科塔亚姆分校(IIITK));International Institute of Information Technology Hyderabad (IIITH)(印度信息技术学院海得拉巴分校(IIITH))
KTH Royal Institute of Technology(皇家理工学院);University of Peloponnese(伯罗奔尼撒大学);University of Luxembourg(卢森堡大学);Ecole Polytechnique, IP Paris(巴黎综合理工学院(巴黎IP))
CERN(欧洲核子研究中心);University of L'Aquila(拉奎拉大学);University of Trieste(的里雅斯特大学);University of Genoa(热那亚大学);Sapienza University(罗马大学);Policlinico Universitario Agostino Gemelli(阿戈斯蒂诺·杰梅利大学综合医院)
GCoDE: Efficient Device-Edge Co-Inference for GNNs via Architecture-Mapping Co-Search
School of Software, Beihang University(北京航空航天大学软件学院);School of Computer Science and Engineering, Beihang University(北京航空航天大学计算机科学与工程学院);Qingdao Research Institute, Beihang University(北京航空航天大学青岛研究院);School of Computer Science and Engineering, Peking University(北京大学计算机科学与工程学院);School of Integrated Circuits and Engineering, Beihang University(北京航空航天大学集成电路与工程学院)
When Vision Meets Graphs: A Survey on Graph Reasoning and Learning
The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳));University of Waterloo(滑铁卢大学);Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所);University of Oxford(牛津大学)
Knowledge Graphs Meet Graph Neural Networks: A Comprehensive Survey
School of Safety Engineering, China University of Mining and Technology(中国矿业大学安全工程学院);School of Computer Science and Technology, China University of Mining and Technology(中国矿业大学计算机科学与技术学院);State Key Laboratory of Coal Mine Disaster Prevention and Control, China University of Mining and Technology(中国矿业大学煤矿灾害防治国家重点实验室);Department of Computer Science, University of Illinois at Chicago(伊利诺伊大学芝加哥分校计算机科学系)
Survey of Graph Neural Network for Internet of Things and NextG Networks
Marconi-Rosenblatt AI Innovation Laboratory(马科尼-罗森布劳特人工智能创新实验室);ANDRO Computational Solutions LLC(ANDRO计算解决方案有限公司);Department of Electrical Engineering University at Buffalo, The State University of New York(大学伯克利电气工程系,纽约州立大学)
High Pileup Particle Tracking with Object Condensation
Princeton University(普林斯顿大学);Institute for Research and Innovation in Software for High Energy Physics (IRIS-HEP)(高能物理软件研究与创新研究所(IRIS-HEP));Delhi Technological University(德里理工大学);University of Chicago(芝加哥大学);Georgia Tech(佐治亚理工学院)
Contrastive Learning Meets Pseudo-label-assisted Mixup Augmentation: A Comprehensive Graph Representation Framework from Local to Global
School of Information Science and Technology, Beijing University of Technology(北京工业大学信息科学与技术学院);The University of Sydney Business School, The University of Sydney(悉尼大学商学院);College of Information Science and Technology, Beijing University of Chemical Technology(北京化工大学信息科学与技术学院)
Contrastive Graph Pooling for Explainable Classification of Brain Networks
School of Computer Science and Engineering, Nanyang Technological University(南洋理工大学计算机科学与工程学院);Department of Computer Science and Technology, Tsinghua University(清华大学计算机科学与技术系);School of Computer Science, the University of Auckland(奥克兰大学计算机学院);Lee Kong Chian School of Medicine, Nanyang Technological University(南洋理工大学李光前医学院)