APML: Adaptive Probabilistic Matching Loss for Robust 3D Point Cloud Reconstruction
Not on the map. Why?
Abstract (arXiv)
Training deep learning models for point cloud prediction tasks such as shape completion and generation depends critically on loss functions that measure discrepancies between predicted and ground-truth point sets. Commonly used functions such as Chamfer Distance (CD), HyperCD, and InfoCD rely on nearest-neighbor assignments, which often induce many-to-one correspondences, leading to point congestion in dense regions and poor coverage in sparse regions. These losses also involve non-differentiable operations due to index selection, which may affect gradient-based optimization. Earth Mover Distance (EMD) enforces one-to-one correspondences and captures structural similarity more effectively, but its cubic computational complexity limits its practical use. We propose the Adaptive Probabilistic Matching Loss (APML), a fully differentiable approximation of one-to-one matching that leverages Sinkhorn iterations on a temperature-scaled similarity matrix derived from pairwise distances. We analytically compute the temperature to guarantee a minimum assignment probability, eliminating manual tuning. APML achieves near-quadratic runtime, comparable to Chamfer-based losses, and avoids non-differentiable operations. When integrated into state-of-the-art architectures (PoinTr, PCN, FoldingNet) on ShapeNet benchmarks and on a spatiotemporal Transformer (CSI2PC) that generates 3D human point clouds from WiFi CSI measurements, APM loss yields faster convergence, superior spatial distribution, especially in low-density regions, and improved or on-par quantitative performance without additional hyperparameter search. The code is available at: https://github.com/apm-loss/apml.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 21 of its 39 references that are in the map. First posted on arXiv 9 Sep 2025.
Builds on
21 of 39 references.
References · 21
- 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,248
- 2017ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenescited by 3,117
- 2015ShapeNet: An Information-Rich 3D Model Repositorycited by 2,897
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
- 2016A Point Set Generation Network for 3D Object Reconstruction from a Single Imagecited by 979
- 2019Deep Learning for 3D Point Clouds: A Surveycited by 558
- 2017Learning Generative Models with Sinkhorn Divergencescited by 314
- 2021PoinTr: Diverse Point Cloud Completion with Geometry-Aware Transformerscited by 286
- 2016Shape Completion using 3D-Encoder-Predictor CNNs and Shape Synthesiscited by 219
- 2021SnowflakeNet: Point Cloud Completion by Snowflake Point Deconvolution with Skip-Transformercited by 164
- 2021Density-aware Chamfer Distance as a Comprehensive Metric for Point Cloud Completioncited by 112
9 more
- 2017Smooth and Sparse Optimal Transportcited by 83
- 2022SeedFormer: Patch Seeds based Point Cloud Completion with Upsample Transformercited by 83
- 2023MM-Fi: Multi-Modal Non-Intrusive 4D Human Dataset for Versatile Wireless Sensingcited by 79
- 2021Point-set Distances for Learning Representations of 3D Point Cloudscited by 48
- 2021Accurate Point Cloud Registration with Robust Optimal Transportcited by 38
- 2024Accelerating Sinkhorn Algorithm with Sparse Newton Iterationscited by 11
- 2023Importance Sparsification for Sinkhorn Algorithmcited by 6
- 2023Learnable Chamfer Distance for Point Cloud Reconstructioncited by 4
- 2024Fine-Grained Complexity of Earth Mover's Distance under Translationcited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.