Research map / Graph learning / GNN architectures
Higher-Order Learning with Graph Neural Networks via Hypergraph Encodings
Raphaël Pellegrin, Lukas Fesser, Melanie Weber
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
The paper proposes encoding higher-order (hypergraph) information for graph neural networks, but the abstract is truncated so the specific method is not stated.
Problem
Relational learning over higher-order interactions that extend beyond pairwise relations, where existing hypergraph GNNs rely on message passing to encode higher-order information.
Approach
Abstract is truncated; it only indicates a proposal to encode higher-order information via hypergraph encodings as an alternative to message passing. Specifics are not stated.
Limitations
- Full text unavailable; method details and results cannot be verified from the abstract alone.
Closest papers by meaning
- Training-Free Message Passing for Learning on Hypergraphs (ICLR 2025 · similarity 0.90)
- SPHINX: Structural Prediction using Hypergraph Inference Network (ICML 2025 · similarity 0.89)
- K-hop Hypergraph Neural Network: A Comprehensive Aggregation Approach (AAAI 2025 · similarity 0.89)
- Deep Hypergraph Neural Networks with Tight Framelets (AAAI 2025 · similarity 0.89)
- When Hypergraph Meets Heterophily: New Benchmark Datasets and Baseline (AAAI 2025 · similarity 0.89)
- Hypergraph-enhanced Dual Semi-supervised Graph Classification (ICML 2024 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
