- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a CPDM method for distilling 3D point cloud datasets. Building upon channel-level distribution matching, the method introduces a shared point ordering mechanism to preserve cross-channel feature correlations. Synthetic point clouds are optimized by leveraging pre-trained expert features and auxiliary classification supervision. Experiments cover five classification datasets, various compression budgets, and cross-architecture evaluations.
Critical strengths
- Clear research motivation: Independent per-channel ranking may discard correlations within individual point feature vectors, whereas the proposed shared ranking directly addresses this issue.
- The reported results are encouraging, and component ablation experiments help distinguish the respective contributions of shared ranking, expert features, and classification supervision.
Critical weaknesses
- Theoretical analysis demonstrates information retention under various scoring conditions but does not verify the stability of the matched representations. Minor feature perturbations may alter point rankings, and the practical implications of these discontinuities have not been fully investigated.
- There is currently no quantitative description of the computational cost of the complete distillation process. We recommend reporting the actual time taken for both the offline expert preparation and the distillation process separately, and comparing these with SADM under identical hardware and representative settings to assess the trade-off between accuracy and computational cost. The paper has reported the mean and standard deviation of 10 independent initialisations for evaluating the network; please clarify further whether these repetitions also included independent distillation processes.
- This paper primarily employs PointNet for distillation, and the cross-architecture evaluation focuses mainly on earlier models; consequently, its practical value when applied to more powerful backbones or pre-training setups remains unclear. It is recommended to compare it with existing distillation methods on newer backbones, such as PointNext, using the same compression budget, and to report the extent of performance retention when trained on relatively comprehensive datasets. If supplementary experiments cannot be provided at this stage, please explain, based on existing theory and experiments, why the issues identified have general relevance beyond these specific architectures, and what substantive new insights this paper offers compared to existing distribution-matching methods. A convincing explanation would also assist me in reassessing the paper’s contributions.
- The figures in the paper require improvement, particularly Figure 2.
Questions for authors
-
The counterexample to this theory involves arbitrary feature matrices. Is it possible that the features from independent permutations in this counterexample actually originate from the same ‘frozen’ extractor processing the same point cloud? Is there any evidence to suggest that SADM’s additional invariance leads to ambiguity between point cloud features?
-
Preserving information does not necessarily yield useful matching distances. When the scores of two points are nearly equal but their feature vectors differ significantly, even a very small perturbation can cause their rankings to swap and result in a drastic change in the Gaussian kernel distance. How frequently does this occur? Why is the resulting distance suitable for distribution matching?
-
The recognisability argument appears to apply to any deterministic reordering that results in different scores (such as permutations). Specifically, what justification is there for claiming that the proposed average response score is superior to simpler shared ordering rules? Can its advantages be distinguished from the general benefits of retaining complete point feature vectors?