- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper presents RhinoNet, a framework for representation learning and generation at the level of entire high-dimensional point clouds, motivated by single cell datasets. The method constructs simplicial complexes, extracts features using geometry simplicial wavelets, and learns a latent space whose Euclidean distances approximate Geodesic Sinkhorn distances between populations. A separate generation head reconstructs point clouds, while conditional latent flow matching and graph-based interpolation support generation. Experiments evaluate population embeddings and generation on synthetic and biological datasets.
Critical strengths
- Learning representations of entire cell populations addresses a practical need to compare biological samples while retaining information beyond average marker expression.
- The combination of population encoding, transport-based distance regularization, and point-cloud decoding provides a unified approach to population level analysis and generation.
- RhinoNet achieves the best reported generation metrics on PDO and Charville among the evaluated baselines. The paper also includes experiments examining geometric weighting and simplex order.
Critical weaknesses
- Intermediate populations are reconstructed from their own latent codes, which does not demonstrate generation of unseen states. The biological meaning of these paths is also unclear.
- The unsigned incidence matrices conflict with the claimed graph Laplacian, and Equation (4) contains dimensional inconsistencies.
- Patient and batch identifiers are used inconsistently. The data splits and handling of unseen patient identities require clarification.
- Important baselines such as Wasserstein Wormhole are missing, and geometry preservation is assessed mainly through visualizations.
Questions for authors
- Can intermediate states be generated without accessing the target populations, and how is their biological relevance validated?
- Can the authors clarify the incidence-matrix convention and correct Equation (4)?
- What are the patient-level data splits, and how does generation handle unseen patient identities?
- Can the authors add Wasserstein Wormhole, an encoder trained with the same distance loss, and quantitative geometry preservation metrics? If the authors can satisfactorily address the questions and concerns above, I would consider revising my recommendation to positive.
4 comments
Response to Reviewer z7G4 (2/2)
[W4, Q4] Baselines and metrics. The reviewer asked for additional baseline comparison such as Wasserstein wormhole trained with the same distance loss.
Please see [PSM] in the global response for phenoscape metrics.
Set encoders trained with the same loss. The PointNet++ and PointTransformer baselines in our phenoscape experiments (Figures 4, 5, A2 and A3) were trained with the same objective as RhinoNet: the PhenoGS distance-matching loss and the reconstruction loss, with the same decoder. The encoder is the only difference between these baselines and RhinoNet, so these comparisons already separate the effect of the encoder from the effect of the PhenoGS targets. The submission did not state this clearly, and we have added it to Section 4.
Wasserstein Wormhole. Wormhole is the closest prior method, and we benchmarked its released implementation on an NVIDIA H200 (141 GB). Wormhole pads every point cloud to the largest cloud in the cohort, and each training step runs attention over all points and solves an optimal transport problem between every pair of clouds in the batch, so its memory grows with the square of the padded cloud size. With the default batch size of 16, a training step on Charville, where clouds are padded to 3,496 cells, uses 33.7 GB and takes 6.5 s, so the default 10,000 steps take about 18 hours. On PDO (padded to 6,533 cells) and UPMC (19,826 cells), a single training step runs out of memory. Encoding is cheaper but still memory-heavy: one cloud takes about 34–37 ms, with peak memory of 1.5 GB on Charville and 19 GB on UPMC, compared with 19–378 ms and under 240 MiB for one RhinoNet view (Appendix E). For comparison, the high-dimensional cohorts in the Wormhole paper have a median of 11 to 69 points per cloud, and its largest clouds (2,048 points) are 3-D shapes (Table A8).
| Cohort | Padded cloud size | Training step, batch 16 | Peak memory, training step | Encode one cloud | Peak memory, encode |
|---|---|---|---|---|---|
| Charville | 3,496 | 6,463.8 ± 2.2 ms | 33.7 GB | 36.99 ± 7.44 ms | 1.5 GB |
| PDO | 6,533 | OOM | OOM | 34.47 ± 0.93 ms | 3.0 GB |
| UPMC | 19,826 | OOM | OOM | 36.90 ± 6.93 ms | 19.3 GB |
We now report quantitative geometry preservation on the test point clouds of every cohort: Spearman correlation between latent and PhenoGS distances, normalized stress, nearest-neighbor overlap and trustworthiness (Table A2). Our PointNet++ and PointTransformer baselines use the same PhenoGS and reconstruction losses and the same decoder as RhinoNet, so the encoder is the only difference. On PDO, RhinoNet reaches ρ = 0.570, against 0.117 and −0.039. On Charville it matches PointNet++ in rank correlation with lower stress, and on UPMC it outperforms PointTransformer on every metric. We also adapted Deep Wasserstein Embedding to point clouds with PhenoGS targets (EMD 4.23 for RhinoNet vs 4.27 on PDO). For Wasserstein Wormhole, we benchmarked the released implementation on an NVIDIA H200 (141 GB). It pads every cloud to the largest in the cohort, so a single training step runs out of memory on PDO and UPMC, while Charville needs 33.7 GB per step and about 18 hours of training.
We thank the reviewer again for the constructive feedback. In summary, we have (1) shown that intermediate states can be generated without encoding the target populations, using linear interpolation between endpoint latents (Table A6), and examined their biological content on PDO (Figure A1); (2) corrected Eq. (4) and clarified the unsigned incidence convention; (3) clarified that c001–c007 denote batches, stated the patient-level splits (Appendix D.2) and described how generation handles unseen patients; and (4) added a Deep Wasserstein Embedding comparison, a Wasserstein Wormhole benchmark, same-loss encoder comparisons and quantitative geometry-preservation metrics (Tables A2, A7 and A8). As the reviewer indicated they would consider a positive recommendation if these points were addressed, we would be grateful if they would revisit their score, and we are happy to answer any remaining questions.
Thank you for your detailed reply, it has solved my main question. I've improved the score to positive.
We thank the reviewer for reading our rebuttal carefully, and we appreciate that they have raised their assessment of the manuscript. If any concerns remain that prevent a stronger recommendation, we would be grateful if the reviewer could let us know, and we would be happy to address them before the discussion period closes.
Response to Reviewer z7G4 (1/2)
We thank the reviewer for the constructive review and for recognizing the practical need for population-level representations and our unified approach to population analysis and generation. We address the reviewer's comments below.
[W1, Q1] Intermediate states and biological relevance. The reviewer asked for generation of intermediate states without accessing the target populations and the biological relevance.
The intermediate point clouds on each path were held out from the training of both the encoder and the generation head. The submission's Appendix F.3 described this incompletely, mentioning only the generation head, and we have corrected the description in Appendices D and F.6.
We have also added a linear interpolation that never encodes the held-out point clouds: we decode latents spaced evenly on the straight line between the two endpoint latents (Section 3.2). It performs as well as the discrete geodesic interpolation, and its EMD to the held-out point clouds is 20%, 24% and 24% lower than that of Meta Flow Matching on PDO, Charville and UPMC (updated Figure 6, Table A6).
We tested whether the decoded PDO intermediates (Appendix F.1, Figure A1 in the updated manuscript) capture drug-specific biology. The interpolant recovers the culture’s DNA-damage response with its mean γH2AX expression (+1.49 vs. +1.54 control SD). A similar fraction of its cells is strongly damaged with γH2AX above the 99th percentile of DMSO (30.5% vs. 38.8%, against 1% in DMSO). These damaged cells lie in the same region of the embedding as the real damaged cells and show the expected cycling and checkpoint activation (phospho-RB and pCHK1 high). RhinoNet’s interpolation therefore captures the magnitude, location and mechanistic coupling of the SN-38 DNA-damage response at an unmeasured point along the dose axis.
[W2, Q2] Incidence matrix conventions and Eq 4. The reviewer asked for clarification on incidence-matrix convention and Equation 4.
We thank the reviewer for their careful attention to detail. We have corrected the indexing errors in Equation 4. Specifically, we have changed the Mk−1−1 to Mk−1 and final Mk to Mk+1 in the definitions of P~k+1C and D~k+1B.
The reviewer is correct about the graph Laplacian. Since we are using unsigned incidence matrices, we have Δ0=D+A, not D−A. We have removed this sentence.
As in Madhu et al. (2024), which introduced the simplicial scattering transform, we use unsigned incidence matrices so that we can construct generalized degree matrices and, from them, row-normalized transition matrices. With signed incidence matrices, positive and negative entries would cancel when computing these degrees, so a row sum could be zero, the degree matrix would not be invertible, and the row-normalized transition matrix would be undefined.
[W3, Q3] Data splits. The reviewer asked for clarification on data splits and unseen patient identity.
Appendix D.2 has been updated to reflect the fact that c001-c004 in Charville and c001-c007 in UPMC refer to batches of patients, not patients. Patient-level splits are listed in Appendix D.2: on PDO, patients 75 and 99 are held out for validation and testing of the encoder, and on Charville and UPMC whole batches are held out. Conditional generation learns an embedding for each label (patient and treatment, or patient and recurrence), so it can condition only on patients seen during training. Its test set therefore consists of held-out cultures of training patients, and every patient and treatment keeps at least one training example. Point clouds of held-out patients can still be embedded in the phenoscape and decoded from their latents.