Benchmarking Sensitivity of Continual Graph Learning for Skeleton-Based Action Recognition

Wei Wei, Tom De Schepper, Kevin Mets
1/31/2024
cs.CVcs.LG

No confident code implementation found for this paper.

Abstract

Continual learning (CL) is the research field that aims to build machine learning models that can accumulate knowledge continuously over different tasks without retraining from scratch. Previous studies have shown that pre-training graph neural networks (GNN) may lead to negative transfer (Hu et al., 2020) after fine-tuning, a setting which is closely related to CL. Thus, we focus on studying GNN in the continual graph learning (CGL) setting. We propose the first continual graph learning benchmark for spatio-temporal graphs and use it to benchmark well-known CGL methods in this novel setting. The benchmark is based on the N-UCLA and NTU-RGB+D datasets for skeleton-based action recognition. Beyond benchmarking for standard performance metrics, we study the class and task-order sensitivity of CGL methods, i.e., the impact of learning order on each class/task's performance, and the architectural sensitivity of CGL methods with backbone GNN at various widths and depths. We reveal that task-order robust methods can still be class-order sensitive and observe results that contradict previous empirical observations on architectural sensitivity in CL.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{wei2024benchmarking,
  title  = {Benchmarking Sensitivity of Continual Graph Learning for Skeleton-Based Action Recognition},
  author = {Wei Wei and Tom De Schepper and Kevin Mets},
  year   = {2024},
  eprint = {2401.18054},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.18054v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.18054.svg)](https://codeofpaper.com/paper/2401.18054)

Discussion