- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper establishes quadratic degree bounds for separating 3D point clouds using invariant polynomials. It derives explicit completeness conditions for TFN and a modified MACE architecture, together with local-neighborhood guarantees and counterexamples.
Critical strengths
The paper makes a meaningful theoretical contribution by turning qualitative completeness results into explicit bounds. The matching quadratic scaling of the polynomial bounds is particularly valuable. The local counterexamples also offer useful insights into the limitations of low-order geometric representations.
Critical weaknesses
-
Practical interpretation. The sufficient representation orders are very large, and the associated channel requirements and computational costs remain unclear. Could the authors explain what practical architecture-design insights follow from these results?
-
Scope of applicability. The local guarantees require strong regularity assumptions, and the MACE analysis uses a modified architecture. Could the authors more clearly discuss applicability to standard implementations and to noisy or approximately symmetric point clouds?
Questions for authors
Please refer to the Weakness.
2 comments
The authors’ response has addressed my concerns, and I therefore maintain my weak accept rating.
Thank you for your thoughtful and positive review! Our responses to your questions are given below. Changes in the revised manuscript are colored blue for your convenience.
Response. We agree that the upper bounds are far from practical settings and are not intended as hyperparameter recommendations. They do replace the existence statements in the literature with explicit bounds, and they show that quadratic growth is unavoidable for polynomial invariants (Theorem 1).
Moreover, Proposition 12 does give a meaningful lower bound for MACE expressivity in a realistic parameter range: for example, as mentioned in the text, for MACE with ℓmax=νmax=3, completeness provably fails on locally regular clouds once the neighbourhood contains K≥11 (T=1), K≥39 (T=2) or K≥119 (T=3) points. The expression ℓmax∑t=1Tνmaxt in Proposition 12 can give intuition for the tradeoff in expressivity that different hyperparameters provide: specifically, while the bound depends linearly on the irreducible order ℓmax, increasing the depth T and correlation order νmax has a significantly more substantial impact.
Response. Regarding MACE modification: originally, we had three results regarding (modified) MACE in the paper. After reconsidering the arguments, we see that the third result holds for the standard MACE as well, while the first two needed this modification, but they do hold for ACE, without modification! Accordingly, in the revised manuscript, the first two results, Proposition 8 / Corollary 9 and Theorem 11 (completeness of global and local ACE) are now stated and proved for (unmodified) ACE, and Proposition 12 (incompleteness of local MACE) is now stated for both ACE and (unmodified) MACE. We believe this increase the attractiveness of the results in the paper and thank you for bringing up this point.
Regarding symmetries and noise: symmetric point clouds are not strongly regular, so Theorem 11 does not apply to them. However, symmetric point clouds can be regular, and so Proposition 12, our lower bound on the degrees needed for completeness on regular clouds, is relevant. All our other results apply globally to all point clouds, and in particular to symmetric ones. Noisy or perturbed point clouds, by contrast, are generically strongly regular, since strong regularity fails only on a measure-zero set, so Theorem 11 applies to them. We note, however, that completeness is a qualitative property: our results give no quantitative stability guarantee for clouds that are close to symmetric configurations.
Conclusion Please let us know if you have any more questions. If our responses have addressed your concerns, please consider raising our score.