- Rating
- 2
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the minimum worst-case support required for continuous equivariant weighted frame averaging, establishing bounds for labeled, full-rank inputs in a fixed spatial dimension and providing an explicit construction.
Critical strengths
The paper asks a very natural question, how many frames do we actually need for continuous equivariant frame averaging? This is an important problem in this area. I really appreciate the effort on the theory, the analysis looks solid and detailed. I also like the moving-boundary experiment. They keep the prediction branches fixed and only move the selection boundary, so we can see more clearly where the discontinuity comes from, rather than just comparing overall prediction errors.
Critical weaknesses
(i) The introduction gives very little background, I feel it assumes the reader already knows this subfield quite well. It jumps almost straight from frame averaging to probability measures and topological arguments. For someone without that background, it's quite hard to even get into the paper.
(ii) Correct me if I'm wrong, Appendix A.3 gets a linear lower bound from Dold’s theorem, and Appendix A.5 says the Wronskian coverage principle is already known. So I'm curious, how much of the result can we get by putting these existing results together? The sharper bounds and regularity analysis may bring something new, but I'd like the authors to explain this a bit more in the rebuttal.
(iii) The writing is not very easy to follow. There are a lot of definitions, formulas and symbols, one after another, but not much explanation of what they mean or what they tell us in practice. Some geometric intuition and a simple illustration of the construction would help, also a bit more explanation of how to interpret the main results.
(iv) Finally, I'm still not quite sure what this result changes for geometric deep learning in practice. The construction needs labeled, full-rank inputs, and it doesn't guarantee permutation equivariance. Also, having linearly many frames doesn't mean the runtime is linear. I'd like to see a few concrete examples here, which applications would benefit from this, and when would using fewer frames actually make the method cheaper to run?
Questions for authors
See weakness
Thank you for your helpful review. We have revised the manuscript accordingly.
(ii) What is new. Both the lower and the upper bounds are new. The known tools you identify are ingredients that had not been used in this context before. The contribution is connecting them to weighted frames.
Linear lower bounds. Dold's theorem gives a bound of ~n/(d(d − 1)/2 + 1). Building on Knudsen–Weinberger, Theorem 3 identifies the minimum number of frames with a sectional category, and characteristic classes of Grassmannians give constant 1/2, and 1 for even d. These bounds answer the question of Dym et al. (ICML 2024) and apply to their frames (Corollary 5).
A linear upper bound, explicitly. Wronskians can be adapted to give d(n − d) + 1 fixed linear probes (Theorem 6). Theorem 2 weights each probe's frame by det(AP_j)^{2k}, giving C^{2k−1} predictions, which is sharp. For fixed d ≥ 3 this improves order n^{d−1} of Dym et al. to linear: 61 frames at 24 particles against 1,012 for Dym et al.
Planar case: exactly n − 1 (Corollary 4).
(i) and (iii) Background and intuition. Thanks for these comments. We have entirely rewritten the abstract and introduction. The introduction now proceeds in steps with minimal notation, defines each term at first use, and includes a planar example of a jump and Figure 1. We believe this is much more accessible to a broader audience.
(iv) Practice.
Scope: full-rank inputs are the generic case and are fully covered. The lower bounds hold on perfectly conditioned inputs and for permutation-invariant frames. Appendix A.10 treats fixed lower rank, and Section 8 lists the open extensions.
Runtime: scoring and forming frames costs O(mnd^2 + md^3). At 24 particles, full averaging over our 61 frames had 4.1 and 10.3 times lower median latency than the 1,012 frames of Dym et al. at batch sizes 1 and 32 (Section 6, Table 13). Fewer frames matter most when network evaluations dominate, for example with large networks or limited memory.
Examples: force models for a fixed molecule (Appendix B.11), motion-capture markers, labeled robot keypoints.
Experiments: a network trained with one frame per input and then averaged over our frames without retraining has 48.2% lower force NRMSE than a frame-free Gram baseline at comparable training time (24 particles, Section 7.4). The moving-boundary experiment confirms that single-frame predictions jump at frame switches and averaging removes the jumps.
Thank you again for your feedback.