- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper studies how separately compressed inputs can support reconstruction of interactions between modalities. For independent Gaussian factors and product targets, it derives reconstruction-error formulas and an average-rate coding characterization, then uses these results to motivate token-budget allocation. Experiments include synthetic checks and a small frozen-OpenCLIP study on Flickr8k.
Critical strengths
The paper explicitly states several limitations of its theoretical guarantees and includes proofs and numerical checks of the mathematical predictions.
Critical weaknesses
The submission does not establish a sufficiently significant contribution for ICLR.
First main weakness: The familiar two-factor setup threshold is inherited from prior work [1], while the importance of the higher-order and unequal-rate extensions is insufficiently demonstrated. Several additional components, including dynamic programming and allocation through standard optimization, provide limited methodological novelty.
Second main weakness: the presentation makes the contribution unnecessarily difficult to assess. Definitions are deferred, terminology is dense and not adequately explained. The lack of overall clarity is apparent from the abstract, which fails to communicate the main objectives, methodology, and contributions of the paper in a comprehensible manner. The abstract introduces several symbols and technical terms without adequately defining or explaining them. For instance, what do , MMSE, , , and represent? While the reviewer does not claim to be an expert in this specific domain, the abstract appears unnecessarily difficult to follow, potentially even for readers with substantial expertise in the field. This raises concerns also about the overall clarity and organization of the manuscript. No figures are present in the paper, which is not a substantial form of concerns but they would help in better understanding some concepts and formulations.
Minor weaknesses: The connection to practical multimodal tokenizers remains weak. The exact results rely on independent Gaussian factors, product targets, and an architecture that prohibits message reuse across interaction tasks. The real-data experiment does not validate these assumptions or demonstrate a convincing downstream benefit. In Table 7, for example the proposed allocation performs worse than specific-only allocation on retrieval at larger budgets.
The claimed practical error certificate is also insufficiently justified: disagreement between validation subsets does not establish the population estimation-error bound required by the theorem.
[1] O. Ordentlich and Y. Polyanskiy, "Optimal Quantization for Matrix Multiplication," 2025 IEEE International Symposium on Information Theory (ISIT), Ann Arbor, MI, USA, 2025, pp. 1-6, doi: 10.1109/ISIT63088.2025.11195544. keywords: {Lower bound;Vector quantization;Large language models;Loading;Rate-distortion;Lattices;Machine learning;Approximation error;Decoding;Compression algorithms},
Questions for authors
Could the authors clarify the paper’s main novel contributions relative to prior work and explain the practical implications of the analysis? Concrete examples of how the theoretical results inform token-allocation decisions would be particularly helpful.