Pith. sign in

REVIEW 2 cited by

Mixture of Link Predictors on Graphs

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 2402.08583 v2 pith:TPHYTWX5 submitted 2024-02-13 cs.LG

classification cs.LG
keywords pairwiseinformationlinklink-moepredictiondatasetgnnsperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Link prediction, which aims to forecast unseen connections in graphs, is a fundamental task in graph machine learning. Heuristic methods, leveraging a range of different pairwise measures such as common neighbors and shortest paths, often rival the performance of vanilla Graph Neural Networks (GNNs). Therefore, recent advancements in GNNs for link prediction (GNN4LP) have primarily focused on integrating one or a few types of pairwise information. In this work, we reveal that different node pairs within the same dataset necessitate varied pairwise information for accurate prediction and models that only apply the same pairwise information uniformly could achieve suboptimal performance. As a result, we propose a simple mixture of experts model Link-MoE for link prediction. Link-MoE utilizes various GNNs as experts and strategically selects the appropriate expert for each node pair based on various types of pairwise information. Experimental results across diverse real-world datasets demonstrate substantial performance improvement from Link-MoE. Notably, Link-MoE achieves a relative improvement of 18.71\% on the MRR metric for the Pubmed dataset and 9.59\% on the Hits@100 metric for the ogbl-ppa dataset, compared to the best baselines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. H$^2$GFM: Towards unifying Homogeneity and Heterogeneity on Text-Attributed Graphs

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A graph foundation model with text-encoded meta-relations and a mixture of context-adaptive transformers improves accuracy across homogeneous and heterogeneous text-attributed graphs.

  2. Mixture of Experts for Node Classification

    cs.SI 2024-11 reject novelty 5.0 of 10

    MoE-NP learns to weight five node classifiers per node using a gating network over local and global graph patterns, improving average accuracy on seven datasets.

Pith tools