- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes CSM-VL (Conditional Subspace Matryoshka for Vision-Language Embeddings). It extends Matryoshka Representation Learning with input-dependent ordering of learned dimension groups, preserving nested vision-language embeddings across dimensional budgets. Its two auxiliary objectives prioritize groups by their contribution to contrastive learning and reduce redundant cross-modal interactions. Experiments on 11 MMEB datasets across four vision-language backbones generally demonstrate improved accuracy–dimensionality trade-offs over MRL, ESE, and MIPIC, especially at compact budgets. Ablations support the complementary benefits of both objectives, with reported training overhead of approximately 5–14% over MRL.
Critical strengths
- A useful framework for adaptive multimodal embeddings. CSM-VL combines learned dimension groups, input-dependent ordering, and nested representations within a unified framework. This addresses a meaningful limitation of fixed-prefix embeddings: different multimodal inputs may require different information under the same dimensional budget.
- Encouraging empirical coverage. Evaluation across four backbones and 11 datasets generally shows improved performance at compact embedding budgets. The auxiliary-objective ablations provide additional support for the framework, suggesting potential benefits across multiple model architectures.
Critical weaknesses
- Insufficient differentiation from closely related work. DIME [1] and Learning to Select [2] already explore query-dependent dimension selection, while SMEC [3] introduces learnable selection into Matryoshka compression. Without discussing or comparing these approaches, the paper does not sufficiently establish the novelty of its specific combination of grouping, routing, and multimodal objectives.
- Limited evidence isolating the central contribution. The experiments support the complete framework, but do not clearly establish how much improvement comes from input-dependent allocation versus auxiliary training objectives. Stronger comparisons with simpler selection and ordering strategies would help demonstrate why the proposed mechanism is necessary.
- Practical efficiency benefits remain insufficiently demonstrated. The motivation emphasizes reduced storage and retrieval costs, whereas the main evidence concerns accuracy at different embedding dimensions. Evaluation of actual memory usage, inference latency, and large-scale retrieval would be needed to establish the practical advantages of conditional subspace selection.
[1] Guglielmo Faggioli, Nicola Ferro, Raffaele Perego, and Nicola Tonellotto. 2024. Dimension Importance Estimation for Dense Information Retrieval. In Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 1318–1328. ACM.
[2] Zhanyu Wu, Richong Zhang, and Zhijie Nie. 2026. Learning to Select: Query-Aware Adaptive Dimension Selection for Dense Retrieval. In Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 18666–18677. Association for Computational Linguistics.
[3] Biao Zhang, Lixin Chen, Tong Liu, and Bo Zheng. 2025. SMEC: Rethinking Matryoshka Representation Learning for Retrieval Embedding Compression. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing, pages 26209–26222. Association for Computational Linguistics.
Questions for authors
See weakness.