- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper works on solving heterogenous continual binary segmentation task, where both the image domain and the foreground type changes over the stages of training. Motivated by the observation that a shared learner underperforms under heterogeneous condition, the paper places parameter-isolated expert per each tasks, and a task-agnostic selector to decide the domain type to map the expert. The framework achieves better segmentation performance compared to traditional continual learning methods.
Critical strengths
The paper proposes a concrete framework that solves heterogenous continual binary segmentation task, with variety of experiments revealing the failure cases and ablation of each components.
Critical weaknesses
The main concern of the paper is on its novelty. The design of the framework is straightforward from extending SOYO [1]'s parameter selection to expert selection, with standard expert design that does not solve any new visible challenges that raises from the continual setting. The challenges and the corresponding solutions should be clearly stated to identify the contribution of the paper, but it is currently a combination of existing methods without representing what hard problems the paper has solved.
Another is on the outdated baseline methods, as only traditional CL methods (LwF, EWC, ER) are compared. The methods cited in the paper could also be evaluated comparably, including non-continual setups only for evaluation, such as CoSAM [2] (segment anything methods). Other related works not cited in this paper worth being compared to, including Spider [3] that uses a context-based single model, and EVP [4] which uses explicit visual prompts for segmentation on various domains.
[1] Wang, Q., Song, X., He, Y., Han, J., Ding, C., Gao, X., & Gong, Y. (2025, June). Boosting domain incremental learning: Selecting the optimal parameters is all you need. In 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (pp. 4839-4849). IEEE.
[2] Yang, J., Wu, Y., Cen, J., Huang, W., Wang, H., & Zhang, J. (2024). Continual learning for segment anything model adaptation. arXiv preprint arXiv:2412.06418.
[3] Zhao, X., Pang, Y., Ji, W., Sheng, B., Zuo, J., Zhang, L., & Lu, H. (2024). Spider: A unified framework for context-dependent concept segmentation. In Forty-first International Conference on Machine Learning (ICML).
[4] Liu, W., Shen, X., Pun, C. M., & Cun, X. (2023, June). Explicit visual prompting for low-level structure segmentations. In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (pp. 19434-19445). IEEE.
Questions for authors
-
On whether single shared pathway is actually insufficient. The paper is motivated from the finding that base methods fails on heterogenous task, but there aren't sufficient comparison between state-of-the-art single-path methods empirically, and the claim may not generalize to other experimental settings. Can the claim be further supported?
-
What are the main challenges of the problem and the solutions? Currently, the paper combines a series of straightforward techniques from existing works without noticeable modifications or advancements. Please pinpoint them in the paper clearly to better reveal your paper's strength and contributions.