- Rating
- 2
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes NADS, a stochastic segmentation framework that generates diverse predictions through input-conditioned architecture sampling. It combines evolutionary search, shared-weight subnetworks, and a GED-based surrogate loss. Experiments on multiple benchmarks demonstrate promising performance.
Critical strengths
1.The paper explores an interesting alternative to conventional latent-variable-based stochastic segmentation by introducing input-conditioned architecture sampling. 2.The combination of architecture sampling and set-level supervision is well-motivated, aiming to balance prediction diversity and segmentation quality.
Critical weaknesses
1.The theoretical properties of the modified GED loss are insufficiently justified, particularly regarding the soft-IoU distance and its role in encouraging prediction diversity. 2.The method incurs substantial computational costs, with 387M parameters and approximately 35 hours of search and training, limiting its practical scalability. 3.The comparisons with recent methods are insufficient, particularly in Table 2, which lacks representative and state-of-the-art stochastic segmentation methods. Therefore, it remains unclear whether the proposed method consistently outperforms the latest approaches.
Questions for authors
- How does NADS fundamentally differ from conditional MoE methods, and what specific advantages does architecture-level sampling offer over conventional conditional routing?
- How is GED computed during evolutionary search when the architecture is fixed to a specific genotype? 3.Given the limitations of the soft-IoU distance, how does the proposed GED surrogate ensure effective distribution matching and prevent mode collapse?