- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
U-Net is an architecture for image processing that uses an encoder–decoder structure to compress information and then reconstruct detailed outputs, with skip connections preserving fine-scale features. In this paper, U-Net is generalized to combinatorial complexes via rank-wise cell representations, incidence-based transport between ranks, refinement maps, bottlenecks, and skip connections. The paper demonstrates the framework on graph and node-classification, hypergraph, point-cloud, and image-segmentation datasets.
Critical strengths
- The paper is generally well presented and uses concepts familiar from topological deep learning, making the architecture and exposition easy to follow.
- The versatility of the architecture is demonstrated across several types of data, including graphs, point clouds, and hypergraphs. For point clouds, the rank structure provides an interesting way to represent different aggregation levels over neighboring points.
- The hypergraph experiments are particularly relevant, since these datasets are designed to capture higher-order relations. The results suggest that an encoder–decoder architecture with bottlenecks and skip connections may provide a useful alternative to existing hypergraph architectures.
Critical weaknesses
- The theoretical contribution is relatively limited. Some results might be more appropriately presented as observations or remarks. For example, Proposition 3.5 appears to follow from the composition of compatible equivariant functions.
- The architecture involves several modelling choices that require further justification. For example, the graph experiments add a single rank-3 cell incident to the triangles. In the image-segmentation experiments, latent higher-level cells are used, but their role and construction could be explained more clearly.
- The experimental results are mixed across subsections. In some cases, TopoU-Net performs best, but the improvements appear relatively small and are accompanied by substantial variance.
- The term “canonical instantiation” is somewhat misleading because the paper gives examples of possible refinement and merge functions rather than specifying one concrete implementation.
- Additional implementation details are needed to make the experiments reproducible.
Questions for authors
- How far does the analogy of the bottleneck from the classical U-net take us here? For a fixed number of vertices, the number of cells can grow with the rank and there may not be a bottleneck at all. In that case the role of the architecture (and in particular skip connections) is unclear.
- What is the expressivity? For graphs for example does Topo Unet learn from neighborhoods of cells at any level? (or do they do so only if one uses within-rank refinements based on on incidence-induced adjacencies?) Is the expressivity thus not reduced compared e.g. to GNNs that aggregate over large neighborhoods?
- More generally, which existing architectures can be represented within the proposed framework? A more formal discussion of this question would help position the contribution relative to existing topological message-passing methods.
5 comments
Weakness 1. Theoretical Contribution
Weakness 1. Theoretical Contribution
We agree that Proposition 3.5 follows from the composition of compatible equivariant operators. Its purpose is to establish that the complete encoder--decoder architecture preserves equivariance, rather than to claim a new equivariance principle. Our main contribution is architectural: a rank-indexed encoder--decoder with incidence-based transport, matched-rank skip connections, and an explicit characterization of structural compression. In particular, Proposition 3.6 connects bottleneck dimensions to exact reconstruction without skips. We will clarify this distinction and present Proposition 3.5 as a structural guarantee.
Weakness 2. Modeling Choices
We thank the reviewer for highlighting these modeling choices. The rank-3 cell in the original graph experiments is an explicit global aggregation cell incident to rank-2 triangles, rather than an intrinsic topological feature of every graph. It provides a global-context bottleneck for cross-rank information transport.
To further address the dependence on manually specified rank paths, we introduce a learned soft rank-routing extension that adaptively weights admissible cross-rank transitions using attention while preserving incidence-based message passing and matched-rank skip connections.
Across ten splits, learned routing improves Roman-empire accuracy from to and Macro-F1 from to relative to validation-selected fixed routing. On Amazon-ratings, accuracy improves from to and Macro-F1 from to . On Minesweeper, learned routing matches the best fixed-path accuracy () while improving Macro-F1 from to . All fixed-routing controls use the same routing backbone.
Weakness 3. Mixed Experimental Results
We agree that improvements vary across datasets and do not claim uniform superiority. However, the results provide evidence of the framework's effectiveness across several domains. In particular, Table 4 reports the highest mean performance on four of five hypergraph datasets. Moreover, the controlled ablations in Appendix B.3.1 (Table 14) isolate rank-path effects under matched depth and parameter budgets. On Roman-empire at 25% support, the edge-only path achieves 68.56%, whereas the rank-2 path achieves 82.69%. These results indicate that the benefits cannot be explained solely by model size.
Weakness 4. Canonical Instantiation
We appreciate this observation. Section 3.5 specifies incidence-based rank transport and a default additive skip merge, while allowing alternative refinement and fusion operators. This flexibility is intentional: TopoU-Net defines an architectural framework rather than a single fixed network. Nevertheless, we agree that canonical instantiation may suggest a uniquely specified implementation. We will replace it with reference instantiation and explicitly distinguish the general framework from the configurations used in each experiment.
Weakness 5. Reproducibility
We agree that the implementation description can be improved. Appendix B.6 provides common training and architectural settings, but additional dataset-specific information would facilitate reproduction. We will expand the experimental specifications to identify the rank paths, cell-construction rules, incidence normalization, refinement and merge operators, model dimensions, and training configurations used for each dataset.
Question 1. Bottleneck Interpretation
We agree that increasing rank does not necessarily imply monotonic compression. However, combinatorial complexes permit an explicit bottleneck construction: for , introducing a single global cell at a new maximal rank yields , regardless of intermediate cell counts. Thus, bottleneck formation is a controllable property of the complex construction and selected rank path, rather than an assumption of monotonic downsampling. Section 3.4 formalizes this through support ratios. Table 9 further shows that removing skip connections causes substantially larger performance degradation under severe bottleneck compression. We will clarify this distinction in the revision.
We thank the reviewer for the careful evaluation and constructive feedback. We appreciate the positive assessment of the presentation, architectural versatility, and hypergraph experiments. We address each concern below.