paper-with-me

홈 › Papers

APML: Adaptive Probabilistic Matching Loss for Robust 3D Point Cloud Reconstruction

2025-09-09 · Sasan Sharifipour, Constantino Álvarez Casado, Mohammad Sabokrou, Miguel Bordallo López 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.

📄 PDF Abstract BibTeX arXiv:2509.08104

Code (0)

등록된 구현이 없습니다.

Tasks

Point Clouds

Similar Papers 제목 키워드 기반

From Theory to Throughput: CUDA-Optimized APML for Large-Batch 3D Learning

2025-12-17 · Sasan Sharifipour, Constantino Álvarez Casado, Manuel Lage Cañellas, Miguel Bordallo López arxiv

Loss functions are fundamental to learning accurate 3D point cloud models, yet common choices trade geometric fidelity for computational cost. Chamfer Distance is efficient but permits many-to-one correspondences, while …

Productively Deploying Emerging Models on Emerging Platforms: A Top-Down Approach for Testing and Debugging

2024-04-14 · Siyuan Feng, Jiawei Liu, Ruihang Lai, Charlie F. Ruan 외

While existing machine learning (ML) frameworks focus on established platforms, like running CUDA on server-grade GPUs, there have been growing demands to enable emerging AI applications in a broader set of scenarios, su…

Probabilistic Spatial Distribution Prior Based Attentional Keypoints Matching Network

2021-11-17 · Xiaoming Zhao, Jingmeng Liu, Xingming Wu, Weihai Chen 외

Keypoints matching is a pivotal component for many image-relevant applications such as image stitching, visual simultaneous localization and mapping (SLAM), and so on. Both handcrafted-based and recently emerged deep lea…

Graph Neural NetworkImage StitchingMotion EstimationSimultaneous Localization and Mapping

Differentiable Registration of Images and LiDAR Point Clouds with VoxelPoint-to-Pixel Matching

2023-12-07 · NeurIPS 2023 11 · Junsheng Zhou, Baorui Ma, Wenyuan Zhang, Yi Fang 외

Cross-modality registration between 2D images from cameras and 3D point clouds from LiDARs is a crucial task in computer vision and robotic. Previous methods estimate 2D-3D correspondences by matching point and pixel pat…

Triplet

SnapMLA: Efficient Long-Context MLA Decoding via Hardware-Aware FP8 Quantized Pipelining

2026-02-11 · Yifan Zhang, Zunhai Su, Shuhao Hu, Rui Yang 외 arxiv

While FP8 attention has shown substantial promise in innovations like FlashAttention-3, its integration into the decoding phase of the DeepSeek Multi-head Latent Attention (MLA) architecture presents notable challenges. …