Hypergraphs are a powerful abstraction for representing higher-order interactions between entities of interest. To exploit these relationships in making downstream predictions, a variety of hypergraph neural network architectures have recently been proposed, in large part building upon precursors from the more traditional graph neural network (GNN) literature. Somewhat differently, in this paper we begin by presenting an expressive family of parameterized, hypergraph-regularized energy functions. We then demonstrate how minimizers of these energies effectively serve as node embeddings that, when paired with a parameterized classifier, can be trained end-to-end via a supervised bilevel optimization process. Later, we draw parallels between the implicit architecture of the predictive models emerging from the proposed bilevel hypergraph optimization, and existing GNN architectures in common use. Empirically, we demonstrate state-of-the-art results on various hypergraph node classification benchmarks. Code is available at https://github.com/yxzwang/PhenomNN.
Hypergraph representations are both more efficient and better suited to describe data characterized by relations between two or more objects. In this work, we present a new graph neural network based on message passing capable of processing hypergraph-structured data. We show that the proposed model defines a design space for neural network models for hypergraphs, thus generalizing existing models for hypergraphs. We report experiments on a benchmark dataset for node classification, highlighting the effectiveness of the proposed model with respect to other state-of-the-art methods for graphs a…
Many problems in computer vision and machine learning can be cast as learning on hypergraphs that represent higher-order relations. Recent approaches for hypergraph learning extend graph neural networks based on message passing, which is simple yet fundamentally limited in modeling long-range dependencies and expressive power. On the other hand, tensor-based equivariant neural networks enjoy maximal expressiveness, but their application has been limited in hypergraphs due to heavy computation and strict assumptions on fixed-order hyperedges. We resolve these problems and present Equivariant Hy…
HWL-HIN: A Hypergraph-Level Hypergraph Isomorphism Network as Powerful as the Hypergraph Weisfeiler-Lehman Test with Application to Higher-Order Network Robustness
Ho Chi Minh City University of Technology (HCMUT), VNU-HCM（胡志明市理工大学（HCMUT），越南国家大学胡志明市分校）；EPHE-PSL University（巴黎高等研究实践学院-巴黎文理研究大学）
This paper presents a novel version of the hypergraph neural network method. This method is utilized to solve the noisy label learning problem. First, we apply the PCA dimensional reduction technique to the feature matrices of the image datasets in order to reduce the "noise" and the redundant features in the feature matrices of the image datasets and to reduce the runtime constructing the hypergraph of the hypergraph neural network method. Then, the classic graph-based semi-supervised learning method, the classic hypergraph based semi-supervised learning method, the graph neural network, the …
Stability and Generalization of Hypergraph Collaborative Networks
Institute of Data Science, The University of Hong Kong（香港大学数据科学学院）；College of Information Science and Technology, Jinan University（暨南大学信息科学技术学院）；The University of Hong Kong（香港大学）
HyperSAT: Unsupervised Hypergraph Neural Networks for Weighted MaxSAT Problems
School of Mathematical Sciences, University of Chinese Academy of Science（中国科学院大学数学科学学院）；Zhongguancun Laboratory（中关村实验室）；School of Automation Science and Electrical Engineering, Beihang University（北京航空航天大学自动化科学与电气工程学院）
University of Illinois, Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）
Hypergraphs are used to model higher-order interactions amongst agents and there exist many practically relevant instances of hypergraph datasets. To enable efficient processing of hypergraph-structured data, several hypergraph neural network platforms have been proposed for learning hypergraph properties and structure, with a special focus on node classification. However, almost all existing methods use heuristic propagation rules and offer suboptimal performance on many datasets. We propose AllSet, a new hypergraph neural network paradigm that represents a highly general framework for (hyper…
The Chinese University of Hong Kong（香港中文大学）；Shenzhen Institutes of Advanced Technology（深圳先进技术研究院）；Huawei Noah’s Ark Lab（华为诺亚方舟实验室）；Huawei Hisilicon（华为海思）；Peking University（北京大学）
Precise congestion prediction from a placement solution plays a crucial role in circuit placement. This work proposes the lattice hypergraph (LH-graph), a novel graph formulation for circuits, which preserves netlist data during the whole learning process, and enables the congestion information propagated geometrically and topologically. Based on the formulation, we further developed a heterogeneous graph neural network architecture LHNN, jointing the routing demand regression to support the congestion spot classification. LHNN constantly achieves more than 35% improvements compared with U-net…
University of Illinois at Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）；Amazon（亚马逊）
Despite the prevalence of hypergraphs in a variety of high-impact applications, there are relatively few works on hypergraph representation learning, most of which primarily focus on hyperlink prediction, often restricted to the transductive learning setting. Among others, a major hurdle for effective hypergraph representation learning lies in the label scarcity of nodes and/or hyperedges. To address this issue, this paper presents an end-to-end, bi-level pre-training strategy with Graph Neural Networks for hypergraphs. The proposed framework named HyperGene bears three distinctive advantages.…
Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University（上海交通大学图像处理与模式识别研究所）
Hypergraph, an expressive structure with flexibility to model the higher-order correlations among entities, has recently attracted increasing attention from various research domains. Despite the success of Graph Neural Networks (GNNs) for graph representation learning, how to adapt the powerful GNN-variants directly into hypergraphs remains a challenging problem. In this paper, we propose UniGNN, a unified framework for interpreting the message passing process in graph and hypergraph neural networks, which can generalize general GNN models into hypergraphs. In this framework, meticulously-desi…
Graph representation learning for hypergraphs can be used to extract patterns among higher-order interactions that are critically important in many real world problems. Current approaches designed for hypergraphs, however, are unable to handle different types of hypergraphs and are typically not generic for various learning tasks. Indeed, models that can predict variable-sized heterogeneous hyperedges have not been available. Here we develop a new self-attention based graph neural network called Hyper-SAGNN applicable to homogeneous and heterogeneous hypergraphs with variable hyperedge sizes. …
Recently, graph neural networks have attracted great attention and achieved prominent performance in various research fields. Most of those algorithms have assumed pairwise relationships of objects of interest. However, in many real applications, the relationships between objects are in higher-order, beyond a pairwise formulation. To efficiently learn deep embeddings on the high-order graph-structured data, we introduce two end-to-end trainable operators to the family of graph neural networks, i.e., hypergraph convolution and hypergraph attention. Whilst hypergraph convolution defines the basi…
Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger
Beijing University of Posts and Telecommunications（北京邮电大学）；North China Electric Power University（华北电力大学）；University of Kent（肯特大学）；Beihang University（北航）；University of Illinois（伊利诺伊大学）
Central South University（中南大学）；National University of Defence Technology（国防科技大学）；Tsinghua University（清华大学）
Hypergraph neural networks (HGNN) have shown superior performance in various deep learning tasks, leveraging the high-order representation ability to formulate complex correlations among data by connecting two or more nodes through hyperedge modeling. Despite the well-studied adversarial attacks on Graph Neural Networks (GNN), there is few study on adversarial attacks against HGNN, which leads to a threat to the safety of HGNN applications. In this paper, we introduce HyperAttack, the first white-box adversarial attack framework against hypergraph neural networks. HyperAttack conducts a white-…
UniG-Encoder: A Universal Feature Encoder for Graph and Hypergraph Node Classification
Fudan University（复旦大学）；Institute of AI and Robotics, Academy for Engineering and Technology, Fudan University（复旦大学工程与应用技术研究院人工智能与机器人研究所）；Research Institute of Intelligent Complex Systems, Fudan University（复旦大学智能复杂体系研究院）
Graph neural networks (GNNs) with missing node features have recently received increasing interest. Such missing node features seriously hurt the performance of the existing GNNs. Some recent methods have been proposed to reconstruct the missing node features by the information propagation among nodes with known and unknown attributes. Although these methods have achieved superior performance, how to exactly exploit the complex data correlations among nodes to reconstruct missing node features is still a great challenge. To solve the above problem, we propose a self-supervised guided hypergrap…
Heterogeneous Directed Hypergraph Neural Network over abstract syntax tree (AST) for Code Classification
School of Computer Science and Technology, East China Normal University（计算机科学与技术学院，东华大学）；NPPA Key Laboratory of Publishing Integration Development, ECNUP（出版集成发展关键实验室，ECNUP）
Arizona State University（亚利桑那州立大学）；University of Illinois Chicago（伊利诺伊大学芝加哥分校）；Bytedance（字节跳动）；Illinois Institute of Technology（伊利诺伊理工学院）
Nowadays, fake news easily propagates through online social networks and becomes a grand threat to individuals and society. Assessing the authenticity of news is challenging due to its elaborately fabricated contents, making it difficult to obtain large-scale annotations for fake news data. Due to such data scarcity issues, detecting fake news tends to fail and overfit in the supervised setting. Recently, graph neural networks (GNNs) have been adopted to leverage the richer relational information among both labeled and unlabeled instances. Despite their promising results, they are inherently f…
Dynamic Hypergraph-Enhanced Prediction of Sequential Medical Visits
University of Southern California（南加州大学）；University of California, Berkeley（加利福尼亚大学伯克利分校）；Texas Tech University（德克萨斯理工大学）；Southern Methodist University（南卫理公会大学）
IBM Research（IBM研究院）；Indian Institute of Science（印度科学研究所）
Network representation learning and node classification in graphs got significant attention due to the invent of different types graph neural networks. Graph convolution network (GCN) is a popular semi-supervised technique which aggregates attributes within the neighborhood of each node. Conventional GCNs can be applied to simple graphs where each edge connects only two nodes. But many modern days applications need to model high order relationships in a graph. Hypergraphs are effective data types to handle such complex relationships. In this paper, we propose a novel technique to apply graph c…
Multi-Granular Attention based Heterogeneous Hypergraph Neural Network
School of Computer Science, Hubei University（湖北大学计算机学院）；Hubei Key Laboratory of Big Data Intelligent Analysis and Application (Hubei University)（湖北大学大数据智能分析与应用重点实验室）；Discipline of Business Analytics, The University of Sydney（悉尼大学商业分析学科）；Key Laboratory of Intelligent Sensing System and Security (Hubei University), Ministry of Education（智能感知系统与安全重点实验室（湖北大学），教育部）
HyperNQ: A Hypergraph Neural Network Decoder for Quantum LDPC Codes
Department of Electrical and Computer Engineering, The University of Texas at Dallas（电子与计算机工程系，德克萨斯大学达拉斯分校）；Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute（电子、计算机与系统工程系，伦塞拉尔理工大学）
A Mesh-Adaptive Hypergraph Neural Network for Unsteady Flow Around Oscillating and Rotating Structures
Department of Mechanical Engineering, The University of British Columbia（不列颠哥伦比亚大学机械工程系）；Department of Mechanical Engineering, University of California, Berkeley（加州大学伯克利分校机械工程系）
POSTECH（浦项科技大学）；Center for Geometry and Physics, Institute for Basic Science (IBS)（基础科学研究院几何与物理中心）；Korea Advanced Institute of Science and Technology (KAIST)（韩国科学技术院）
Ho Chi Minh City University of Technology (HCMUT)（胡志明市理工大学）；Vietnam National University Ho Chi Minh City (VNU-HCM)（越南胡志明市国家大学）
This paper constitutes the novel hypergraph convolutional neural networkbased clustering technique. This technique is employed to solve the clustering problem for the Citeseer dataset and the Cora dataset. Each dataset contains the feature matrix and the incidence matrix of the hypergraph (i.e., constructed from the feature matrix). This novel clustering method utilizes both matrices. Initially, the hypergraph auto-encoders are employed to transform both the incidence matrix and the feature matrix from high dimensional space to low dimensional space. In the end, we apply the k-means clustering…
Tsinghua-Berkeley Shenzhen Institute, Tsinghua University（清华大学清华-伯克利深圳学院）
In recent years, hypergraph learning has attracted great attention due to its capacity in representing complex and high-order relationships. However, current neural network approaches designed for hypergraphs are mostly shallow, thus limiting their ability to extract information from high-order neighbors. In this paper, we show both theoretically and empirically, that the performance of hypergraph neural networks does not improve as the number of layers increases, which is known as the over-smoothing problem. To avoid this issue, we develop a new deep hypergraph convolutional network called De…
Hypergraph Neural Diffusion: A PDE-Inspired Framework for Hypergraph Message Passing
School of Mathematics and Statistics, Shandong University（山东大学数学与统计学院）；Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）；School of Mathematical Sciences, University of Chinese Academy of Sciences（中国科学院大学数学科学学院）；Institute of Information Engineering, Chinese Academy of Sciences（中国科学院信息工程研究所）；School of Cyber Security, University of Chinese Academy of Sciences（中国科学院大学网络空间安全学院）
Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets
Institute for Financial Services Analytics, University of Delaware（特拉华大学金融服务分析研究所）；Department of Applied Economics and Statistics, University of Delaware（特拉华大学应用经济学与统计学系）；Department of Electrical and Computer Engineering, University of Kentucky（肯塔基大学电气与计算机工程系）；Department of Electrical and Computer Engineering, University of Delaware（特拉华大学电气与计算机工程系）
From Diffusion to Reaction-Diffusion: A Dynamical-Systems View of Oversmoothing in Hypergraph Neural Networks
School of Mathematics and Statistics, Shandong University, Weihai（山东大学（威海）数学与统计学院）；Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）；University of Chinese Academy of Sciences（中国科学院大学）
