- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes an expression-conditioned Riemannian graph flow for predicting spatial omics from histology. The method performs conditional flow matching under the multiplicative geometry of gene expression, using a dynamic graph Transformer to predict the clean expression endpoint. Its neighborhoods and edge messages integrate spatial proximity, morphological similarity, and evolving expression estimates. An expression-aware Riemannian objective balances supervision across genes. Experiments across multiple datasets demonstrate the method’s effectiveness.
Critical strengths
The paper identifies three limitations of existing methods: unconstrained generative trajectories, fixed graph neighborhoods, and uniformly weighted training objectives. It presents three corresponding contributions to address these limitations.
Critical weaknesses
-
The paper does not clearly analyze how its key components, including geometry-aware conditional generation, dynamic multi-view tissue modeling, and the expression-weighted Riemannian objective, differ from existing approaches.
-
The implementation details of the ablation studies are insufficiently described, making it difficult to assess how each component’s contribution is isolated.
Questions for authors
-
Since the proposed metric is globally isometric to Euclidean space through , could you clarify the methodological distinction between your geometry-aware conditional generation and standard Euclidean flow matching applied to log-transformed expressions?
-
What distinguishes the proposed dynamic multi-view tissue modeling from existing dynamic graph construction and edge-conditioned attention methods? Please clarify how candidate neighbors are constructed and whether the candidate sets themselves change during refinement.
-
How does the expression-weighted Riemannian objective differ from conventional inverse-expression-weighted regression in log coordinates? What additional benefit does gene weighting provide beyond the normalization already introduced by the multiplicative metric?
-
Could you specify the implementation of each variant in Table 4?
-
Can you provide a controlled comparison between multiplicative and Euclidean transport while keeping the denoiser, dynamic graph, gene weighting, and training budget unchanged? Table 4 evaluates multiplicative edge information, but does not directly isolate the contribution of the transport geometry.
Thank you for acknowledging that the ablation implementation and gene-weighting concerns have been addressed.
Thank you for acknowledging that the ablation implementation and gene-weighting concerns have been addressed. We provide further clarification and matched fold/seed results for the two remaining points.
1. Transport formulation. The exact Euclidean-coordinate representation is consistent with our Riemannian formulation: it describes the same model in another coordinate system. Following Chen and Lipman’s Flow Matching on General Geometries (ICLR 2024), we use an analytically tractable geometry to specify multiplicative conditional transport. Our contribution concerns this formulation and its coupling with expression-dependent tissue refinement, rather than a claim of intrinsic curvature.
The controls answer complementary empirical questions. Replacing only multiplicative corruption reduces PCC from 0.4671 to 0.3712 on Ovary and 0.3461 to 0.2571 on COAD, supporting this corruption choice within the pipeline. Standard Euclidean FM evaluates a complete alternative with its corresponding prediction target, objective, and integration scheme. We agree that its entire performance gap cannot be attributed solely to the path. We will distinguish these interpretations explicitly.
2. Dynamic neighbor reselection. To clarify the variability, we examined the matched fold/seed results. The reported standard deviations pool all 12 fold×seed evaluations, so they include between-fold heterogeneity. Averaging the three seeds within each fold gives:
Full improves on three of four folds, with the same direction across all three seeds within each fold. Averaging over folds separately for each seed gives improvements of +0.0864, +0.0824, and +0.0658. Thus, the positive aggregate effect is reproduced across all three seeds, while G1’s large pooled standard deviation primarily reflects differences between folds.
G1 retains expression-edge updates while fixing neighbor indices, so this intervention specifically tests reselection. These matched results support its empirical benefit in the evaluated setting and identify split0 as a clear exception.