Pith. sign in

REVIEW 1 cited by

Loss-aware Curriculum Learning for Heterogeneous Graph 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 2402.18875 v1 pith:JS3LWUT6 submitted 2024-02-29 cs.LG

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

Heterogeneous Graph Neural Networks (HGNNs) are a class of deep learning models designed specifically for heterogeneous graphs, which are graphs that contain different types of nodes and edges. This paper investigates the application of curriculum learning techniques to improve the performance and robustness of Heterogeneous Graph Neural Networks (GNNs). To better classify the quality of the data, we design a loss-aware training schedule, named LTS that measures the quality of every nodes of the data and incorporate the training dataset into the model in a progressive manner that increases difficulty step by step. LTS can be seamlessly integrated into various frameworks, effectively reducing bias and variance, mitigating the impact of noisy data, and enhancing overall accuracy. Our findings demonstrate the efficacy of curriculum learning in enhancing HGNNs capabilities for analyzing complex graph-structured data. The code is public at https://github.com/LARS-research/CLGNN/.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Attention-Driven Metapath Encoding in Heterogeneous Graphs

    cs.LG 2024-12 conditional novelty 5.0 of 10

    HAN-ME encodes metapath instances with attention over all nodes in the path, outperforming the HAN baseline on IMDB node classification but not demonstrating SOTA competitiveness.

Pith tools