- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
In this paper, the authors first highlight a limitation of ODE/SDE approaches for trajectory inference that stems from their Markovian structure. However, their training interpolants are not guaranteed to be Markovian. They then define hierarchical processes, whose transitions between regions are constrained by a known graph, and show their relation to trajectory inference in single-cell data. Finally, they present a framework equipped with flow maps and a novel hierarchical process loss that encourages the trained model to take paths that are valid according to the provided prior knowledge about valid transitions.
Critical strengths
-
Strong motivation. The authors first show that the interpolant is not Markov by a bend depending on the endpoints and ODE/SDE approaches are Markov, the future depends on current state. An interpolant that carries lineage information is not guaranteed to be Markovian. ODE/SDE based approach can infer marginals yet still can take an invalid trajectory, jumping between sibling cell type regions as demonstrated by experiments. Hence, the authors motivate the constraining model and encourage it to produce valid trajectories.
-
Novel hierarchical loss. Cell evolution follows a hierarchical path. A cell belonging to a type cannot evolve into its parent or sibling cell type as time passes. The authors encourage the model to follow a valid hierarchical path by introducing a novel loss based on soft transition compatibility. They first train a classifier that predicts cell types and define a valid transition matrix. Then, they define the compatibility as the multiplication of the classifier's predicted type probabilities at the earlier and later states with the valid transition matrix. The proposed loss is the negative logarithm of this compatibility, where minimizing it pushes the transitions toward valid regions.
-
Runtime. The proposed method does not rely on costly step-by-step simulations by providing the transition with a single model call with flow maps, which makes it practically appealing.
Critical weaknesses
-
The following work is closely related and could be discussed and possibly compared against in terms of both performance and runtime: von Bassewitz, J. P., Pervez, A., Fumero, M., Robinson, M., Karaletsos, T., & Locatello, F. (2026). Learning explicit single-cell dynamics using ODE representations. In International Conference on Learning Representations.
-
The authors demonstrate their method mostly on relatively shallow and simple lineage processes. The paper could be strengthened by an additional dataset with a deeper and more complex lineage tree, for example: Calderon, D., Blecher-Gonen, R., Huang, X., Secchia, S., Kentro, J., Daza, R. M., ... & Shendure, J. (2022). The continuum of Drosophila embryonic development at single-cell resolution. Science, 377(6606), eabn5800.
-
Minor cosmetic issue: Table 5 in Appendix H overflows horizontally.
-
Line 7 of Algorithm 1 defines , but line 8 uses , which is not defined.
Questions for authors
- How would ablation variants that use the hierarchical loss without filtering perform? Could the authors add this variant to Table 2?
- Could the authors provide a sensitivity analysis with respect to the weight of the hierarchical loss?
6 comments
CLIFT ablation without interpolant filtering
(B) CLIFT ablation without interpolant filtering
We have now evaluated an ablation where we use our hierarchical loss on a flow map, but without interpolant filtering. We have added these results to Table 2 of the revised manuscript, labelling this ablation as CLIFT$_{\mathrm{D}}$ (unfilt.) and CLIFT$_{\mathrm{S}}$ (unfilt.). We also report these results, in comparison to the base flow map ablations, and the full CLIFT method, here.
Maizels:
| Method | Viol. % | |
|---|---|---|
| OT-FMap | ||
| CLIFT$_\mathrm{D}$ (unfilt.) | ||
| CLIFT$_D$ |
| Method | Viol. % | |
|---|---|---|
| OT-SSFM | ||
| CLIFT$_\mathrm{S}$ (unfilt.) | ||
| CLIFT$_S$ |
Cite:
| Method | Viol. % | |
|---|---|---|
| OT-FMap | ||
| CLIFT$_\mathrm{D}$ (unfilt.) | ||
| CLIFT$_D$ |
| Method | Viol. % | |
|---|---|---|
| OT-SSFM | ||
| CLIFT$_\mathrm{S}$ (unfilt.) | ||
| CLIFT$_S$ |
Multi:
| Method | Viol. % | |
|---|---|---|
| OT-FMap | ||
| CLIFT$_\mathrm{D}$ (unfilt.) | ||
| CLIFT$_D$ |
| Method | Viol. % | |
|---|---|---|
| OT-SSFM | ||
| CLIFT$_\mathrm{S}$ (unfilt.) | ||
| CLIFT$_S$ |
From these comparisons, we can generally see, across both the deterministic and stochastic settings, that the CLIFT (unfilt.) ablation tends to improve the Viol % and metrics compared to the base OT-FMap and OT-SSFM variants, but it is generally not as good on either metric as the full CLIFT method.
These results show that the hierarchical loss can notably improve modelling performance without any alterations to the interpolants. Nevertheless, the best performance are obtained when combining this loss with the filtered interpolants, which is to be expected as this involves more sophisticated tailoring of the model using the prior knowledge available about the ground-truth process's hierarchy.
Updates: We have added this additional ablation and the relevant discussion to Table 2 and Section 5.
Sensitivity analysis of the hierarchical loss weight
(C) Sensitivity analysis of the hierarchical loss weight
The choice of the weight for the hierarchical loss, is an important design choice when training CLIFT. Indeed, this is one of the hyperparameters that we optimised over a grid search on the Maizels dataset, by considering the marginal reconstruction on two held-out validation timepoints. We now include these results, in terms of the Viol. and achieved across this hyperparameter sweep, to see how sensitive the performance of CLIFT is to this setting. For the deterministic setting, we swept over , and for the stochastic setting we swept over . We list the results for each setting in the table below, and include them in our Appendix L.
| Viol. (%) | Test | Validation | |
|---|---|---|---|
| 0 | |||
| 100 | |||
| 350 | |||
| 1000 | |||
| 1500 |
| Viol. (%) | Test | Validation | |
|---|---|---|---|
| 0 | |||
| 1 | |||
| 10 | |||
| 100 |
As we can see from the above, there is an optimal operating point in the middle of the sweeps for both settings. At low constraint weights, the Viol. tends to be higher than this optimal point, as does the test and validation , while at too high constraint weights, performance degrades again. There seems to be a strong correlation between both metrics as well, so, in this experiment at least, a user does not have to trade-off between optimising one or the other, as both metrics share the same optimum in both settings.
Update: We have added tables with results across different hierarchy weights for the Maizels experiment in Appendix L.
(D) Further dataset
Thank you for pointing us to this dataset, it does indeed appear to offer a more complex lineage tree setting that would be useful to investigate. While we have not yet had time to run experiments on it, we will try tto do so in the remaining discussion time.
Thank you again for your time and effort in reviewing our submission. We hope that the above amendments have addressed your concerns. We are more than happy to engage with any further comments you may have. We have also corrected the table overflow and the notation inconsistency in Algorithm 1.
Comparison with Cell-MNN
Thank you for your thoughtful comments and suggestions, which have helped us significantly improve our manuscript. Please see the revised PDF, where the changes are written in blue. We also directly respond to your points below.
(A) Comparison with Cell-MNN
We appreciate you pointing us to [1], it is indeed a relevant related work, and we have now discussed it and compared to it empirically. Cell-MNN is conceptually related to CLIFT, in that both methods approach trajectory inference using ODEs/SDEs, and both do so with interfaces that allow for sampling arbitrary time jumps along trajectories without numerical integration. Cell-MNN approximates the target process using locally linear ODEs in PCA space, that can be solved analytically to move forward in time, while our CLIFT method uses flow maps, that are a more expressive one-step operator than the linear ODE framework. Cell-MNN is primarily designed to model the marginal evolution of the target process well, in line with most existing trajectory inference methods, and they do not impose any constraints on the conditional laws of the model's process, which is our primary focus with CLIFT.
We have added Cell-MNN to our empirical comparisons across the three single cell datasets in Table 2, using the official implementation from [1] and the same hyperparameter optimisation process as CLIFT. We also include its results in comparison to CLIFT$_D$ here:
Maizels:
Cite:
Multi:
As we can see, CLIFT outperforms Cell-MNN in terms of both the Viol. % and W1 metrics on all three datasets. The more expressive flow map framework seems to allow for better modelling of these cellular differentiation processes than the locally linear ODE approach of Cell-MNN. Nevertheless, in terms of runtime, across the Maizels, Cite, and Multi datasets, Cell-MNN training took on average 5, 14, and 8 minutes respectively, so this method does offer computational gains over CLIFT.
Update: We have added a discussion of Cell-MNN to our Section 4, and added it to our empirical comparisons in Section 5.
[1] von Bassewitz, J. P., Pervez, A., Fumero, M., Robinson, M., Karaletsos, T., & Locatello, F. (2026). Learning explicit single-cell dynamics using ODE representations. In International Conference on Learning Representations.