Pith. sign in

REVIEW 1 cited by

Heterogeneous Graph Neural Networks with Loss-decrease-aware Curriculum Learning

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 2405.06522 v1 pith:D6LDEV2W submitted 2024-05-10 cs.LG cs.AI

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

In recent years, heterogeneous graph neural networks (HGNNs) have achieved excellent performance in handling heterogeneous information networks (HINs). Curriculum learning is a machine learning strategy where training examples are presented to a model in a structured order, starting with easy examples and gradually increasing difficulty, aiming to improve learning efficiency and generalization. To better exploit the rich information in HINs, previous methods have started to explore the use of curriculum learning strategy to train HGNNs. Specifically, these works utilize the absolute value of the loss at each training epoch to evaluate the learning difficulty of each training sample. However, the relative loss, rather than the absolute value of loss, reveals the learning difficulty. Therefore, we propose a novel loss-decrease-aware training schedule (LDTS). LDTS uses the trend of loss decrease between each training epoch to better evaluating the difficulty of training samples, thereby enhancing the curriculum learning of HGNNs for downstream tasks. Additionally, we propose a sampling strategy to alleviate training imbalance issues. Our method further demonstrate the efficacy of curriculum learning in enhancing HGNNs capabilities. We call our method Loss-decrease-aware Heterogeneous Graph Neural Networks (LDHGNN). The code is public at https://github.com/wangyili00/LDHGNN.

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. IMPaCT GNN: Imposing invariance with Message Passing in Chronological split Temporal Graphs

    cs.LG 2024-11 reject novelty 6.0 of 10

    IMPaCT reweights graph message passing to align first and second moments across chronological train/test splits, reporting accuracy gains on ogbn-mag and a theoretical W1 bound.

Pith tools