- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
scCGNet combines a variational graph autoencoder, a Gaussian mixture copula model, and ZINB reconstruction in one training framework for single-cell clustering. The authors test it on 15 real datasets and nine simulated datasets, and compare GMCM with GMM both during joint training and on fixed embeddings.
Critical strengths
The overall design is easy to follow: graph structure, expression reconstruction, and clustering are trained together. The experiments cover a fairly large number of datasets. It is also useful that the paper reports cases where GMCM performs worse than GMM on fixed embeddings, since this gives a more balanced view of the method.
Critical weaknesses
The paper does not give enough details about how the GMCM density is computed in the actual implementation. Equation 7 subtracts joint and marginal log densities, which can become unstable when the likelihood values are very small. A few implementation details are needed to show how this issue is handled during training. The practical cost of the method is also unclear. For large datasets, training time and peak GPU memory are important, but these numbers are not reported. The paper also does not provide a directly comparable cost measurement for the baseline methods.
Questions for authors
How do you keep the computation in Equation 7 numerically stable during training?
Could you report the wall-clock training time and peak GPU memory on representative datasets, together with the same measurements for the baseline methods?