- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper represents a new approach to generating representations for scHi-C data by formulating it as an inverse problem. Reconstruction of cells is done via a generalized EM-iterative procedure.
Critical strengths
Formulating this problem as a inverse problem is an interesting choice.
Critical weaknesses
The paper introduces an interesting idea, but fails to (1) convincingly describe the method, (2) describe its evaluation procedure carefully and (3) connect its conclusions to the experiment. It should therefore be rejected.
W1: The paper does not provide a well-described method sections. It misses a clear problem formulation, and during the section it remains unclear what are modeling assumptions made by the paper, and what is a new contribution by the author. Examples include:
- L. 157, 262. What is the role of orthogonal gauge transformations?
- L. 247. How does this prevent
feedback loop error accumuluation - L. 258. What is a background threshold?
W2: The evaluation is missing critical details make it hard to assess the performance of the method. Examples:
- Was a train/test split performed?
- Why were these specific methods chosen as comparisons. The paper explicitly mentions the Plummer et al. 2025 as a benchmark paper, but does only implement a subset of methods.
- What is the runtime / time-complexity of the method? (Re)-Training a diffusion model in every iteration of the M-step seems expensive.
W3: Coherent presentation The paper does a bad job of connecting it's experiments to its results, claiming overly broad results. Examples:
- L483: While it shos results for restoring chromatin architecture, claiming that
cell-specific chromatin architecture can be faithfully recoveredby the method seems overly broad. - L484: It remains unclear why this framework would be considered
principled.
Minor comments:
- L472: The authors should expliclity state the advantages of the method.
Questions for authors
See above.
2 comments
W2: Evaluation procedure.
-
Train/test split. scHi-C imputation and embedding are unsupervised, transductive (cohort-level) tasks (similar to matrix completion, clustering, and graph node embedding), and are hence conventionally evaluated without a separate train/test split. The goal is to recover the structure of the observed cells themselves, for which no clean ground truth exists. Existing methods (including scHiCluster, Higashi, Fast-Higashi, scVI-3D, see also Plummer et al., 2025) are likewise applied to the whole cohort, and some have no training stage at all (e.g., scHiCluster directly smooths each cell's map). We apply the same protocol to all methods, and cell-type annotations are used only for evaluation. To avoid circular evaluation, contact and structure recovery use a split-half design: each cell type is split into two halves, and predictions for one half are compared with the raw pseudo-bulk of the other, so query cells never enter their own reference (Section 4.1).
-
Comparison methods. Plummer et al. (2025) benchmark embedding tools instead of dense-map recovery, and we only adopted their embedding metrics. Most tools in that benchmark output only embeddings (e.g., scGAD converts maps into gene-level scores), and several methods integrate scHi-C with other omics modalities such as scRNA-seq. Hence, they are not suitable to be evaluated on contact imputation or structure recovery. We therefore chose four widely used methods (all published in top-tier journals), covering the main method families: smoothing (scHiCluster), hypergraph learning (Higashi), tensor factorization (Fast-Higashi), and generative modeling (scVI-3D).
-
Runtime. The diffusion network is not retrained from scratch. Before EM, it is trained for 20 epochs as a warm-up. In each EM iteration, the E-step updates each cell's latent factors 20 times, where each update involves one likelihood gradient step followed by one denoising step (there is no full diffusion sampling). The M-step then trains the observation parameters for 1 epoch and the diffusion network for 5 epochs (Appendix C). On HiRes-200 kb, scHiDiffEM takes 43 min for training and imputation, versus 90 min for Higashi and 142 min for scVI-3D (see our response to Reviewer vNS4, W1).
W3: Connecting conclusions to experiments.
- L483 (now Section 5). We agree that this statement was overstated and have revised it. The Discussion now states only what the experiments show: superior cell representations, superior contact imputation with the largest gains in cell-type-specific metrics, and structure recovery comparable to the strongest baseline. As stated in the Figure 3 caption, the opposite-half references validate cell-type-level patterns, not individual-cell ground truth (like many other problems in single-cell genomics, we have no access to the ground truth due to technical limitations).
- L484 (now Section 5). We call the framework principled because the reconstruction follows from an explicit statistical model instead of heuristic smoothing. It is formulated as an inverse problem: raw counts are linked to latent contact rates through a library-size-aware negative-binomial likelihood, the latent space has a geometric low-rank structure whose rotational ambiguity is explicitly handled, and the population prior and single-cell restoration are coupled through generalized EM. Each component therefore has a clear probabilistic role, in contrast to methods that smooth transformed maps without an observation model.
Minor. We have removed "Despite the obvious advantages" and now state the advantages explicitly in the abstract and Section 4.2. Compared with existing methods, scHiDiffEM (i) avoids the over-smoothing of scHiCluster and Higashi, which blurs local contact patterns (Figure 3), and outperforms both in structure recovery on all 18 datasets; (ii) preserves cell-to-cell heterogeneity, whereas scVI-3D pulls predictions toward the population average, as reflected in its much lower type-specific Pearson and top-1 retrieval; (iii) produces better cell embeddings, with the highest embedding aggregate against every baseline in at least 16 of 18 datasets, while Higashi and scVI-3D embeddings degrade sharply on HiRes brain; and (iv) models raw counts and sequencing depth directly, uses one set of hyperparameters for all datasets, and runs faster than Higashi and scVI-3D.
Thank you for the comments. We agree that some parts of the previous draft were dense and unclear, and we have revised the writing throughout the paper to make it clear and accessible to readers from a wider range of fields. We have revised the manuscript accordingly and uploaded the revised PDF. Below we clarify each point.
W1: Method description. We have added a problem setup at the start of Section 3. The 3D chromatin conformation of each cell can be summarized by a dense contact map, a matrix whose entry (i,j) is the contact frequency between genomic bins i and j. scHi-C sequencing captures only a small, depth-dependent fraction of these contacts, so the observed map is sparse and noisy. Recovering each cell's dense map from this observation is an ill-posed inverse problem, because most entries are zero and no clean single-cell maps exist for supervision. We therefore assume a low-rank contact structure plus a shared distance decay, NB-distributed counts scaled by sequencing depth, and shared structure among similar cells. This directly motivates our geometry-informed generative model, using a generalized EM with a diffusion prior learned from the cohort itself to recover the underlying dense map.
Though Negative-binomial count models, denoising diffusion, and EM algorithms are established tools, our contributions lie in (i) a geometry-informed generative model that separates the distance decay shared by all cells from cell-specific low-rank contact structure, and links inferred latents to raw counts through a library-size-aware Negative-binomial likelihood; (ii) a diffusion prior trained without clean single-cell maps, but using mini-pseudo-bulks and sparse counts downsampled from them; and (iii) a generalized EM solver that iteratively performs bounded MAP updates in the E-step while optimizing model parameters in the M-step, to recover each cell's contact map from its own observed counts under this prior.
Here are some details we want to clarify.