- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Degradation-aware Dynamic Adaptation (DDA), a one-step, unpaired low-light image enhancement (LLIE) method built on a pretrained diffusion image-translation backbone. Its Degradation-aware Prior Generation (DPG) module extracts illumination, color, and structure descriptors and selects an expert to produce an image-specific embedding. The Degradation-Driven State-Glimpse (DDSG) adapter combines this embedding with compact statistics of the base image-conditioning key/value projections to generate low-rank, sample-dependent updates. Training uses the CycleGAN-Turbo-style unpaired adversarial and cycle-consistency objectives. The paper reports improvements on LOL-v2-real and LSRW, downstream recognition benchmarks, and additional no-reference datasets.
Critical strengths
- The paper identifies the limitation of shared image-conditioning projections for heterogeneous low-light degradations and proposes a reasonably cohesive combination of explicit degradation priors, expert fusion, and low-rank dynamic projection updates.
- On LOL-v2-real, DDA reports 22.17 dB PSNR / 0.8201 SSIM / 0.1743 LPIPS, versus 21.32 / 0.8073 / 0.1928 for the closely related GEFU baseline. The submission also evaluates LSRW and three downstream tasks.
- The ablations test DPG and DDSG components, individual prior types and views, and MoLE/multiple-adapter alternatives. Appendix Table 8 provides paired significance tests against GEFU, and Table 10 includes no-reference evaluation on five additional datasets. These are valuable additions and should be acknowledged.
Critical weaknesses
- The novelty of DDA requires further clarification, as several of its key components have been explored in prior work. GEFU (ICCV 2025) adapts pretrained diffusion models for unsupervised LLIE; LLDiffusion (PR 2025) incorporates degradation representations into diffusion-based LLIE; MoR-DASR (AAAI 2026) employs degradation-aware low-rank expert routing; and HyperLoRA (EMNLP 2024) generates low-rank adapters using hypernetworks. Although DDA combines illumination/color/structure priors through top-1 expert fusion with projection-weight statistics to generate dynamic K/V updates, its methodological novelty beyond existing approaches remains insufficiently demonstrated. Despite the comparisons in Appendix Table 9, more targeted and capacity-matched comparisons are needed to clarify its distinctive contributions.
- The base K/V matrices are fixed during inference, so their encoded descriptors are fixed for each projection layer; they do not themselves change with the input. In this sense, the descriptors can serve as layer-specific conditioning signals rather than evidence that the generated update is intrinsically compatible with the matrix it modifies. Table 3 already includes constant-state and learned layer-ID controls, which is helpful; nevertheless, these comparisons do not directly establish why the chosen weight statistics are essential. Permuting the descriptors across layers or comparing with parameter-matched learned per-layer codes would provide a clearer causal test.
- Appendix Fig. 5 shows that the cosine distance between generated K/V updates grows when gamma, saturation, or noise perturbations increase for the same image. This demonstrates sensitivity to controlled changes, but not that the representation isolates degradation from image content or that the resulting adaptation is selectively beneficial for each degradation type. A generic image-conditioned hypernetwork might also produce similar trends. The paper would be more convincing with cross-content controls, a degradation-blind capacity-matched dynamic adapter, and an analysis linking the predicted adaptation to improvements under each degradation.
- The method introduces three prior encoders, expert routing, weight-state encoders, and dynamic low-rank generators. Table 2 provides task-dependent inference times, but not trainable parameter counts, FLOPs, peak GPU memory, or training cost for DDA and GEFU. In particular, ACDC runtime increases from 0.94 s (GEFU) to 1.15 s (DDA), approximately 22%, which deserves explicit discussion when describing the overhead as modest. Appendix Table 9 controls the backbone, training data, and insertion points for MoLE and multiple adapters, but the relative parameter budgets are not reported.
- DPG uses four hard top-1 experts, yet the paper does not report selection frequencies, expert collapse/balance statistics, or whether assignments correlate with the three degradation factors. Moreover, the stated target includes spatially non-uniform illumination, while the type-specific representations are globally pooled before routing. It would be useful to assess images with localized/compound degradations and provide failure cases. Appendix Table 10 also shows a decrease in CLIP-IQA on NPE (0.5396 to 0.5144), which should be discussed rather than only emphasizing mean gains.
Questions for authors
Q1. Could the authors explicitly position DDA against GEFU, LLDiffusion, MoR-DASR, and hypernetwork-generated LoRA methods such as HyperLoRA, distinguishing conceptual novelty from a new combination of existing components? In particular, what is uniquely enabled by jointly conditioning on degradation-prior embeddings and fixed K/V weight statistics, rather than by (i) degradation-conditioned expert selection or (ii) an equally sized input-conditioned hypernetwork without weight-state descriptors? A concise mechanism-level comparison and parameter-matched ablations on the same LLIE backbone would be valuable. Please distinguish the differences in task setting (e.g., MoR-DASR addresses SR and HyperLoRA addresses NLP) rather than presenting them as direct LLIE equivalents. Q2. Can you demonstrate that DDSG changes are specifically associated with degradation rather than general visual content? For example, keep degradation fixed while changing scene content, compare against a similarly sized image-conditioned hypernetwork without DPG, and report performance by dominant degradation category. Q3. Since the pretrained base projections are fixed, can you clarify what is uniquely gained by using the four weight statistics in Eqs. (8)–(9), beyond assigning each layer a distinct embedding? How would performance change if the weight-state vectors were shuffled between layers or replaced with equally sized learned per-layer vectors? Q4 Could you provide matched parameter counts, FLOPs, peak inference memory, and training/inference costs for GEFU, the complete DDA, and the Appendix Table 9 adapter alternatives, measured under the same input resolution and hardware? Please also clarify whether all Table 1 competitors were retrained or taken from prior reports. Q5. What fraction of inputs is routed to each of the four experts? Do the expert assignments correlate with the offline degradation proportions defined in Appendix Eqs. (29)–(32), and does the expert routing remain stable across cameras or localized illumination variations? Q6. AGLLDiff is discussed as a related pretrained-diffusion LLIE method (Section 2), but is absent from the quantitative comparisons. Could the authors explain the omission or provide a comparable result where the test protocol permits?
7 comments
W3&Q2: Degradation versus image content
(1) Cross-content control. We acknowledge that our original analysis does not explicitly disentangle degradation from image content. However, applying identical synthetic perturbations across different scenes cannot guarantee equivalent degradation characteristics due to their inherent differences. We therefore conduct an alternative cross-scene analysis to examine whether a shared degradation factor induces consistent dynamic adaptation across different contents. Specifically, we apply the same gamma transformation to 100 normal-light reference images from LOL-v2-real and measure the mean pairwise cosine distance between their V-projection updates. For , the distances decrease from 0.12062 to 0.07667 and 0.03767, respectively. This indicates that stronger common darkening leads to increasingly aligned update directions across different scenes, supporting the role of degradation in driving dynamic adaptation.
(2) Degradation-blind dynamic adapter. To assess the benefit of explicit degradation modeling over generic image-conditioned adaptation, we replace DPG and DDSG with a learned RGB encoder and an input-conditioned hypernetwork (RGB+Hypernet), respectively, while maintaining the same number of trainable parameters as DDA (242.87M). DDA outperforms this baseline on LOL-v2-real by 1.29 dB PSNR and 0.0378 SSIM, supporting the effectiveness of our degradation-aware design.
(3) Performance across degradation types. We further group LOL-v2-real test images by their dominant degradation following Eqs. (29)–(32). As shown below, DDA consistently outperforms both Learned RGB+Hypernet and GEFU across illumination-, color-, and structure-dominant subsets, achieving PSNR gains of 1.13/1.75/0.89 dB over RGB+Hypernet and 1.22/0.24/1.19 dB over GEFU, respectively. These results demonstrate consistent enhancement benefits across different degradation types, without assuming strict independence from image content.
| Degradation | N | Method | PSNR ↑ | SSIM ↑ |
|---|---|---|---|---|
| Illumination | 33 | DDA (Ours) | 22.06 | 0.8380 |
| Learned RGB+Hypernet | 20.93 | 0.8052 | ||
| GEFU | 20.84 | 0.8248 | ||
| Color | 37 | DDA (Ours) | 22.12 | 0.7978 |
| Learned RGB+Hypernet | 20.37 | 0.7458 | ||
| GEFU | 21.88 | 0.7945 | ||
| Structure | 30 | DDA (Ours) | 22.35 | 0.8278 |
| Learned RGB+Hypernet | 21.46 | 0.8021 | ||
| GEFU | 21.16 | 0.8037 | ||
| Overall | 100 | DDA (Ours) | 22.17 | 0.8201 |
| Learned RGB+Hypernet | 20.88 | 0.7823 | ||
| GEFU | 21.32 | 0.8073 |
W2&Q3: Contribution of weight-state information
(1) Projection-specific guidance. We agree that the pretrained K/V projections remain fixed during inference, making their weight-state embeddings constant for each projection. However, these descriptors capture projection-specific weight characteristics rather than merely encoding layer identities. By combining them with the input-dependent degradation prior , DDSG generates degradation-conditioned updates guided by the characteristics of each target projection.
(2) Weight-state shuffling. To verify the importance of the correspondence between weight-state descriptors and their target projections, we further conduct a Weight-state Shuffling experiment. Specifically, we randomly permute the weight-state embeddings across projection layers, keep the permutation fixed throughout training, and retrain the model from scratch under otherwise identical settings. This preserves model capacity and weight-state information while disrupting their correspondence with the target projections. As shown below, shuffling reduces PSNR/SSIM from 22.17/0.8201 to 21.66/0.8039, corresponding to decreases of 0.51 dB/0.0162. Importantly, although the shuffled embeddings can still serve as unique layer identifiers, they no longer describe the actual weight characteristics of their assigned target projections. Even when DDSG is allowed to learn from scratch under this fixed reassignment, the performance degradation persists. Together with the learned Layer-ID baseline, this suggests that correctly aligned projection statistics provide a more effective inductive bias than arbitrary layer-specific identifiers.
| Setting | PSNR ↑ | SSIM ↑ |
|---|---|---|
| Constant Weight State | 21.62 | 0.7838 |
| Learned Layer-ID Embedding | 21.49 | 0.7944 |
| Weight-State Shuffling | 21.66 | 0.8039 |
| Full DDA (Ours) | 22.17 | 0.8201 |
W1 & Q1: Distinction from Existing Methods.
Response: We thank the reviewer for the constructive suggestion. We clarify the conceptual novelty of DDA and provide parameter-matched comparisons below.
(1) Novelty and Mechanism-Level Comparison. DDA's novelty lies in jointly conditioning dynamic K/V updates on degradation priors and target projection-weight states, rather than simply combining existing components. Specifically, (a) Unlike GEFU [6], which uses fixed image-conditioning K/V projections, DDA adapts them per input; unlike LLDiffusion [1], which learns degradation representations through joint generation and enhancement, DPG explicitly constructs and fuses multi-view degradation priors to drive projection adaptation. (b) Unlike degradation-conditioned expert routing (MoLE [2], MoR-DASR [3]), which selects or combines predefined LoRA updates, DDSG generates input-specific updates conditioned on both degradation and target projection states. (c) Unlike input-conditioned hypernetworks without weight-state descriptors (HyperLoRA [4]), DDSG explicitly incorporates fixed K/V weight statistics to tailor updates to the target projections. Neither alternative explicitly models this joint conditioning, although similar mechanisms could in principle be constructed by extending them. MoR-DASR (SR) and HyperLoRA (NLP) are included only for mechanism-level comparison, not as direct LLIE equivalents.
(2) Parameter-Matched Ablations. Full DDA outperforms all parameter-matched alternatives on the same LLIE backbone. Since the original MoLE and multiple-adapter baselines in Appendix Table 9 use only 31.41M and 107.16M trainable parameters, respectively, compared with DDA's 242.87M, we introduce three capacity-matched variants under identical training and evaluation settings on LOL-v2-real [7]. The comparisons isolate the contributions of update generation, target-weight conditioning, and degradation representation.
These results support the benefit of jointly incorporating explicit degradation priors and target projection states, rather than relying solely on expert routing or input-conditioned update generation.