- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper presents an extension to the Collapse Effective Operator paper. It analysis how higher order signal information such as curl and harmonic are not preserved with the collapse of the higher order connectivity to the vertex level set. Consequently it then proposes the HARP features, which retain those higher order information. In experiments it then is shown that HARP indeed recovers the curl and harmonics.
Critical strengths
-
Theoretical Correctness Every rank-shared, boundary-mediated coupling to the retained vertex space factors through . Components in therefore cannot reach that space. In Theorem 3.3, the authors show that this is valid by the construction of the operator, when folding the topology to the vertex level.
-
The experiments support the theory The matched two-dimensional baselines, including random features, train-only PCA, and non-harmonic Hodge modes, allow us to distinguish harmonic information from a generic low-dimensional embedding effect. The pair-safe synthetic protocol and the basis-ambiguity experimental results support the evaluation.
Critical weaknesses
- The authors does not clearly separate its contribution from CEO Sections 2–3.2 closely follow the CEO construction. Equation 5 is CEO’s with , while Equation 3 reproduces its regularised Schur complement with renamed blocks. The transfer map in Equation 4 is new. Theorem 3.3 specialises CEO’s Proposition 3.10 to the harmonic component and adds the finite-mass case, but the relationship is not attributed clearly. The new contribution appears to be the transfer map together with the Hodge-theoretic interpretation of the interface. Theorem 3.2 is also difficult to assess because assumption (i) already contains much of its conclusion.
In the signed setting the gradient subspace is then defined as: $ M^\downarrow_\varepsilon = \Delta_0-\gamma_1^2\Delta_0(\Delta_0+\varepsilon I)^{-1}. $ This reduced operator is therefore a graph-Laplacian filter with no contribution from cells above rank 1. Theorems 3.1 and 3.3 then follow as corollaries. At a rank-0, curl and all rank- signals, along with the harmonic component, are lost.
The authors do give a reason for emphasising harmonics: curl remains visible at the rank-1/rank-2 interface, whereas harmonic signals are annihilated by both adjacent boundaries. That distinction no longer applies once the retained space is rank 0, however, because both components lie in . The paper should make this change of perspective explicit.
CEO’s combinatorial-complex formulation, including the MANTRA experiment, replaces signed boundary matrices with binary incidence matrices. In that setting , as well as higher-order cells can affect the collapsed operator. The authors should therefore explain why the signed setting is the appropriate basis for its critique, state clearly that the same unobservability result does not carry over to the unsigned case, and, ideally, characterise what information survives there.
- The experiments instantiate the reduction only at rank 0 and omit the most important competing baseline. CEO allows any rank to be retained. Keeping edges while eliminating vertices and triangles produces an operator of the form Under CEO’s PSD condition, its kernel is exactly . The same reduction framework can expose the harmonic coordinates computed separately by HARP while also retaining curl information. An edge-level collapse, or at least a standard simplicial/Hodge filter, should be included in Tables 2–4 to demonstrate how a edge signal behaves if the operator is collapsed to the edges. Without this, the experiments establish a limitation of choosing rank 0, not of rank-shared reduction in general. Several existing baselines are also disadvantaged by construction. The “Schur-reduced” signal in Equation 19 is introduced by the authors instead of the original of CEO construction. Every backbone in Table 4 receives only , so the information HARP is designed to recover has already been removed before learning begins.
- Finally, Table 5 shows that HARP performs similarly to direct Hodge projection. Schaub et al. (2020) already applied Hodge projection to the same dataset, and the flow-completion setup follows Jia et al. (2019), although it uses a different fitting basis. The paper should position HARP directly against these methods rather than relying primarily on a vertex-level reduction that is provably unable to access the relevant signal.
Questions for authors
Q1. CEO allows the retained rank to be chosen. If the edges are retained while the vertices and triangles are eliminated, the resulting operator has the form Under CEO’s PSD condition, its kernel is . The harmonic coordinates used by HARP are therefore already present as the zero modes of this rank-1 reduction. Could the authors include this reduction, or a comparable simplicial/Hodge filter, in Tables 2–4? More generally, is the unobservability result about rank-shared reduction itself, or only about retaining rank 0?
Q2. The theory assumes signed boundary operators satisfying . CEO’s combinatorial-complex experiments, including MANTRA, use binary incidence matrices, for which and higher-rank cells can affect the vertex-level operator. What remains observable in this setting? Is there an analogue of HARP when a Hodge decomposition is no longer available?
Dear Reviewers,
Now that the authors have responded, please review what they have said and give consideration to whether they have adequately addressed your concerns.
-The AC