mlsanityData to 7 Oct 2026

Improving 3D Semi-supervised Learning by Effectively Utilizing All Unlabelled Data

arXiv 2409.13977 ↗First posted 21 Sep 2024cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Semi-supervised learning (SSL) has shown its effectiveness in learning effective 3D representation from a small amount of labelled data while utilizing large unlabelled data. Traditional semi-supervised approaches rely on the fundamental concept of predicting pseudo-labels for unlabelled data and incorporating them into the learning process. However, we identify that the existing methods do not fully utilize all the unlabelled samples and consequently limit their potential performance. To address this issue, we propose AllMatch, a novel SSL-based 3D classification framework that effectively utilizes all the unlabelled samples. AllMatch comprises three modules: (1) an adaptive hard augmentation module that applies relatively hard augmentations to the high-confident unlabelled samples with lower loss values, thereby enhancing the contribution of such samples, (2) an inverse learning module that further improves the utilization of unlabelled data by learning what not to learn, and (3) a contrastive learning module that ensures learning from all the samples in both supervised and unsupervised settings. Comprehensive experiments on two popular 3D datasets demonstrate a performance improvement of up to 11.2% with 1% labelled data, surpassing the SOTA by a significant margin. Furthermore, AllMatch exhibits its efficiency in effectively leveraging all the unlabelled data, demonstrated by the fact that only 10% of labelled data reaches nearly the same performance as fully-supervised learning with all labelled data. The code of our work is available at: https://github.com/snehaputul/AllMatch.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 29 references that are in the map. First posted on arXiv 21 Sep 2024.

Builds on

22 of 29 references.

References · 22

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
  3. 2020Supervised Contrastive Learningcited by 2,803
  4. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
  5. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
  6. 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,057
  7. 2020PCT: Point cloud transformercited by 730
  8. 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 537
  9. 2019Revisiting Point Cloud Classification: A New Benchmark Dataset and Classification Model on Real-World Datacited by 532
  10. 2020CoMatch: Semi-supervised Learning with Contrastive Graph Regularizationcited by 167
  11. 2021Dash: Semi-Supervised Learning with Dynamic Thresholdingcited by 147
  12. 2023SoftMatch: Addressing the Quantity-Quality Trade-off in Semi-supervised Learningcited by 133
10 more
  1. 2022SimMatch: Semi-supervised Learning with Similarity Matchingcited by 118
  2. 2021Guided Point Contrastive Learning for Semi-supervised Point Cloud Semantic Segmentationcited by 87
  3. 2023Boosting Semi-Supervised Learning by Exploiting All Unlabeled Datacited by 26
  4. 2022ConMatch: Semi-Supervised Learning with Confidence-Guided Consistency Regularizationcited by 25
  5. 2021Multimodal Semi-Supervised Learning for 3D Objectscited by 24
  6. 2022Class-Level Confidence Based 3D Semi-Supervised Learningcited by 13
  7. 2023SequenceMatch: Revisiting the design of weak-strong augmentations for Semi-supervised learningcited by 8
  8. 2021Point Discriminative Learning for Data-efficient 3D Point Cloud Analysiscited by 5
  9. 2023Enhancing Sample Utilization through Sample Adaptive Augmentation in Semi-Supervised Learningcited by 5
  10. 2023Scaling Up Semi-supervised Learning with Unconstrained Unlabelled Datacited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.