- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces a training-free vectorization for multiparameter persistence modules based on applying PLACE/PALACE embeddings across a fixed set of 1D slices and concatenating the resulting features. The authors derive upper and lower bounds under a coherence assumptions sinilar to one in the 1D case, and evaluate the method on point-cloud benchmarks and molecular graph datasets, where it achieves competitive or improved classification accuracy relative to several existing topological baselines.
Critical strengths
-
Competitive empirical performance with a simple, training-free representation. COMPLEX matches several topological baselines across the Orbit and molecular graph benchmarks, despite using a fixed representation followed by a standard SVM.
-
A useful theoretical characterization of when the embedding is faithful. Beyond the standard Lipschitz upper bound, the paper provides a conditional lower distortion guarantee through the witnessing-slice coherence condition. Although this condition is closely related to the existing 1D PALACE assumption, making explicit when the sliced multiparameter construction preserves separation is still useful for understanding the behavior and limitations of the method.
Critical weaknesses
-
Limited theoretical novelty of the lower bound. The main lower-distortion result appears to be obtained by selecting a slice that witnesses the multiparameter separation and then assuming the existing 1D PALACE coherence condition on that particular slice. Thus, the result seems closer to a conditional lifting of the known 1D guarantee than to a genuinely new multiparameter coherence or lower-bound mechanism. In my view, this substantially narrows the claimed theoretical novelty. Unfortunately, I do not see a substantial conceptual leap beyond the existing 1D PALACE argument, despite the paper's claim to provide the first lower-distortion guarantee for multiparameter persistence.
-
Overall novelty appears limited. Beyond the lower-bound argument discussed above, I am not convinced that the paper as a whole introduces sufficient methodological or conceptual novelty.
-
Gap between the theoretical guarantee and the empirical validation. The experimental configurations do not generally enforce the assumptions required for the lower-bound guarantee, and the paper instead relies on post-hoc coherence audits. Moreover, the classification improvements over the strongest existing baselines are relatively modest. Therefore, while the empirical results are competitive, they do not clearly demonstrate that the proposed theoretical faithfulness mechanism is responsible for the observed performance.
Questions for authors
-
The lower-distortion guarantee appears to follow by choosing a slice that witnesses the multiparameter distance and then imposing the existing 1D PALACE coherence condition on that slice. Could the authors clarify precisely what part of this argument is genuinely multiparameter and conceptually new, rather than a conditional lifting of the 1D PALACE result? This point would materially affect my assessment of the theoretical novelty.
-
The empirical improvements over the strongest baselines are generally modest, while the assumptions required for the lower-distortion guarantee are not enforced during the experiments. Could the authors provide stronger evidence that the reported gains are statistically meaningful and/or demonstrate that satisfaction of the witnessing-slice coherence condition is actually related to improved downstream performance?
4 comments
Thank you for the detailed responses and additional experiments. I appreciate the author efforts to address the concerns. The new experiments provide substantially stronger evidence for the empirical value of the multiparameter construction. Furthermore, I appreciate the authors' decision to acknowledge these limitations and revise their claims accordingly.
I also acknowledge that the witnessing-slice argument and scale cancellation introduce nontrivial technical considerations specific to the multiparameter setting. However, my main concern regarding theoretical novelty remains. Although the resulting lower-distortion statement is formulated for multiparameter persistence, its central mechanism still appears to rely on applying the existing 1D PALACE guarantee to a witnessing slice under an analogous coherence condition. I view the scale cancellation and slice selection as useful extensions, but I am not yet convinced that they constitute a sufficiently substantial conceptual advance.
Overall, the rebuttal has improved my assessment of the paper's empirical rigor and clarified its contributions. Nevertheless, I remain concerned about the degree of methodological and theoretical novelty relative to existing work. I therefore maintain my current recommendation of weak rejection.
On what Theorem 2.3 does that a one-parameter guarantee cannot
Thank you for reading the responses and for stating what moved and what did not. On the one point that remains we disagree, and we want the record to show why.
"Applying the existing 1D PALACE guarantee to a witnessing slice" is not what Theorem 2.3 does. The one-parameter guarantee certifies a bottleneck distance at a fixed scale on one barcode. Theorem 2.3 certifies the sliced matching distance, a maximum over slices of barcode distances each weighted by its slice's realized scale, for a pair of modules; it does so without knowing which slice attains the maximum, under a condition (Definition 2.4) that is existential over the family of slices at each slice's own scale; and the floor it yields, τ w_min/4, is the same for every slice. Applying the one-parameter bound at a fixed scale on each slice does not give this: it gives a floor proportional to the weight of the witnessing slice, which degrades to zero as the slice tilts. The theorem's floor does not degrade because the active-set condition is posed at the slice's realized scale τ/(4ω_s) and the weight cancels against it in the bound. That cancellation is the mechanism, not an extension of one. It is why a fixed near-diagonal net suffices, why the lower gauge is for d_matS rather than for any single barcode distance, and why no one-parameter result contains the statement.
We say in the revised contribution list, in the same breath, that the per-slice embedding is PALACE's; we reuse it deliberately as the certified primitive, and the multiparameter content is the four items of our earlier reply. The committee can weigh the same facts we have put here. We are grateful for the review; the paper is more honest for it.
Thank you for the clarification. I acknowledge that the witnessing-slice argument and scale cancellation yield a valid multiparameter extension of the existing 1D PALACE guarantee. However, the underlying mechanism still appears to follow from applying the known componentwise bound at a rescaled threshold and lifting it through the weighted concatenation. While this is a useful technical extension, I remain unconvinced that it represents a sufficiently substantial conceptual leap beyond the existing framework.
Nevertheless, I appreciate the authors' considerable efforts to address the concerns, conduct additional experiments, correct earlier results, and improve the paper's rigor and presentation. I believe the work has merit and could make a valuable contribution in a more specialized venue focused on topological data analysis. However, my overall assessment remains unchanged.
Response to Reviewer 1Xuq
Q1 (what is multiparameter and new). You are right that the per-slice step is PALACE's and we reuse it deliberately as the certified primitive. The multiparameter content is in four places, none of which exists in one parameter:
We will state (1)–(4) as the contribution list and say that the per-slice embedding is PALACE's.
Q2 (significance; coherence and performance). Significance (identical folds, 3 seeds × 10 folds, Nadeau–Bengio corrected paired test): single-bifiltration COMPLEX (91.74) vs. ECS+XGB re-run on the same bifiltration +2.50 (p = 2.7e-6), vs. HT +4.52 (p = 1e-9), vs. one-parameter PALACE +4.38 (p = 1e-10); the two- vs. one-parameter gain at α = 1.75 is +3.89 (30/30 folds, p = 7.7e-9). Against published numbers (Welch from reported mean ± s.d.) COMPLEX ties ECS (−0.06, p = 0.90), PALACE (+0.44) and Persformer (+0.54, p = 0.30) and beats Graphcode (+3.24, p < 0.01); our in-protocol ECS re-run (89.2 over 3 seeds) is 2.6 points below the published 91.8, so the revision says "ties the best published results", not "beats ECS". On graphs the multi-bifiltration configuration beats the single bifiltration on DHFR (+3.1, p = 0.03), COX2 (+3.9, p = 0.03) and NCI1 (+1.6, p = 0.006), not on MUTAG or PTC; against cited GRIL the gaps (+1.2 to +2.6) are not significant, and the revision says so.
Coherence and accuracy: we tested, for every test point, the 20 nearest cross-class training modules at the pair's own scale. The raw association runs the wrong way (incoherent pairs are more accurately classified) and is a scale confound: incoherent nearest pairs have median d_matS 1.45 vs. 0.32 for coherent ones. Coherence holds on 100% of pairs in the bottom half of cross-class separation, where the floor is the binding quantity, and fails only in the top deciles, where accuracy is 98–99% anyway. Stratified by separation decile the association vanishes (Cochran–Mantel–Haenszel p = 0.91). What does predict accuracy is the theory's own quantity: SVM accuracy rises monotonically with the nearest cross-class d_matS, from 79% in the lowest decile to 99% in the highest, at both α. So the mechanism behind the lower bound (small separation is where a floor is needed, and there it holds) is visible in the data, but we do not claim that coherence causes the accuracy gain, and the revision says the gain over the best published numbers is a tie.