Organizations: National Engineering Research Center for Multimedia Software, Institute of Artificial Intelligence, School of Computer Science, Wuhan University · Hubei Key Laboratory of Multimedia and Network Communication Engineering · School of Computer Science, Wuhan University, Wuhan, China · Zhongguancun Academy, Beijing, China. 100094 · School of Artificial Intelligence and Automation, Huazhong University of Science and Technology
The learning order of semantic classes significantly impacts unsupervised domain adaptation for semantic segmentation, especially under adverse weather conditions. Most existing curricula rely on handcrafted heuristics (e.g., fixed uncertainty metrics) and follow a static schedule, which fails to adapt to a model's evolving, high-dimensional training dynamics, leading to category bias. Inspired by Reinforcement Learning, we cast curriculum learning as a sequential decision problem and propose an autonomous class scheduler. This scheduler consists of two components: (i) a high-dimensional state encoder that maps the model's training status into a latent space and distills key features indicative of progress, and (ii) a category-fair policy-gradient objective that ensures balanced improvement across classes. Coupled with mixed source-target supervision, the learned class rankings direct the network's focus to the most informative classes at each stage, enabling more adaptive and dynamic learning. It is worth noting that our method achieves state-of-the-art performance on three widely used benchmarks (e.g., ACDC, Dark Zurich, and Nighttime Driving) and shows generalization ability in synthetic-to-real semantic segmentation.
Figures & tables
Figure 1: From design curriculum to self-paced learning. Traditional Curriculum Learning (CL) and Hard Class Mining (HCM) both rely on fixed handcrafted priors and fixed learning paths. CL adopts a static, easy-to-hard curriculum, while HCM focuses solely on difficult classes. Both strategies induce class bias, manifesting as significant accuracy discrepancies across semantic classes. Differently, we adaptively mine the most informative classes via dynamically perceived models’ evolving ( S : Source domain, T : Target domain, Mn : the n -th intermediate domain, Cn : the n -th Semantic Class).
Figure 2: The framework of our designed Heuristic Semantic Class Mining (HeuSCM). First, a Gaussian Mixture VAE (GM-VAE) encodes high-dimensional semantic states into latent features zts . Our SKFEN processes zts to distill key features reflecting the model’s learning status. Conditioned on these features, ClassGen outputs ranked classes (sorted in descending order of informational value). These rankings guide the generation of mixed image and mixed label pairs, which optimize the segmentation model via SegLoss. Concurrently, we maximize the objective JF(π) to jointly optimize the copied GM-VAE encoder, SKFEN, and ClassGen.
Method
Backbone
road
sidewalk
building
wall
fence
pole
traffic light
traffic sign
vegetation
terrain
sky
person
rider
car
truck
bus
train
motorcycle
bicycle
mIoU
DeepLab-v2 [ 5 ]
DeepLab-v2
71.9
26.2
51.1
18.8
22.5
19.7
33.0
27.7
67.9
28.6
44.2
43.1
22.1
71.2
29.8
33.3
48.4
26.2
35.8
38.0
Refign [ 3 ]
DeepLab-v2
49.5
56.7
79.8
31.2
25.7
34.1
48.0
48.7
76.2
42.5
38.5
48.3
24.7
75.8
46.5
43.9
64.3
34.1
43.6
48.0
CMA [ 2 ]
DeepLab-v2
83.1
52.7
65.4
18.7
30.5
44.5
56.3
53.9
76.7
39.7
79.0
54.2
31.2
76.7
40.2
39.3
47.4
29.8
38.6
50.4
CompUDA [ 35 ]
DeepLab-v2
52.4
54.5
75.6
30.6
26.8
35.6
44.7
47.8
74.5
40.5
39.1
45.1
20.6
76.3
47.2
40.5
64.9
36.2
36.2
47.0
VBLC [ 14 ]
DeepLab-v2
49.6
39.3
79.4
35.8
29.5
42.6
57.2
57.5
69.1
42.7
39.8
54.5
29.3
77.8
43.0
36.2
32.7
38.7
53.4
47.8
ATP [ 29 ]
DeepLab-v2
76.2
47.3
71.4
42.7
31.4
44.2
55.4
62.0
89.0
34.7
79.1
49.9
16.6
77.5
30.0
19.7
47.7
44.0
39.4
50.5
Table 1: Comparison of the state-of-the-art in Cityscapes → ACDC domain adaptation on the ACDC test set. The best results are presented in bold.
Method
Backbone
road
sidewalk
building
wall
fence
pole
traffic light
traffic sign
vegetation
terrain
sky
person
rider
car
truck
bus
train
motorcycle
bicycle
mIoU
DeepLab-v2 [ 5 ]
DeepLab-v2
69.5
15.3
52.4
11.0
12.0
25.4
48.2
39.6
68.3
24.2
69.0
40.1
15.2
64.7
14.2
19.8
28.8
21.8
17.2
34.6
Refign [ 3 ]
DeepLab-v2
91.5
67.5
81.4
43.8
32.5
43.0
66.4
50.1
82.1
35.0
93.3
47.7
27.4
78.7
52.4
51.8
64.1
13.9
37.7
55.8
CMA [ 2 ]
DeepLab-v2
83.9
51.3
60.1
25.3
28.2
45.6
69.1
52.3
79.0
30.1
79.2
51.5
23.5
77.4
43.4
37.0
36.2
24.9
28.6
48.8
VBLC [ 14 ]
DeepLab-v2
50.0
42.5
73.6
34.5
26.3
48.0
65.6
55.1
67.8
33.3
39.1
56.3
39.6
80.8
45.7
28.2
29.9
31.8
25.6
46.0
HeuSCM (Ours)
DeepLabv2
92.7
69.1
81.0
43.9
34.0
42.8
65.9
48.8
81.6
35.6
93.3
47.3
24.9
79.4
55.5
55.5
62.0
14.4
37.5
56.1
DAFormer [ 9 ]
DAFormer
71.4
50.0
79.1
42.1
33.1
55.5
40.0
50.0
72.2
35.4
68.2
54.3
17.5
83.0
71.2
74.8
80.9
41.2
31.5
55.3
Table 2: Comparison of the state-of-the-art in Cityscapes → ACDC domain adaptation on the ACDC val set. The best results are presented in bold.
Figure 3: The qualitative comparison between our method and existing state-of-the-art methods based on DeepLabV2, DAFormer, and HRDA on the ACDC val. Compared with the existing state-of-the-art UDA method ( e.g., Refign, CMA, VBLC, ACSegFormer), our method achieves better performance under the same backbone. Importantly, our method, based on HRDA, achieves the best performance, with predictions closely matching the ground truth, validating the effectiveness of our method.
Figure 4: A qualitative comparison between our method and existing state-of-the-art approaches based on DAFormer and HRDA is conducted on the Dark Zurich val (Top two rows) and Nighttime Driving test (Bottom two rows).
Method
Backbone
Dark Zurich-val
Nighttime Driving
mIoU
mIoU
DAFormer [ 9 ]
DAFormer
37.1
54.0
InforMS [ 27 ]
DAFormer
45.1
56.0
HeuSCM (Ours)
DAFormer
45.5
56.7
HRDA [ 10 ]
HRDA
42.1
54.1
InforMS [ 27 ]
HRDA
52.5
58.5
Table 3: Comparison with state-of-the-art methods on the Dark Zurich-val set and Nighttime Driving test set.
LSRL
✓
✓
✓
✓
SKFEN
✓
✓
✓
✓
C α PG
✓
✓
✓
✓
mIoU
71.1 (+0.0)
72.2 (+1.1)
71.7 (+0.6)
71.6 (+0.5)
72.3 (+1.2)
72.0 (+0.9)
72.2 (+1.1)
72.7 (+1.6)
Table 4: Ablation Study on several model variants of our method on the ACDC val. LSRL, SKFEN, C α PG are Low-dimensional State Representation Learning in 3.1.1 , Semantic Key Feature Extraction Network in 3.1.2 , Categorical α -Fairness for Policy Gradients in 3.2 , respectively.
Method
Backbone
GTA5 → Cityscapes
mIoU
IAST [ 20 ]
Deeplab-v2
52.2
IAST + HCSP (Ours)
Deeplab-v2
52.4
HIAST [ 37 ]
Deeplab-v2
56.3
HIAST + HCSP (Ours)
Deeplab-v2
56.5
Table 5: Comparison of semantic segmentation performance on GTA5 → Cityscapes on the Cityscapes validation set. Best results are in bold .
Unsupervised domain adaptation (UDA) for semantic segmentation remains challenging under adverse weather conditions because severe appearance changes enlarge the domain gap and degrade the reliability of pseudo labels in the target domain. To address this problem, we propose an Intra-Class Mixing Consistency (ICM) framework that enforces prediction consistency between an intra-class mixed image and its original counterpart. Unlike previous mixing-based consistency methods that combine regions across different images or domains and may introduce unrealistic semantic inconsistencies, ICM performs mixing within the same image and semantic class, preserving realistic semantic layout for consistency regularization. With ICM, we establish a new state-of-the-art performance for clear-to-adverse-weather unsupervised domain adaptation (UDA) in semantic segmentation. On the Cityscapes → ACDC benchmark, our method achieves 75.7% mIoU, outperforming the previous state of the art by +1.9 pp, demonstrating its effectiveness in mitigating class confusion under challenging environmental conditions. The code is provided in the supplementary material.
This paper describes our approach for the 8th UG2+ Workshop (CVPR 2026) Track~2, which targets semantic segmentation of outdoor scenes degraded by five weather conditions: blur, darkness, snow, haze, and glare. A central challenge we observe is a severe generalization gap -- models that perform well on the validation set often collapse on the test set. For instance, SegFormer-B5 drops 16.1 mIoU points from validation to test, suggesting that model capacity alone is insufficient for robustness. We investigate whether a carefully designed training recipe, rather than architectural complexity, can address this gap. Starting from a pre-trained SegMAN-S backbone, we systematically study the effects of domain-adaptive fine-tuning, multi-source data mixing, scene-balanced sampling, and synthetic degradation augmentation. Our final system achieves 59.9% mIoU on the official test set while maintaining a validation-test gap of only 6.5 points -- less than half that of larger models. We analyze negative results from architectural modifications, loss function variants, and model scaling to provide practical insights for weather-robust segmentation under limited data.
Evolving data streams induce joint nonstationarity in continual semantic segmentation, where semantic classes, input distributions, and supervision availability change simultaneously over time. This setting reflects practical structured prediction systems, yet remains largely unexplored in prior continual learning work, which typically studies these factors in isolation. We formalize continual segmentation under coupled class, domain, and label shifts and investigate learning in heterogeneous dense prediction environments with limited annotations and abundant unlabeled data. To address instability and overfitting arising from few-shot supervision under distribution drift, we introduce gradient-adaptive stabilization, a parameter-wise regularization mechanism implemented via gradient-scaled stochastic perturbations that promotes a principled stability-plasticity tradeoff. We further leverage unlabeled data through semi-supervised learning and introduce prototype anchored supervision that validates pseudo-labels via joint confidence and prototype consistency. Together, these mechanisms enable learning under joint nonstationarity in continual segmentation. Extensive empirical evaluation across class-incremental, domain-incremental, and few-shot regimes demonstrates consistent improvements over prior methods in heterogeneous structured prediction settings. Our results expose fundamental failure modes of existing continual segmentation approaches and provide insight into learning robust dense predictors in dynamically evolving environments.
Prashant Pandey, Himanshu Kumar, Devineni Sri Venkatraya Chowdary +1
Bharti School of Telecommunications Technology & Management, Indian Institute of Technology, Delhi, India · Yardi School of Artificial Intelligence, Indian Institute of Technology, Delhi, India · Department of Computer Science and Engineering, Indian Institute of Technology (Indian School of Mines), Dhanbad, India