- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a way to use MMA as a loss function and apply it for conditioning VAEs with topological features at spatially predefined positions. Its core contribution lies in making MMA for multi-dimensional persistence work for gradient-based optimization and proposing a second filtration parameter encoding proximity to the prescribed location.
Critical strengths
- Making MMAs fit for gradient-based training and using them as loss functions is novel and an interesting research direction
- Using 2-dimensional filtrations for encoding intensity and proximity of individual features to a target for solving the spatial awareness problem when no ground truth is available is a novel and suitable approach
- The math seems to be sound, although my expertise in multi-parameter persistence is limited
Critical weaknesses
The critical weaknesses are threefold.
First, the motivation for spatially-aware and topologically correct mask generation is unclear to me. The presented use case seems constructed, and the used dataset is synthetic. The binary mask generation is already so restricted (by feature type and location) that a VAE might not be necessary anymore, and the mask can simply be generated deterministically, e.g., as in how the synthetic dataset itself was created. Furthermore, the paper uses artificially small networks to demonstrate the effectiveness of its solution, since larger networks can solve the task inherently (see line 365). I would like to see use cases where the paper's approach is actually the best solution.
Second, the experimental evidence is weak. One aspect of this weakness relates to the first point: only a single synthetic dataset is used. Furthermore, no significance test is reported, and standard deviations are heavily overlapping. The most important baseline, Scoccola et al., is mentioned but neither experimentally nor theoretically compared to the presented method. Other important baselines could include Oner et al. or Stucki et al.'s Betti Matching.
Third, the presentation is poor and the paper is hard to follow. Especially the intro lacks a clear storyline and jumps between seemingly unrelated concepts. Some statements are vague or unsupported. For example, line 73 states that some related work is "preliminary" without explaining what that means or why it is preliminary. Line 56 mentions that some theoretical aspect is "more involved". Line 68 mentions some challenges (that the paper potentially solves), but it does not explicitly mention what they are. In general, I believe the paper should be rewritten with a strong focus on clarity and cohesion. I can recommend following the principles from "Style: Lessons in Clarity and Grace" by Joseph Williams.
Questions for authors
- Please provide statistical significance tests for your results
- Please include a runtime analysis of your approach that includes the number of lines and the patch size and comparisons to other methods
- Please compare your approach theoretically and experimentally to the approach in Scoccola et al.
- How exactly is the 1PH baseline defined?
- Please justify the relevance of your approach with realistic use-cases
- In the abstract, intro, and related work, the spatial awareness problem of TDA is described generally, although non-generative tasks can solve this problem principled and efficiently via induced matchings. Please narrow down your framing throughout the paper and mention this line of work.
- Your citations seem incorrect; potentially, you used citet instead of citep?
3 comments
General: I thank the authors for their response, which addresses some of my concerns. I appreciate the work's theoretical aspect, and I can imagine useful applications. However, I'm not convinced that the paper's setting is such an application. My main hesitation in increasing my score is the method's (and the paper's entire setting's) usefulness. My main two questions are: (1) Why do I need a model that can create masks with a predefined topology and location of topological features? Can SOTA image generation models still not solve this task? Maybe you could include tests on a real downstream task. (2) Under the assumption that I need the output of such models, would it not be much easier to use alternatives (existing methods that can be applied in this setting, see below; or a deterministic algorithm, such as the one used for creating the synthetic dataset)? The authors would need to (empirically) demonstrate the benefit of their method over alternative approaches in real-world settings and/or in a downstream task. Also, please upload the updated manuscript. Other points below.
Scoccola et al.: Having this as a baseline is a necessary improvement, but not yet sufficient to provide solid empirical evidence of the approach's usefulness. However, please also provide a detailed description of the specific design, as this will probably determine if it is a strong or weak baseline. Specifically, please specify exactly how the target measure is defined, where the masses are placed, and with what signs. Also report the tuning framework for the baseline.
Oner et al. and Betti Matching: It is true that both are segmentation losses, but they can be applied almost directly to your setting, and both aim to solve the same problem of spatial correspondence among topological features. You train in a reconstruction setting with ground-truth masks, to which both methods apply.
Runtime: Please report it here and put it in the updated manuscript. Also compare to new baselines. Include the number of lines and the patch sizes.
Updated results and answers to the follow-up
Revised paper. We have uploaded the revised paper. Table 1 now compares MMA with 1PH, windowed 1PH, Betti matching and the ablation, on reruns in which MMA and the loss are computed on the perturbed bifiltration. Paired two-sided Wilcoxon signed-rank tests show that MMA improves on 1PH and windowed 1PH for (), and on Betti matching and the ablation at every (Appendix F).
Usefulness of the setting. For geometric masks such as those of our benchmark, the reviewer is right: a deterministic algorithm can produce them. For more complex images, such as the animals of Gupta et al. (2025), no simple deterministic algorithm exists, to the best of our knowledge. This is the use case we target, and our loss applies to it unchanged, exactly as it applies to the masks generated here.
Scoccola et al. We built the baseline with the loss of Scoccola et al., the optimal-transport distance to a fixed target measure (their Example 3.22), on the Hilbert decomposition signed measure of the same bifiltrations as MMA. For each object, the target is a unit positive mass at the lower corner of the box in degree 0. In degree 1, the target of a hollow object is the signed measure of the box, with positive masses at the lower and upper corners and negative masses at the other two, and the target of a filled object is the zero measure. The outside term has a unit mass at the upper corner. We reused the coefficients and the schedule of MMA, without a separate tuning. The mean score of this baseline lies between 0.96 and 1.00 at every object count. This is the difficulty raised in our first response: the points of the signed measure do not correspond to single topological features, so designing a loss that prescribes one feature at each location is not straightforward, and we did not find a satisfactory one in the time of the rebuttal.
Oner et al. and Betti matching. Following the reviewer's suggestion, Betti matching is now a baseline in Table 1. It needs the ground-truth mask, so it acts on the posterior term only, and its scores (0.45 to 0.69) lie well above those of MMA, mainly through spurious features and features of the wrong degree. We did not run Oner et al.
Runtime. Appendix E reports the time per optimization step on one H100 GPU with 32 CPU cores, batch size 16 and images: 13.8 ms without topological loss, 61.6 ms with 1PH and 3.64 s with MMA. The MMA loss uses lines on the full grid, with no patch: it computes one bifiltration per object plus one for the outside term, on 4 of the 16 images of each minibatch, so its cost grows with the number of objects. 1PH runs on all 16 images at resolution .
Response to Reviewer 1ghd
Use cases and motivation. We thank the reviewer for the detailed review. The use cases we envision are those of Gupta et al. (2025), such as an image with an exact number of animals or an aerial view of a road network with an exact number of regions, where our loss additionally prescribes where each object or region lies. The reviewer is right that our experiments use a single synthetic dataset. The method applies unchanged to other shapes and datasets: only the masks and the spatial profiles change. We are generating images from the masks of our models with ControlNet, as in Fig. 1, and we will report them in this thread.
The sentence at the opening of Sec. 4 on the U-Net diffusion model of Gupta et al. (2025) is too general, and we will rewrite it. We designed the conditioning of this paper so that the topological losses and the metrics that evaluate them are easy to define and interpret, for MMA and single-parameter PH alike: it prescribes the position, the type and the number of the objects through one spatial profile per object. This conditioning is so informative that the U-Net solves the task without topological supervision. With a less informative conditioning, such as the number of objects of each type and their coarse position in the image (e.g., top right), the U-Net produces masks whose topology does not match the prescribed one, and we can provide these results on request. The CVAE fails already under the informative conditioning, so this setting measures the contribution of the topological loss where the loss and the metric are easiest to define and interpret, which in our view makes it the right setting for a first application of MMA-based losses.
Significance. We have implemented a paired Wilcoxon signed-rank test between MMA and 1PH on the same 100 test images for each object count N. On the submitted runs, the difference is significant for N=2,…,8 (p≤0.012), and not significant for N=1 (p=0.06), N=9 (p=0.12) and N=10 (p=0.82). The standard deviations of Table 1 measure how much the score varies from one test image to another, and all models are evaluated on the same images, so the paired test is the appropriate comparison. We will add these tests to the revised paper.
Scoccola et al. We are training the CVAE with a loss on the Hilbert decomposition signed measure of Scoccola et al. in place of MMA, on the same bifiltrations, and we will report the results in this thread. The signed measure and MMA are different descriptors, and MMA is the more global of the two. With MMA every term of our loss has a direct interpretation: each summand is one topological feature, so the loss rewards the largest summand in each degree and penalizes the others. On the signed measure, the same loss raises three problems.
Oner et al. and Betti Matching. Both are segmentation losses that compare the prediction with a ground-truth mask, while our loss also supervises samples from the prior, which have none. We will discuss both in the related work.
Runtime. We are implementing a runtime analysis of the topological losses on our cluster, and we will report it in this thread. Preliminary results confirm that training with MMA takes longer than with 1PH, which in turn takes longer than training without topological term.
The 1PH baseline. It uses the same CVAE, losses and coefficients as MMA (Table 2), with a one-parameter persistence loss in the style of Gupta et al. (2025) whose target is the pair of Betti numbers of the ground-truth mask. We will describe it in Appendix E.
Framing and presentation. We will restrict the framing to generative models, cite the work on induced matchings (Bauer and Lesnick, 2015; Stucki et al., 2023), rewrite the introduction around a single line of argument, make lines 56, 68 and 73 precise, and correct the citation commands.