- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SRIF-BLS for cross-domain cross-modal hashing, using a labeled auxiliary domain to support retrieval in an unlabeled target domain. The framework combines transferred representations and semantic relations with CLIP-based weak semantic guidance. An expandable broad learning hashing layer is adapted through QR-based ridge refitting followed by gradient-based semantic optimization. The appendix establishes that the expansion update recovers the exact ridge solution for a fixed feature-and-target snapshot. Experiments evaluate both transfer directions between MIRFlickr-25K and NUS-WIDE, three hash lengths, and several component ablations.
Critical strengths
The framework provides a concrete way to combine auxiliary-domain knowledge with target-domain semantic guidance without requiring directly matched class indices. The reported ablations suggest that relation transfer and transferred initialization contribute beyond the target semantic graph, making the integration potentially useful for supervision-scarce retrieval.
The QR update is specified with an appropriately limited theoretical guarantee. The paper explicitly refreshes the factor state when encoder features change and distinguishes exact ridge refitting from optimization of the semantic objective. Experiments also cover both transfer directions, with the full method achieving the highest reported mAP in 10 of the 12 dataset/direction/hash-length settings.
Critical weaknesses
The model-selection protocol raises a substantive evaluation concern. Section 4.1 states that target-domain retrieval mAP is evaluated every epoch and used for model selection, but no independent validation split is described. The released implementation evaluates target_test_dl using ground-truth query and retrieval labels and saves the checkpoint with the highest resulting score. Unless the reported experiments used an additional, undocumented validation split, this introduces test-set feedback into checkpoint selection. It therefore weakens the evidence for generalization under the stated unlabeled-target setting.
The empirical evidence does not sufficiently isolate or quantify the claimed advantages. The “w/o IF-BLS” variant is described only as “conventional optimization,” leaving unclear whether width expansion, initialization, and training budgets are matched. No runtime, peak-memory, or numerical-accuracy comparisons substantiate the efficiency claims, including the cost of rebuilding the old QR state. Baseline feature and supervision comparability is also insufficiently documented. These omissions matter because several gains are small: on MIRFlickr, the improvements over the strongest listed baseline are only 0.10–0.28 percentage points in four settings, while the method underperforms that baseline at 64-bit text-to-image retrieval. Only one random seed is reported.
Questions for authors
Could you provide a compact table identifying each method’s image/text features, pretrained backbone, access to auxiliary and target labels, and use of CLIP-derived semantic information? Please also specify how the candidate vocabulary is constructed and which split supplies its text. If the strongest baselines use different features or semantic resources, a matched comparison with CDTH or VTM-UCH at one representative hash length would help establish whether the improvement comes from the proposed framework.
What exactly changes in “w/o IF-BLS”? Are node widths, expansion schedules, binary targets, ridge coefficients, and subsequent optimization matched? On one existing expansion snapshot, could you compare the proposed update with a direct batch ridge solve, reporting solution agreement or residuals, runtime, and peak memory? Please include snapshot collection and old-factor reconstruction in the timing. This would distinguish the benefit of analytical refitting and added capacity from the benefit of the incremental solver itself.
Evaluation independence and controlled BLS comparison
We thank the reviewer for examining evaluation independence, semantic resources, and the traditional BLS comparison. The revised manuscript reports a fixed-schedule five-seed evaluation and matched expansion-snapshot solver measurements.
Q1. Model selection and seed stability. Tables 1–2 report the final epoch-40 checkpoint. Intermediate checkpoints were saved on the fixed schedule; the highest mAP displayed in earlier logs monitored retrieval accuracy and did not determine the reported checkpoint. We additionally ran a pre-specified 40-epoch target schedule with expansions at epochs 10 and 20; the epoch-40 checkpoint was fixed before evaluation loaded query and retrieval labels. Across five target-adaptation seeds, two-direction mean mAP is 75.29 ± 0.34% on MIRFlickr-25K and 68.95 ± 0.48% on NUS-WIDE (mean ± sample standard deviation, with a fixed source checkpoint in each transfer direction). On NUS-WIDE, the I→T and T→I means exceed the strongest corresponding baselines by 1.84 and 1.03 percentage points. Appendix A.7 reports these results separately from the single-run main tables.
Q2. Feature and supervision resources. SRIF-BLS uses L2-normalized 512-dimensional CLIP ViT-B/32 image and text embeddings. Source-domain labels supervise auxiliary training; target-domain hash learning uses paired examples without target training labels. For the target weak graph, we directly adopt the fixed candidate-term embedding files
flickr_tags_tr.matandnus_tags_tr.matfrom the CDTH authors' public code and take the firstTopKcandidates. Our target protocol uses 2,000 query pairs and 5,000 training pairs sampled from the retrieval set. This shared candidate resource makes CDTH the closest comparison for source-to-target semantic transfer. VTM-UCH supplies a complementary CLIP-based unsupervised hashing comparison.Q3. Traditional BLS and controlled solver comparison. We renamed the earlier w/o IF-BLS ablation row Traditional BLS to identify the comparison directly: it uses pseudoinverse-based incremental updating. It retains the broad hashing layer and the scheduled widths 912 → 1176 → 1440, with expansions at epochs 10 and 20. SRIF-BLS instead rebuilds the current old-width R factor, updates it for the appended nodes, and solves triangular systems. The ablation compares their retrieval outcomes; Appendix A.8 directly compares the update algorithms on recorded expansion snapshots.
Across four real 32-bit events, SRIF-BLS and full QR use the same expanded design matrix, binary targets, ridge coefficient ρ=10−4, and float64 arithmetic. SRIF-BLS includes old-factor reconstruction in its measurement. Its maximum relative output-weight difference from the full QR ridge solution is 1.83 × 10⁻¹⁰; its maximum absolute relative objective difference is 3.99 × 10⁻¹⁶. Cumulative solver times are 981.9 ms for SRIF-BLS, 1187.2 ms for full QR, and 8066.3 ms for traditional pseudoinverse updating. Thus SRIF-BLS is 8.21× faster than the traditional update at the solver stage, with 7.87–9.09% lower peak allocated GPU memory.