- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes P2PQ, a supervised shallow product-quantization framework for cross-modal retrieval. Its central design shares each subspace codebook with the corresponding semantic regression weights, making the number of codewords equal to the label dimension. The framework jointly learns modality-specific projections, orthogonal transformations, shared semantic factors, and quantized database representations. A label-guided affinity objective is evaluated implicitly without materializing a dense similarity matrix. Optimization alternates between continuous and discrete updates, and retrieval uses continuous query representations against quantized database codes. Experiments cover three benchmarks, four code lengths, component ablations, parameter sensitivity, training time, and an additional deep-feature setting.
Critical strengths
The shared codebook/regression parameterization provides a concrete mechanism for incorporating semantic supervision into quantization prototypes. The implicit computation of label-guided affinities also avoids storing an explicit N × N similarity matrix, which is practically useful for full-batch supervised retrieval.
The reported retrieval improvements are substantial and consistent. In Table 1, P2PQ outperforms the strongest displayed baseline in all 24 dataset/direction/code-length settings, with improvements ranging from 1.11 to 9.34 percentage points. The additional deep-feature comparison suggests that the framework can also benefit from stronger input representations.
Critical weaknesses
The evidence does not sufficiently isolate the central contribution. The main comparison includes hashing baselines but omits directly related quantization methods. Prior work such as ACQH already combines quantization with label supervision, making the specific benefit of the proposed parameter sharing important to establish. However, P2PQ-2 removes both alignment and regression, while P2PQ-3 changes both the affinity objective and database encoding. Neither isolates sharing the codebook and regression weights. The absence of retrieval-time and complete storage comparisons also limits the claimed accuracy–efficiency advantage.
The stated objective has an unresolved scaling issue. With the other variables fixed, the feasible transformation Z_p → Z_p/a, H → H/a², and S_p → aS_p leaves the regression loss, affinity loss, and query representations unchanged. However, it reduces the alignment loss by a⁻² and the H regularizer by a⁻⁴. Thus, objective reduction can occur without improving the retrieval representation. The provided formulation and algorithm do not specify factor normalization or bounds that prevent this behavior, weakening the interpretation of the optimization and convergence results.
Questions for authors
Could you clarify the distinction from prior supervised quantization approaches such as ACQH, and explain how the existing ablations establish the benefit of sharing W_m? A controlled variant with the same codebook cardinality c, features, affinity objective, and retrieval rule, but separate quantization prototypes and regression weights, would be informative. A comparison in one existing 32-bit setting would provide a focused way to address this concern.
Does the implementation normalize or bound Z_p, H, or S_p during training? Under the constraints stated in Eq. (6), Z_p → Z_p/a, H → H/a², and S_p → aS_p can reduce the objective while preserving the retrieval representations. Please document any additional normalization in the formulation and Algorithm 1, or explain how this scaling behavior is handled and how the convergence curves should be interpreted.
At matched stored code lengths, could you clarify the retrieval trade-off relative to binary hashing, including codebook storage, query projection, lookup-table construction, and database distance computation? Table 3 reports training time only. A concrete cost breakdown for one existing 32-bit configuration would help establish the scope of the efficiency claim and distinguish asymptotic training complexity from practical search efficiency.