- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Conditional Dual-Path Adapter Reconstruction (CODAR) for parameter-efficient adaptation of image-text models under known modality-availability states. It reconstructs both low-rank factors from reusable dictionaries through state-conditioned routing, combining modality-specific dictionaries with a cross-tower shared input-side dictionary. A CP-based generator amortizes routing parameters across modules. The paper analyzes cross-state update geometry, derives a reconstruction lower bound for fixed shared rank-r geometry, and establishes a constructive representational separation for CODAR. Evaluation on three classification benchmarks with CLIP ViT-B/16 reports consistent improvements over reproduced PEFT baselines and a parameter-matched conditional control, using 101,116 trainable adapter parameters. Ablations, geometric diagnostics, and cross-scenario experiments provide additional validation.
Critical strengths
A focused problem formulation supported by geometric evidence. The paper asks whether modality availability should change the row and column subspaces of a PEFT update. Cross-state versus cross-seed comparisons and energy-weighted spectral deficits provide an informative motivation. The constructive theorem connects this motivation to the proposed parameterization while explicitly limiting its scope to representation. This is a useful contribution to understanding missing-modality adaptation.
Critical weaknesses
- Limited methodological novelty and significance. The methodological contribution appears incremental. CODAR combines state conditioning, dictionary-based low-rank factor reconstruction, and modality-specific/shared pathways, building closely on existing PEFT mechanisms such as VB-LoRA and MoRA. The availability-dependent geometric perspective is useful, but the theoretical separation is established against fixed shared geometry and does not distinguish CODAR from other conditional low-rank parameterizations. Although the controlled experiments report consistent improvements, the gains over the parameter-matched conditional baseline are relatively modest, and the main evaluation remains concentrated on one CLIP backbone and three classification benchmarks. Consequently, the current evidence provides limited support for the broader significance of this particular architectural combination.
- The supervision protocol limits the interpretation of training-time missing-modality robustness. Algorithm A2 computes complete-input teacher predictions for examples assigned a missing state. Thus, training retains access to the modality hidden from the student. This is a valid possible protocol for artificial modality dropout, but its applicability to genuinely incomplete training data requires qualification. StateCondLoRA receives the same distillation objective, and Table A11 includes a no-distillation ablation; these are useful controls. However, equivalent training-information access for the other principal baselines is not explicit, leaving uncertainty about the scope and interpretation of some comparisons. The discrepancy between minibatch state sampling in Algorithm A2 and fixed masks in Appendix C further needs resolution.
Questions for authors
- Clarification of the principal baseline: Please provide the exact StateCondLoRA factor-generation equations, output dimensions, parameter-count breakdown, and initialization. Does a nonzero base factor or offset prevent both A and B from being zero? Please verify that the adapter receives a nonzero learning signal at the start of training. This answer directly affects my confidence in the parameter-matched comparison.
- Assessment-critical supervision comparison: Given the complete-input teacher access in Algorithm A2, please state which reproduced baselines receive equivalent information and objectives. Building on the existing no-distillation ablation, can you report a matched comparison of CODAR, StateCondLoRA, and MoRA in which originally hidden modalities are unavailable to all methods during training? Alternatively, please explicitly restrict the relevant claims to training with recoverable complete pairs. This would clarify both the applicability and attribution of the reported gains.
- Clarification of state assignment: Appendix C states that missing masks remain fixed across epochs, whereas Algorithm A2 samples a state for each example within each minibatch. Which protocol produced the reported results? Please specify the protocol for the main comparisons and the StateSpecificLoRA diagnostic, since it determines state-specific data exposure.