Pith. sign in

REVIEW 4 cited by

HYperbolic Self-Paced Learning for Self-Supervised Skeleton-based Action Representations

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 2303.06242 v1 pith:ITNTWRCB submitted 2023-03-10 cs.CV cs.AIcs.LG

classification cs.CVcs.AIcs.LG
keywords learninghyperbolichysptrainingactionself-pacedskeleton-basedavailable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Self-paced learning has been beneficial for tasks where some initial knowledge is available, such as weakly supervised learning and domain adaptation, to select and order the training sample sequence, from easy to complex. However its applicability remains unexplored in unsupervised learning, whereby the knowledge of the task matures during training. We propose a novel HYperbolic Self-Paced model (HYSP) for learning skeleton-based action representations. HYSP adopts self-supervision: it uses data augmentations to generate two views of the same sample, and it learns by matching one (named online) to the other (the target). We propose to use hyperbolic uncertainty to determine the algorithmic learning pace, under the assumption that less uncertain samples should be more strongly driving the training, with a larger weight and pace. Hyperbolic uncertainty is a by-product of the adopted hyperbolic neural networks, it matures during training and it comes with no extra cost, compared to the established Euclidean SSL framework counterparts. When tested on three established skeleton-based action recognition datasets, HYSP outperforms the state-of-the-art on PKU-MMD I, as well as on 2 out of 3 downstream tasks on NTU-60 and NTU-120. Additionally, HYSP only uses positive pairs and bypasses therefore the complex and computationally-demanding mining procedures required for the negatives in contrastive techniques. Code is available at https://github.com/paolomandica/HYSP.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Less is More: Compact-Token Masked Feature Prediction for Skeleton Representation Learning

    cs.CV 2026-03 conditional novelty 6.0 of 10

    A decoder-free teacher-student masked feature predictor with semantic tube masking and skeleton-aware augmentations reaches state-of-the-art accuracy on NTU-60/120 and PKU-MMD II using a compact 8x25 token grid.

  2. Towards Efficient General Feature Prediction in Masked Skeleton Modeling

    cs.CV 2025-09 conditional novelty 6.0 of 10

    GFP predicts hierarchical high-level features from a jointly trained lightweight target network instead of reconstructing joint coordinates, speeding up masked skeleton pretraining 6.2x while improving downstream accuracy.

  3. Learning Along the Arrow of Time: Hyperbolic Geometry for Backward-Compatible Representation Learning

    cs.LG 2025-06 conditional novelty 6.0 of 10

    HBCT lifts embeddings into Lorentz hyperbolic space, uses entailment cones to keep new embeddings inside old ones' cones, and weights contrastive alignment by an uncertainty estimate, improving backward-compatible ret...

  4. 3D Skeleton-Based Action Recognition: A Review

    cs.CV 2025-06 reject novelty 3.0 of 10

    A task-oriented review of skeleton-based action recognition that reorganizes known methods along a data processing pipeline and contains no new experimental result.

Pith tools