Open-Set Semi-Supervised Learning for 3D Point Cloud Understanding
Not on the map. Why?
Abstract (arXiv)
Semantic understanding of 3D point cloud relies on learning models with massively annotated data, which, in many cases, are expensive or difficult to collect. This has led to an emerging research interest in semi-supervised learning (SSL) for 3D point cloud. It is commonly assumed in SSL that the unlabeled data are drawn from the same distribution as that of the labeled ones; This assumption, however, rarely holds true in realistic environments. Blindly using out-of-distribution (OOD) unlabeled data could harm SSL performance. In this work, we propose to selectively utilize unlabeled data through sample weighting, so that only conducive unlabeled data would be prioritized. To estimate the weights, we adopt a bi-level optimization framework which iteratively optimizes a metaobjective on a held-out validation set and a task-objective on a training set. Faced with the instability of efficient bi-level optimizers, we further propose three regularization techniques to enhance the training stability. Extensive experiments on 3D point cloud classification and segmentation tasks verify the effectiveness of our proposed method. We also demonstrate the feasibility of a more efficient training strategy.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 30 of its 38 references that are in the map. First posted on arXiv 2 May 2022.
Builds on
30 of 38 references.
References · 30
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
- 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,384
- 2017ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenescited by 3,088
- 2015ShapeNet: An Information-Rich 3D Model Repositorycited by 2,880
- 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,220
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2020Point Transformercited by 1,462
- 2018PointCNN: Convolution On X-Transformed Pointscited by 764
- 2019Revisiting Point Cloud Classification: A New Benchmark Dataset and Classification Model on Real-World Datacited by 532
- 2018PartNet: A Large-scale Benchmark for Fine-grained and Hierarchical Part-level 3D Object Understandingcited by 521
18 more
- 2020PointContrast: Unsupervised Pre-training for 3D Point Cloud Understandingcited by 502
- 2017Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning resultscited by 470
- 2019Optimizing Millions of Hyperparameters by Implicit Differentiationcited by 303
- 2015Semi-Supervised Learning with Ladder Networkscited by 246
- 2018SO-Net: Self-Organizing Network for Point Cloud Analysiscited by 210
- 2021Walk in the Cloud: Learning Curves for Point Clouds Shape Analysiscited by 172
- 20183D Point Capsule Networkscited by 106
- 2019Unsupervised Multi-Task Feature Learning on Point Cloudscited by 89
- 2019SESS: Self-Ensembling Semi-Supervised 3D Object Detectioncited by 89
- 2020Multi-Task Curriculum Framework for Open-Set Semi-Supervised Learningcited by 82
- 2019Meta-Learning via Learned Losscited by 60
- 2021SSPC-Net: Semi-supervised Semantic 3D Point Cloud Segmentation Networkcited by 54
- 2020Not All Unlabeled Data are Equal: Learning to Weight Data in Semi-supervised Learningcited by 53
- 2020Weakly Supervised Semantic Point Cloud Segmentation:Towards 10X Fewer Labelscited by 45
- 2021OpenMatch: Open-set Consistency Regularization for Semi-supervised Learning with Outlierscited by 43
- 2020Label-Efficient Learning on Point Clouds using Approximate Convex Decompositionscited by 27
- 2021OpenCoS: Contrastive Semi-supervised Learning for Handling Open-set Unlabeled Datacited by 22
- 2020Joint Supervised and Self-Supervised Learning for 3D Real-World Challengescited by 21
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 1.
3 papers.