Pith. sign in

REVIEW 8 cited by

You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.13264 v4 pith:O3XA6LVU submitted 2021-06-24 cs.LG cs.AI

You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks

classification cs.LG cs.AI
keywords hypergraphneuralallsetdatasetsnetworksmultisetnetworkclassification
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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)graph neural networks and for the first time implements hypergraph neural network layers as compositions of two multiset functions that can be efficiently learned for each task and each dataset. Furthermore, AllSet draws on new connections between hypergraph neural networks and recent advances in deep learning of multiset functions. In particular, the proposed architecture utilizes Deep Sets and Set Transformer architectures that allow for significant modeling flexibility and offer high expressive power. To evaluate the performance of AllSet, we conduct the most extensive experiments to date involving ten known benchmarking datasets and three newly curated datasets that represent significant challenges for hypergraph node classification. The results demonstrate that AllSet has the unique ability to consistently either match or outperform all other hypergraph neural networks across the tested datasets.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets

    cs.LG 2026-06 unverdicted novelty 7.0

    Introduces Hypergraph U-Nets with PHPool and PHUnpool operators derived from hierarchical clustering dendrograms for hypergraph reconstruction, classification, and anomaly detection.

  2. Rethinking Event-Based Object Dtection through Representation-Level Temporal Aggregation and Model-Level Hypergraph Reasoning

    cs.CV 2026-05 unverdicted novelty 7.0

    Ev-DTAD improves event-based object detection accuracy and speed by using hierarchical temporal aggregation at the representation level and frequency-aware hypergraph fusion at the model level.

  3. Hypergraph Neural Stochastic Diffusion: An SDE Framework for Uncertainty Estimation

    cs.LG 2026-07 conditional novelty 6.5

    HyperNSD models hypergraph node states as an incidence-aware SDE whose pathwise variability yields competitive uncertainty estimates for OOD and misclassification detection.

  4. Heterophily-Aware Adaptive Knowledge Distillation for Hypergraph Neural Networks

    cs.LG 2026-06 unverdicted novelty 6.0

    HADES adapts knowledge distillation for hypergraph neural networks by using quantified node heterophily as a proxy for teacher reliability, yielding student models that often outperform teachers with up to 12.3x faste...

  5. Rethinking Event-Based Object Dtection through Representation-Level Temporal Aggregation and Model-Level Hypergraph Reasoning

    cs.CV 2026-05 unverdicted novelty 6.0

    Ev-DTAD introduces hierarchical temporal aggregation for event representation and frequency-aware hypergraph fusion for feature reasoning, delivering accuracy and speed gains on Gen1, 1Mpx/Gen4, and eTraM event detect...

  6. Rethinking Event-Based Object Dtection through Representation-Level Temporal Aggregation and Model-Level Hypergraph Reasoning

    cs.CV 2026-05 unverdicted novelty 6.0

    Ev-DTAD combines hierarchical temporal aggregation into a pseudo-RGB representation with frequency-aware hypergraph fusion to improve accuracy and speed in event-based object detection on Gen1, Gen4, and eTraM datasets.

  7. Hypergraph and Latent ODE Learning for Multimodal Root Cause Localization in Microservices

    cs.LG 2026-05 unverdicted novelty 6.0

    HyperODE RCA integrates hypergraph learning with latent ODEs and cross-modal attention to improve root cause localization in microservice architectures on the Tianchi AIOps benchmark.

  8. Fuzzy, Neutrosophic, and Uncertain Graph Theory: Properties and Applications

    cs.AI 2026-04 conditional novelty 3.0

    A survey organizing fuzzy, neutrosophic, and plithogenic graph classes and parameters under a unified uncertain-graph framework, with well-definedness proofs for each generalized concept.