1. Limited methodological novelty
The screening construction builds on an established optimal-threshold formula for linear-fractional metrics. The inclusion certificate follows from an upper bound of one on the optimal score, while the exclusion certificate uses lower bounds obtained from three inexpensive feasible masks. I therefore find the conceptual increment relatively limited: the main contribution is a particular application of existing threshold structure and objective-value bounds to pre-sort screening. Although computationally useful, the manuscript does not sufficiently establish the nontrivial advance over existing results or explain whether the proposed certificates offer substantially stronger guarantees or tighter screening.
2. Incomplete support for mutually exclusive multiclass segmentation
The framework is formulated for binary decoding, and the medical experiments handle multiple foreground classes through independent binary optimizations rather than joint decoding under a mutual-exclusivity constraint. Consequently, the method does not itself guarantee a valid mutually exclusive multiclass label map. If independently decoded masks overlap, additional conflict resolution is necessary and may alter the per-class objective values. The paper should report the frequency of these conflicts, explain how final multiclass predictions are constructed, and evaluate the resulting impact on segmentation quality and computational cost.
3. Unestablished end-to-end deployment benefit
The reported speedups concern decoding and mask reconstruction, excluding network inference, I/O, and host-to-device transfer. For example, lung tumour decoding decreases from 20.86 ms to 2.92 ms, saving approximately 17.94 ms per call; without the decoder’s share of total pipeline latency, the overall application benefit remains unclear. Similarly, memory measurements report additional allocations beyond the resident probability tensor and CUDA context rather than full-pipeline peak memory. A complete pipeline profile, together with evidence of increased throughput, higher concurrency, or larger processable volumes on the same hardware, is needed to substantiate the practical deployment significance.
4. Limited comparison against equivalently optimized alternative solvers
The paper includes relevant Dinkelbach baselines and separates screening gains from additional Triton implementation gains. However, the solver comparison uses standard PyTorch operations and focuses on a highly screenable synthetic distribution. It therefore remains unclear whether the advantage persists against an equivalently optimized sort-free backend across less favorable workloads. Comparing fused, memory-efficient Dinkelbach implementations under identical timing boundaries and output requirements would strengthen the evidence that the proposed certificates provide a robust practical advantage beyond the evaluated implementations.