- Rating
- 2
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper develops a differentiability framework for zigzag persistent homology of finite evolving simplicial complexes. It linearly interpolates filtering values, separates discrete event pairing from rational crossing times, and constructs smooth diagram lifts on regions with fixed combinatorial data (Proposition 3.6 and Corollary 3.7). For definable parameterizations, it obtains differentiability outside a parameter-space null set (Proposition 3.8), and proves local bottleneck Lipschitz continuity outside an explicit exclusion set (Theorem 3.9). It also shows why global continuity can fail. Controlled sensor-patrol and temporal-graph experiments illustrate optimizing bar lifetimes and learning a filtering function through the resulting layer. These experiments demonstrate feasibility on designed tasks; they do not establish general temporal-classification superiority or a general convergence guarantee.
Critical strengths
- A careful mathematical foundation for an implementable gradient. The event-order invariance argument, fixed-cell rational lifts, parameter-space stratification, and off-exclusion Lipschitz result fit together (pp. 4–7; Appendix C). Explicit counterexamples prevent an overbroad stability or convergence interpretation. The local-lift perspective connects naturally to the cited diagram calculus of Leygonie et al., while addressing the insertion/deletion setting.
- Experiments isolate what temporal feature identity adds. The patrol comparison holds the geometric setup fixed while changing the lifetime aggregation, and the classification controls distinguish learning a field from reading temporal pairing (pp. 8–9; Appendices D–E). The paper reports held-out seeds/splits, validation-based restart selection, and all 80 single classification runs, including 22 failures. These are meaningful feasibility checks for the theoretical construction.
The October 7 reviewer-side checks built the native C++ backend and returned 282 passed tests / 6 skipped. Generic-point zigzag gradients agreed to about 1.34e-7 relative error. These checks support the implementation at generic points, while leaving the exact submitted training lineage and tied first-update justification unresolved. The tied-start central-difference discrepancy of about .0822 is not by itself evidence of an invalid Clarke selection. Complete training and 100,000-step patrol results were not assessed at that evidence cutoff.
Critical weaknesses
The theoretical algorithm and the classification evidence are not yet connected by a reproducible, justified implementation. Appendix E.1 specifies a sigmoid field at threshold 0.5 (pp. 38–39), while the archived linked release uses tanh and 0.125 (gnn.py:124, configs/record.txt:1). Its README reports 19/20 solved splits and 0.977 ± 0.094, versus Table 5's 20/20 and 0.995 ± 0.016. These transforms/thresholds need not yield the same complexes or event derivatives. Separately, C.5's almost-sure gradient argument uses continuous parameter perturbations, including initialization; E.1 and the archived training loop use minibatch sampling alone from a tied, zero-residual start. Almost-everywhere differentiability does not justify that prescribed first point. A stale release and a valid one-sided/Clarke selection are plausible resolutions; failed central differences at a nonsmooth point do not prove an invalid subgradient. Nevertheless, both the exact result version and the applicable justification remain unresolved.
Questions for authors
-
Exact-version evidence: Which frozen source/configuration and per-run records produced the sigmoid/0.5 experiment and Table 5? Please map them to the archived tanh/0.125 release, and state which result, if any, changes after reconciliation.
-
The first update: Were continuously distributed parameter perturbations applied before the first gradient evaluation and at subsequent steps in the submitted runs? If not, can the chosen vector at the tied start be justified as a Clarke selection, or should that update be labeled heuristic? Initial, generic-point and final diagnostics for the exact version would be useful; a failed central difference at a nonsmooth point alone is not dispositive.
-
Technical positioning: How do the differentiated object, event pairing and regularity assumptions differ from D-GRIL/GRIL and the already cited Scoccola et al. framework? Which obstruction in arbitrary temporal zigzags requires the new rational lifts and exclusion set? GEFL and TopInG provide related learned extended-persistence context, but their static-graph targets are not interchangeable temporal baselines.
-
Mechanism beyond the designed classification task: With the exact submitted implementation, do the temporal-pairing advantage and single-run success rate persist when the switching rates, decoy strength or number of time samples are varied? A matched simple temporal reader would help determine what is specific to topology. Please separate variability across new generator draws from folds/restarts of the existing two draws. The current all-run table and validation-based restart selection provide useful controls.
-
Stability in the demonstrated optimization: What do the observed crossing denominators, approaches to the exclusion set, and temporal-resampling sensitivity indicate about gradient conditioning? For patrols, does improving the interpolated-field lifetime also improve the physical uncovered-duration statistic under finer temporal/spatial evaluation? The question concerns the practical relation between the optimized surrogate and its reported geometric evaluator; a general convergence theorem is not required. Runtime measurements are already reported.
We thank reviewer ou6u for a careful reading of our draft, the checks they asked helped us make our results more solid.
We thank the reviewer for spotting this inconsistency. In the submitted classification results, minibatch sampling was the only source of noise: training started from a zero residual, and no parameter perturbation was added. Without perturbation, nothing prevents an iterate from lying on a non-differentiable configuration, such as a tie of crossing times; at such a configuration, our implementation differentiates the closed-form crossing times of the cell selected by its tie-breaking rule, which gives a derivative fixed by convention rather than a gradient of the loss. As reported in our answer in Appendix E.3, this happened at the zero initialisation.
We have therefore rerun the classification experiment following Appendix C.5, adding a Gaussian perturbation with standard deviation σ = 10⁻⁴, fixed in advance, to the parameters at initialisation and at every iterate. Best-of-4 accuracy is unchanged (20/20 splits solved, 0.995 ± 0.016), and single runs solve 62/80 instead of 58/80. We propose to report these runs in place of the submitted ones in the revised paper, so that Section 4.2 and Appendix E.1 describe the perturbation consistently with Appendix C.5.
We provide a response on the 22 unsuccessful classifications in the general comment.
Autograd is compared with central differences (h = 10⁻⁶) along 5 random directions, at the first and final iterate of every run; we report the worst relative error. With the perturbation of Appendix C.5, now used in all reported runs, the median over the 80 runs is 5.5·10⁻⁸ at the first iterate and 4.1·10⁻⁸ at the final one. In the submitted runs, without the perturbation, the first iterate lies on a tie of crossing times, where the loss is not differentiable, and the error there is 0.71; at the final iterate it is 7.0·10⁻⁸. We add the full numbers to Appendix E.3.
The coverage gaps we report do not depend on the layer's reading resolution. They come from the independent evaluator of Appendix D.3, which computes, exactly in continuous time, the intervals during which each probe is covered along the true piecewise-linear motion. Between read instants, every robot moves in a straight line, so the diameter of each simplex is convex in time. Linear interpolation therefore never overestimates the filtering value, and at every instant the layer's complex is a subcomplex of the true Rips complex. As already reported in Appendix D.3 for the main runs, the layer’s longest bar is at least the measured maximum gap; this holds in all 150 runs we checked, including the new ones. The paper's reading of 3 instants per move is basically converged. Re-reading the final lifetime trajectories at 6 instants per move changes the longest bar from 9.07 to 9.05 frames (median over seeds); reading only at the waypoints overstates it (14.93).
The 100K extension was indeed decided before inspecting held-out outcomes, we will make this explicit in the text.