- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
Persistence diagrams as the fundamental tool of topological data analysis consist of a multiset of intervals. When summarizing a collection of such diagrams, the practitioners typically run them through vectorization techniques. They then usually use averages in the Euclidean or Hilbert spaces, and other tools to provide a common summary of a collection.
This paper adds additional structural information to this pipeline. It encodes the pairwise inclusions between the intervals in a diagram in the form of a higher order persistence diagram, and then, in principle, keeps repeating this iterative procedure to produce other higher order persistence diagrams. These are the additional derived combinatorial properties of the original persistence diagram. The paper then defines the harmonic aggregate as a tool to improve the explicit computation of some of the resulting coordinates.
In a summary, instead of vectorizing a persistence diagram, the paper proposes to derive some combinatorial properties of the diagram first and then vectorize the extended information. The paper states a stability result and reports on some experiments that indicate potential competitiveness in some settings.
Critical strengths
- The core idea of the paper is interesting, aggregating the combinatorics of inclusions of the intervals. Theorem 3.11 provides an interesting shortcut towards the computational goals.
Critical weaknesses
-
The paper could lay out the overarching story and potential contribution more clearly, especially when it comes to the positioning of the results of the experiments. Essentially, instead of vectorizing the persistence diagrams, we first compute some derived parameters, and then vectorize the extended collection of parameters. As we are not introducing any new information, the contribution could be thought of just as an extended vectorization. Since we are starting with strictly more parameters, one would expect that the experimental results would never fall below the standard only-vectorization approaches. In this light the experimental results are not exactly spectacular. And crucially, it is not clear what the running times and memory requirements are compared to the previous methods, nor what the attributes in the use of the other vectorization techniques are. It seems plausible that by simply increasing the stated attributes of the other vectorizations performs better than the proposed method.
-
Theoretical setup is vague and contains many errors and undeclared settings, the presentation is sparse on some crucial details, etc. The Stability Theorem 3.12 reads as very strong, but seems to come with many hidden caveats, so its strength is not really apparent.
Questions for authors
Questions:
In lines 86-78 it is stated that the same intervals have the same interpretation. Could you explain what is meant by that? In the real world datasets each interval has a representative and those are different. There is a paper [DOI: 10.4230/LIPIcs.SoCG.2026.94] that actually studies the relationship between the barcodes by comparing different intervals even topologically, not just at the level of isolated summaries. In this sense, the mentioned paper is strictly stronger. The same goes for lines 142-145.
Theorem 3.12: What are actually the assumptions here? If the space is supposed to be uniformly discrete (hence have a bounded number of intervals), then this does not imply stability when mapping from the pointsets (in the Gromov-Hausdorff metric) via the Vietoris-Rips or Cech filtrations to the summary, as the number of the intervals can increase. What is more, if uniformly discrete means that no intervals should be within , as lines 259-260 suggest, then the result is even weaker. This is a serious constraint and should be pointed out clearly.
Comments:
From 152 on it is not clear whether is a metric space or a space of intervals. Different notation is used. What is the order on the intervals?
Definition 3.2: It is not clear where the stated notions are defined. in 1., should be . Later, is undefined.
Lines 184-187: Use of and .
Figure 2, Figure 3: The right part is incomprehensible.
Lines 218-219: What is a persistence diagram space?
2 comments
Response to Reviewer 5YZ3 (2/2)
Comment 1: The paper states, "Assume that is a metric space with a preorder ," and then says, "We call an element of an order- interval." These statements concern different levels of the construction. Item 2 of Definition 3.2 gives the order explicitly: if and only if and .
Comment 2: The condition in item 1 is correct. The first clause defines , and the recursive clause at defines . Changing the condition to would leave undefined. The paragraph immediately before Definition 3.2 defines : "Fix ."
Comment 3: The two notations have different meanings. removes the diagonal. collapses it to a single point. The first is the domain of the restricted metric in Lemma 3.4. The second retains the point used for matching intervals to the diagonal.
Comment 4: In the right panel of Figure 2, the two patterned regions represent order-two intervals that share one order-one interval. Their pair uses three distinct order-one intervals, as the caption states. The caption of Figure 3 identifies the pins as order-one persistence intervals, their heights as signed multiplicities, and the yellow surfaces as higher-order persistence intervals.
Comment 5: Immediately before Definition 3.3, the paper states, "Persistence diagrams are finite multisets of persistence intervals." Definition 3.3 then states, "For , define the order- persistence diagram monoid by ." In the passage under discussion, the paper has already specified the corresponding virtual diagram space: "For each , let denote the corresponding order- virtual persistence diagram group."
Response to Reviewer 5YZ3 (1/2)
The review treats Vietoris-Rips and Cˇech filtrations of point clouds as the setting of our theory. Our setting is more general. A filtration of an abstract simplicial complex need not come from a point cloud, an embedding, or a real-valued threshold. Persistence diagrams are formal sums on metric pairs, of which the real birth-death half-plane with its diagonal is just one example. The 2022 paper Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces is one example of this broader literature. Many applications naturally give uniformly discrete spaces of persistence intervals, including cubical filtrations of digital mammograms by grayscale intensity and of lung tumor CT volumes by voxel Hounsfield values. Our benchmarks already demonstrate uniformly discrete filtrations on network datasets, from random network models to molecular graphs. The analytic consequences of uniform discreteness remain largely unstudied. Standard persistence diagram analyses almost never use the positive minimum separation between intervals, even when it holds naturally in the application domain. The observation that we take advantage of is that when the space of persistence intervals is uniformly discrete, the group of virtual persistence diagrams is discrete and locally compact in the topology given by the 1-Wasserstein distance. This lets us use Fourier analysis for our "Harmonic Aggregation". The theoretical results are stated for a broad class of metric spaces and preorders because different applications use different filtrations. The experiments use filtrations which give uniformly discrete metric spaces of persistence intervals. The review alleges "many errors and undeclared settings," but it does not identify an error in the stated theory. The second question asks for a theorem about point clouds, which are not the setting of this paper.
Question 1: The review states, "In lines 86-78 it is stated that the same intervals have the same interpretation." The point is when the features appear and disappear, not which cycles represent them. Equal intervals mean the features appear and disappear at the same filtration values. If one interval lies inside another, the first feature is present only when the second is also present. That is the implication we use to define higher-order persistence diagrams.
The review calls mixup barcodes "strictly stronger." Stronger than what? A mixup barcode describes what happens to homology classes under a specified inclusion of filtrations. We use the metric on persistence intervals to study the topology of the space of persistence diagrams and compute relations among intervals from the diagrams alone. The constructions have different inputs and answer different questions. The filtrations in a bag need not come with inclusions between them. If "strictly stronger" just means using information discarded by a persistence diagram, then keeping the original data is strictly stronger than computing persistent homology at all. That is not a comparison of the two methods, and it does not address what our construction recovers from persistence diagrams alone.
Question 2: Theorem 3.12 assumes that the order-one space of persistence intervals is uniformly discrete after collapsing the diagonal. The filtrations in our experiments satisfy this assumption.
Uniform discreteness does not bound the number of intervals. For example, let the filtration levels be the integers; then the birth-death pairs (b,d) with b<d lie in Z2. With the ℓ1 metric, distinct pairs are at least 1 apart, and each pair is at least 1 from the diagonal. The quotient therefore has minimum distance 1 and is thus uniformly discrete. Even just the pairs (k,k+1) give infinitely many possible persistence intervals. The claim that "if the space is supposed to be uniformly discrete, [then it has] a bounded number of intervals" is just false.
The assumption of uniform discreteness holds naturally in several applications. For example, an 8-bit grayscale cubical filtration has only 256 possible intensity levels, so there are even finitely many possible finite birth-death pairs across all images on that scale. Our network benchmarks also use discrete filtration levels, given by edge-entry ranks for random networks and trussness-based entry levels for TU graphs. The full real birth-death half-plane in the reviewer's point-cloud example is not uniformly discrete. The spaces of persistence intervals in our experiments are.