- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes PRISM, a unified multi-task framework for neutrino telescope event reconstruction that combines a Transport Skeletonizer (TSK), task-aware queries, and a geometry-aware coordinate anchor. The framework aims to jointly reconstruct five event-level properties while sharing the underlying unified representation. However, the experimental evidence is insufficient to demonstrate a competitive accuracy–efficiency trade-off compared with existing neutrino reconstruction methods, which is claimed as the main contribution of the paper.
Critical strengths
Exploring a unified representation for neutrino telescope event reconstruction is a meaningful direction. The proposed architecture is a reasonable engineering choice for balancing local and global event information at a manageable computational cost. In particular, the persistent skeleton tokens allow the model to capture event-level structures, such as extended particle tracks spanning multiple local patches, without calculating the full attention across all hits. Task-aware queries are also a reasonable design choice, as different reconstruction tasks may rely on different features of the event.
The ablation studies of the main components are informative, especially the equal-compute comparison for the coordinate anchor. However, some important comparisons are still missing, as discussed in the Weaknesses section.
Critical weaknesses
Minor issue: In figure 1 task (e) is introduced as a classification task, which is not consistent with other parts of the paper. If it’s a typo, please fix it.
First of all, the writing of this paper needs to be improved a lot. The current introduction and problem setup is not very clear for general AI4S readers. For example, the authors should explain the following jargons/items more clearly:
- Detector-string identity: This might be commonly used in the field of neutrino telescope, but not a commonly known jargon
- The meaning of each variables in y = {y_{topo}, E, d, v, y_{vis}}
- u_i is never defined
- phi_{in} and e are introduced as embeddings, but their implementation is not explained
Second, the methodological novelty of the Transport Skeletonizer (TSK) is unclear. Its core mechanism is similar to Recurrent Interface Networks (RIN; Jabri et al., ICML 2023), which already employ learnable latent tokens to read information from input tokens and write it back through cross-attention. RIN also preserves input-level representations and performs multiple rounds of read-write operations with persistent latent states. Furthermore, FIT (Chen & Li, 2023) already combines local attention with global latent features, which matches the overall architecture adopted by PRISM. This paper does not sufficiently distinguish TSK from these prior works. As an application-track paper, developing an original algorithm is not necessarily required. However, the authors should properly acknowledge and discuss existing methods rather than re-inventing established mechanisms with a new name and claiming them as novel contributions.
Furthermore, the ablation studies are insufficient to support some of the main architectural claims. One of the central motivations of TSK is to preserve fine-grained hit-level representations, and combine the information with event-level skeleton tokens. However, the authors do not compare the model performance in those 3 cases:
- Using only hit-level representations
- Using only skeleton representations
- their combination in the final task-aware retrieval stage (main result)
Without this comparison, the experiments cannot justify the motivation and effectiveness to keep both representations. A single concatenation can not be justified as contribution without clear improvement demonstrated. Besides, the TSK ablation only compares the proposed global information exchange mechanism against removing it entirely. This demonstrates the benefit of introducing global information exchange compared with the local attention only case, but does not establish the advantage of TSK over existing alternatives such as RIN or FIT style mechanisms.
The inference efficiency comparison in Table 1(c) is fundamentally uninformative. It is common knowledge that running five copies of the same model sequentially will require approximately five times the computational cost of running a single copy. Although sharing event representations is a reasonable approach to reducing redundant computation, the current comparison provides no meaningful evidence of the computational efficiency of PRISM relative to existing alternatives. If the authors want to justify the computational efficiency of the proposed framework, they should at least compare against:
- Existing single-task baselines: The inference cost of each of the existing reconstruction models reported in Table 1(a), including their parameter counts, FLOPs, etc.
- A conventional unified multi-task Transformer: An independently trained model with a shared encoder and five task-specific output heads, but without TSK or task-aware queries. This would provide a more meaningful baseline for determining whether the proposed architectural components offer any computational advantage beyond standard representation sharing.The shared pooled multi-task baseline mentioned in Table2 could serve as such a baseline, but neither the detailed structure nor the computation cost is reported.
Finally, the most serious weakness of this paper is that the proposed model matches or outperforms the best published reference results in only 12 out of 136 evaluated metric cells across the four detector configurations. In particular, PRISM fails to reach the best published performance in any of the direction or vertex reconstruction metrics. Although the reference results are taken from different models rather than a single baseline, these results raise critical concerns about the competitiveness of the proposed framework. Given that the primary motivation of this work is to develop a unified framework for neutrino telescope event reconstruction, the authors need to justify the practical effectiveness and scientific impact of the proposed model, especially considering its limited reconstruction accuracy compared with existing methods. Without convincing evidence, for example, the computational savings can compensate for the loss in reconstruction accuracy, it is difficult to establish the practical value of the proposed framework.
Questions for authors
- Given that PRISM only matches or outperforms the best published results in 12 out of 136 metric cells, what is the practical scientific value of this framework? In what practical scenarios would PRISM be preferred over the existing reconstruction models?
- Can the authors provide a meaningful inference efficiency comparison against the existing single-task baselines and a conventional shared-encoder multi-task model? How much computational cost can PRISM actually save at comparable reconstruction accuracy, and whether the amount is substantial enough to be considered as a critical factor for similar tasks?
- What are the main methodological differences between TSK and existing architectures such as RIN and FIT?
- Can the authors compare the performance of using only hit representations, only skeleton representations, and both in the final task-aware retrieval stage?
4 comments
Response to Reviewer V1dc (Part 2/2)
3. Relationship to RIN and FIT (Q3/W2):
Methodological relationship. RIN (Jabri et al., 2023) and FIT (Chen and Li, 2023) provide important precedents for latent-mediated information exchange. PRISM builds on this established paradigm and adapts it to sparse, geometry-structured detector events. Its design combines Morton-ordered local encoding, persistent event-level skeleton tokens, gated hit-level feedback, task-conditioned retrieval, and coordinate-aware vertex refinement. We will clarify this relationship and cite both works in the revised manuscript.
Controlled comparisons. We evaluated RIN-style (latent self-attention/FFN between read/write steps) and FIT-style (one latent per 64-hit group with local/global exchange) adaptations under matched Flower-XL training exposure and task losses. Both retain PRISM's surrounding architecture, allowing comparison of the exchange mechanisms within a common reconstruction framework. These are adaptations rather than full reproductions of the original architectures.
Table I: Full Flower-XL test, seed 42, before Anchor; parameters/FLOPs are not matched.
| Exchange | Params(M) | TopoAUC↑ | Ewidth(%)↓ | Dir(°)↓ | Vertex(m)↓ | Visible-y↓ |
|---|---|---|---|---|---|---|
| PRISM-TSK | 7.806 | 0.9055 | 61.832 | 7.766 | 19.082 | 0.0891 |
| RIN-style | 9.141 | 0.9040 | 62.035 | 7.712 | 21.115 | 0.0905 |
| FIT-style | 9.140 | 0.8700 | 96.089 | 12.860 | 26.903 | 0.1263 |
Experimental comparison. Under matched training exposure, PRISM-TSK achieves performance broadly comparable to the RIN-style adaptation on topology, energy, direction, and visible-y, while reducing vertex error from 21.115 m to 19.082 m with approximately 14.6% fewer parameters. It also outperforms the evaluated FIT-style adaptation across the reported tasks. These results characterize the behavior of the three exchange designs in the considered reconstruction setting.
4. Hit, Skeleton, and Combined Retrieval (Q4/W3):
We compared Hits-only, Skeleton-only, and Both under matched Flower-XL exposure. All retain encoder TSK read/write exchanges; only the final task-query memory and shared summary differ. The experiment isolates the contribution of final task-conditioned retrieval while retaining the same TSK read/write encoder across variants.
Table J: Full Flower-XL test (2,980,023 events), seed 42, three epochs, effective batch 96, before Anchor; independent task decoders. Both is the supplementary joint control, not submitted Table 2 Base.
| Retrieval | TopoAUC↑ | Ewidth(%)↓ | Dir(°)↓ | Vertex(m)↓ | Visible-y↓ |
|---|---|---|---|---|---|
| Hits-only | 0.8962 | 72.644 | 8.638 | 18.871 | 0.1014 |
| Skeleton-only | 0.9016 | 74.123 | 8.167 | 15.298 | 0.0967 |
| Both | 0.9055 | 61.832 | 7.766 | 19.082 | 0.0891 |
Combined retrieval benefits four tasks, but Skeleton-only has lower vertex error. Paired event-bootstrap 95% CIs for Both − Hits are [−10.910,−10.695] pp (energy width), [−0.882,−0.859]° (direction), and [+0.195,+0.228] m (vertex). Both − Skeleton vertex is +3.784 m (95% CI [3.770,3.800] m). Thus, gains are task-dependent; the separate equal-compute Anchor ablation supports vertex-specific geometric specialization. Hits-only did not restore the original worker RNG state; bootstrap CIs reflect event-sampling uncertainty for fixed checkpoints, not seed variability.
5. Task Definitions and Input Notation (W1)
Figure 1(e). Visible inelasticity is continuous regression, not classification: a bounded scalar output trained with Smooth-L1 loss and evaluated on CC events. Reported metrics are unaffected; we will relabel it "Visible Inelasticity Regression."
Targets. The five targets are (binary topology label), (neutrino energy), (3D incoming unit direction), (3D interaction vertex), and (continuous visible inelasticity). Topology labels do not imply universal CC/track equivalence.
Inputs. String identity denotes the sensor string associated with pulse , containing multiple optical sensors, and uses a categorical embedding. The numerical input is
(coordinates in metres; time in native units). For Flower-XL, is Linear(5,192) → LayerNorm(192) → GELU, and is Embedding(1211,192); their outputs are added. We will clarify these definitions and correct Figure 1(e) in the revised manuscript.
Thank you for the detailed response and additional experiments.
The new hit/skeleton ablations adequately address Q4. The discussion and comparisons with RIN and FIT also address much of Q3. However, Q2 and my main concern about practical scientific value remain insufficiently addressed.
-
Accuracy: PRISM matches or exceeds the best published results in only 12/136 metric cells. This substantial performance gap remains a major concern.
-
Efficiency: The reported 3.98× speedup is measured against five small specialist models constructed by the authors, rather than existing competitive reconstruction methods as I suggested. The external baseline comparisons report inference costs without corresponding accuracy comparisons. Therefore, the experiments still do not answer whether PRISM offers a competitive accuracy–efficiency trade-off against existing methods.
I therefore maintain my original rating
Follow-up response
Thank you for the follow-up and for clarifying the remaining concerns.
External specialist accuracy–efficiency comparison. To address Q2, we have completed additional comparisons with official NuBench specialist architectures, including DynEdge, GRIT, ParticleNet, and DeepIce. Unlike our earlier PRISM-based single-task controls, these are independently designed reconstruction methods. We evaluate reconstruction accuracy on the same 2,980,023 Flower-XL test events and measure inference costs on an RTX A6000 (FP32, TF32 disabled, batch 32).
| Setting | Dir (°) ↓ | Vertex (m) ↓ | Low-E width (%) ↓ | Topo AUC ↑ | Visible-y ↓ | Latency (ms/event) ↓ |
|---|---|---|---|---|---|---|
| Joint PRISM | 8.054 | 10.196 | 123.25 | 0.9027 | 0.0913 | 5.814 |
| 5 DynEdge | 5.018 | 6.744 | 208.39 | 0.8887 | 0.0942 | 13.682 |
| 4 GRIT + DynEdge-D | 5.018 | 33.348 | 119.72 | 0.8994 | 0.0675 | 29.121 |
| Fixed mixed specialists* | 3.478 | 6.744 | 116.57 | 0.8994 | 0.0675 | 103.008 |
The fixed mixed portfolio combines DeepIce (direction), DynEdge (vertex), ParticleNet (energy), and GRIT (topology and visible-y). Accuracy uses full-test released/frozen predictions. Latency includes native preprocessing, graph construction, data transfer, and forward inference under a common serial CPU protocol.
Accuracy–efficiency trade-off. PRISM achieves lower serial five-output pipeline latency, while the external specialists provide stronger reconstruction on several objectives, particularly direction and vertex. These results characterize the task-dependent accuracy–cost trade-offs between unified reconstruction and dedicated specialist approaches. The corresponding comparisons are presented in Appendix G, Figure 4.
Scientific contribution. Performance gaps to published best results remain, particularly for direction and vertex reconstruction. Beyond computational efficiency, PRISM investigates a central question in unified scientific reconstruction: how to share event-level information while preserving task-specific evidence for heterogeneous physical targets. Our task-subset experiments reveal non-monotonic transfer between objectives, while hit/skeleton retrieval ablations demonstrate differing information requirements. These findings support PRISM's task-aware retrieval and structural specialization, while offering empirical insights into the interplay between shared event representations and task-specific information requirements in unified event reconstruction.
Response to Reviewer V1dc (Part 1/2)
1. Practical and Scientific Value (Q1/W5):
Practical value. Neutrino-event analyses often require multiple physical observables from the same detector event. PRISM provides all five reconstruction outputs through a single shared forward pass, avoiding repeated event encoding across independently trained task-specific networks. On Flower-XL, it achieves better reconstruction accuracy than the evaluated small-specialist controls while reducing five-output FP32 inference latency by 3.98× (8.420 vs. 33.497 ms/event). This offers a practical alternative for multi-output reconstruction pipelines where inference throughput and shared computation are important.
Scientific value. Beyond computational efficiency, PRISM provides insight into how heterogeneous physical reconstruction tasks should share and retrieve information. Our task-subset experiments reveal non-monotonic transfer between objectives, while hit/skeleton retrieval ablations show that different targets benefit from different representations. These findings motivate PRISM's three-level design: shared event representation, task-aware information retrieval, and targeted geometric specialization. Thus, PRISM contributes a framework for investigating how shared physical evidence can support distinct reconstruction objectives, rather than merely combining five prediction heads.
Benchmark positioning. On the published NuBench reference envelope, PRISM matches or exceeds the best reported results in 12/136 metric cells, primarily in topology and energy. Strong single-task references retain advantages in several direction and vertex regimes. These results distinguish PRISM's contribution from single-task SOTA optimization: its focus is jointly reconstructing heterogeneous observables through shared computation while maintaining competitive performance in selected reconstruction tasks.
2. Multi-Task Baselines and Inference Efficiency (Q2/W4):
The submitted five-copy comparison in Table 1(c) measures duplicated computation. We additionally evaluated a pooled multi-task baseline, independent specialists, and retained external implementations.
Pooled baseline. Submitted Table 2 uses the same six-layer local encoder without TSK/task queries, with masked mean pooling and five linear heads (seeds 42/43).
Table G: Original seed-42 checkpoints; Batch-32 FP32 timing on RTX A6000, PyTorch 2.5.1/CUDA 12.4 (128 events, 50 warm-ups, five repeats, ≥200 synchronized calls; transfers excluded). GFLOPs count matrix operations only.
Compared with conventional pooled multi-task reconstruction, PRISM substantially improves energy, direction, and vertex accuracy, at a higher parameter and inference cost. The comparison quantifies the accuracy–efficiency trade-off between the evaluated shared-encoder architectures.
Independent specialists. Five separately trained small models were pruned of unused branches; outputs were unchanged on 128 checked events at Batch 1/32 in FP32/FP16.
Table H: Batch-32 five-output inference after matched 20k-update vertex-only Anchor refinement, with sequential specialists on one GPU. FP16 uses autocast.
Joint PRISM achieves 3.98× FP32 and 4.91× FP16 inference speedups over sequential specialists. The FP32 results also favor joint reconstruction across all five tasks after Anchor refinement. The comparison uses 7.845M vs. 6.117M deployed parameters, FP16 results concern latency only.
External implementations. Under a separate RTX A6000/PyTorch 2.1/CUDA 11.8 FP32 protocol, Batch-32 forward costs (parameters; ms/event) were PRISM (7.845M; 5.459), DeepIce (115.351M; 64.110), DynEdge (1.358M; 0.248), and ParticleNet (0.326M; 0.239). These measurements illustrate the computational diversity of existing reconstruction architectures: lightweight GNNs have substantially lower single-model inference latency, whereas larger architectures such as DeepIce incur higher costs. Table H separately evaluates the five-output inference setting with independently trained specialists, providing direct evidence of PRISM's computational sharing benefit.