Label-Efficient Skeleton-based Recognition with Stable-Invertible Graph Convolutional Networks

• URL: http://arxiv.org/abs/2511.17345v1
• Date: Fri, 21 Nov 2025 16:06:53 GMT
• Title: Label-Efficient Skeleton-based Recognition with Stable-Invertible Graph Convolutional Networks
• Authors: Hichem Sahbi,
• Abstract summary: This paper devises a novel, label-efficient method for skeleton-based action recognition using graph convolutional networks (GCNs)<n>The contribution of the proposed method resides in learning a novel acquisition function -- scoring the most informative subsets for labeling.<n>We also extend this approach by learning the most informative subsets using an invertible GCN which allows mapping data from ambient to latent spaces.
• Score: 14.061680807550722
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Skeleton-based action recognition is a hotspot in image processing. A key challenge of this task lies in its dependence on large, manually labeled datasets whose acquisition is costly and time-consuming. This paper devises a novel, label-efficient method for skeleton-based action recognition using graph convolutional networks (GCNs). The contribution of the proposed method resides in learning a novel acquisition function -- scoring the most informative subsets for labeling -- as the optimum of an objective function mixing data representativity, diversity and uncertainty. We also extend this approach by learning the most informative subsets using an invertible GCN which allows mapping data from ambient to latent spaces where the inherent distribution of the data is more easily captured. Extensive experiments, conducted on two challenging skeleton-based recognition datasets, show the effectiveness and the outperformance of our label-frugal GCNs against the related work.

Related papers

• Active Learning for GCN-based Action Recognition [14.061680807550722]
  We propose a novel label-efficient graph convolutional network (GCN) model.<n>We develop a novel acquisition function that employs an adversarial strategy to identify a compact set of informative exemplars for labeling.<n>These enhanced networks facilitate a more effective mapping between the ambient and latent data spaces.
  arXiv  Detail & Related papers  (2025-11-26T17:51:59Z)
• Web-Scale Visual Entity Recognition: An LLM-Driven Data Approach [56.55633052479446]
  Web-scale visual entity recognition presents significant challenges due to the lack of clean, large-scale training data. We propose a novel methodology to curate such a dataset, leveraging a multimodal large language model (LLM) for label verification, metadata generation, and rationale explanation. Experiments demonstrate that models trained on this automatically curated data achieve state-of-the-art performance on web-scale visual entity recognition tasks.
  arXiv  Detail & Related papers  (2024-10-31T06:55:24Z)
• Auxiliary Tasks Enhanced Dual-affinity Learning for Weakly Supervised Semantic Segmentation [79.05949524349005]
  We propose AuxSegNet+, a weakly supervised auxiliary learning framework to explore the rich information from saliency maps. We also propose a cross-task affinity learning mechanism to learn pixel-level affinities from the saliency and segmentation feature maps.
  arXiv  Detail & Related papers  (2024-03-02T10:03:21Z)
• A Self Supervised StyleGAN for Image Annotation and Classification with Extremely Limited Labels [35.43549147657739]
  We propose SS-StyleGAN, a self-supervised approach for image annotation and classification suitable for extremely small annotated datasets. We show that the proposed method attains strong classification results using small labeled datasets of sizes 50 and even 10.
  arXiv  Detail & Related papers  (2023-12-26T09:46:50Z)
• Pseudo Label-Guided Data Fusion and Output Consistency for Semi-Supervised Medical Image Segmentation [9.93871075239635]
  We propose the PLGDF framework, which builds upon the mean teacher network for segmenting medical images with less annotation. We propose a novel pseudo-label utilization scheme, which combines labeled and unlabeled data to augment the dataset effectively. Our framework yields superior performance compared to six state-of-the-art semi-supervised learning methods.
  arXiv  Detail & Related papers  (2023-11-17T06:36:43Z)
• CONVERT:Contrastive Graph Clustering with Reliable Augmentation [110.46658439733106]
  We propose a novel CONtrastiVe Graph ClustEring network with Reliable AugmenTation (CONVERT) In our method, the data augmentations are processed by the proposed reversible perturb-recover network. To further guarantee the reliability of semantics, a novel semantic loss is presented to constrain the network.
  arXiv  Detail & Related papers  (2023-08-17T13:07:09Z)
• Learning ECG Signal Features Without Backpropagation Using Linear Laws [1.1399577852929503]
  This paper introduces LLT-ECG, a novel method for electrocardiogram (ECG) signal classification.<n>Unlike traditional deep learning approaches, LLT-ECG operates in a forward manner, eliminating the need for backpropagation.<n>We demonstrate LLT-ECG's state-of-the-art performance on real-world ECG datasets from PhysioNet.
  arXiv  Detail & Related papers  (2023-07-04T21:35:49Z)
• SMARTQUERY: An Active Learning Framework for Graph Neural Networks through Hybrid Uncertainty Reduction [25.77052028238513]
  We propose a framework to learn a graph neural network with very few labeled nodes using a hybrid uncertainty reduction function. We demonstrate the competitive performance of our method against state-of-the-arts on very few labeled data.
  arXiv  Detail & Related papers  (2022-12-02T20:49:38Z)
• Adaptive Local-Component-aware Graph Convolutional Network for One-shot Skeleton-based Action Recognition [54.23513799338309]
  We present an Adaptive Local-Component-aware Graph Convolutional Network for skeleton-based action recognition. Our method provides a stronger representation than the global embedding and helps our model reach state-of-the-art.
  arXiv  Detail & Related papers  (2022-09-21T02:33:07Z)
• Clustering augmented Self-Supervised Learning: Anapplication to Land Cover Mapping [10.720852987343896]
  We introduce a new method for land cover mapping by using a clustering based pretext task for self-supervised learning. We demonstrate the effectiveness of the method on two societally relevant applications.
  arXiv  Detail & Related papers  (2021-08-16T19:35:43Z)
• Leveraging Auxiliary Tasks with Affinity Learning for Weakly Supervised Semantic Segmentation [88.49669148290306]
  We propose a novel weakly supervised multi-task framework called AuxSegNet to leverage saliency detection and multi-label image classification as auxiliary tasks. Inspired by their similar structured semantics, we also propose to learn a cross-task global pixel-level affinity map from the saliency and segmentation representations. The learned cross-task affinity can be used to refine saliency predictions and propagate CAM maps to provide improved pseudo labels for both tasks.
  arXiv  Detail & Related papers  (2021-07-25T11:39:58Z)
• Mining Implicit Entity Preference from User-Item Interaction Data for Knowledge Graph Completion via Adversarial Learning [82.46332224556257]
  We propose a novel adversarial learning approach by leveraging user interaction data for the Knowledge Graph Completion task. Our generator is isolated from user interaction data, and serves to improve the performance of the discriminator. To discover implicit entity preference of users, we design an elaborate collaborative learning algorithms based on graph neural networks.
  arXiv  Detail & Related papers  (2020-03-28T05:47:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.