- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies task-aware precision allocation for multi-source collaborative inference. It derives parameter-to-output perturbation bounds and rate-distortion bounds under an exponential parameter-magnitude model, then combines Shapley-based source contributions with parameter statistics to guide bit-width allocation. Experiments on image-region classification tasks report improvements over equal-bit allocation and performance close to exhaustive search, with additional evaluation under latency and energy constraints.
Critical strengths
-
The paper studies how to allocate limited precision across sources that contribute unequally to the task, which is a relevant problem for compression in collaborative inference.
-
The allocation rule combines source contributions with parameter statistics in a simple and interpretable form. Once these quantities are estimated, the allocation itself is cheap to compute.
-
In the reported experiments, the method outperforms equal-bit allocation and comes close to exhaustive search.
Critical weaknesses
-
The theory does not connect source contributions to quantization sensitivity. Proposition 1 uses coefficients , whereas Proposition 2 defines (Eq. 21) using Shapley weights , without establishing a relationship between them. The surrogate also aggregates parameters across layers without accounting for their different sensitivities. Moreover, Eq. 18 relies on a first-order approximation without controlling the remainder. Although parameter distortion is presented as a surrogate, the claims about what determines precision requirements extend beyond the analysis.
-
The allocation rule optimizes only the lower bound. Minimizing does not generally minimize actual distortion or preserve configuration rankings. Thus, the uniform-precision optimality condition applies to the lower-bound surrogate, not necessarily to task performance. At high rates, could support an approximation argument, but its applicability at low bit-widths is not established. Algorithm 1 also leaves the distortion objective unspecified, while Appendix F uses .
-
The connection between the rate-distortion bounds and practical quantizers is insufficiently justified. The upper bound concerns the Shannon rate-distortion function and need not bound uniform or K-means quantization error. Since the theoretical source is , the mapping from magnitude-coding rate to the bit-width of signed weights also needs clarification. Figure 5 labels the bounds as “Fitted”; if they are fitted to measured distortion rather than computed from independently estimated , their agreement provides limited validation.
-
The baselines do not isolate the source of improvement. Section 6.2 states that the branches have similar parameter statistics, so allocation may be driven primarily by . Figure 1 also assigns zero bits to one source, effectively removing it. Comparisons with Shapley-only allocation, direct quantization-sensitivity allocation, and source pruning followed by equal-bit allocation are needed to distinguish the benefits of the proposed framework from simpler alternatives.
-
The efficiency and deployment claims need further evidence. Table 1 does not clarify whether allocation time includes Shapley estimation, which requires coalition evaluations. The “no repeated inference” claim should therefore be qualified. Appendix F assumes latency and energy scale linearly with bit-width, but it is unclear whether Table 2 uses modeled or measured constraints. Supported kernels, hardware measurements, and the treatment of communication costs should be specified.
Minor issues
- Figure 1 reports a Shapley value of 0.35 for source 3, whereas Figure 3 and the text report 0.45.
- Figure 2(d) is labeled GPT-3, but the cited model is GPT-Neo 125M.
- Appendix E (line number 859) contains a broken reference (“Figures 11 and ??”).
- Appendix C claims that Shapley contributions “naturally capture” unique, redundant, and synergistic information, but no formal connection to these PID components is established.
Questions for authors
My main concerns are the missing link between the sensitivity analysis and the Shapley-weighted surrogate, and the lack of ablations showing that the framework adds value beyond Shapley-based allocation or pruning. I would consider raising my score if the authors can address the weaknesses above and answer the two questions below convincingly.
-
In Figure 5, are the curves labeled "Fitted " and "Fitted " computed directly from Eq. 4 using estimated from the weights, or are they fitted to the measured distortion? Please also report the estimated for each source and explain how they were obtained.
-
Since Section 6.2 states that all sources have similar parameter statistics, how does the proposed method compare with (i) allocating bits based on alone, and (ii) removing sources with near-zero contribution and then using equal bit-widths for the rest, under the same budgets as in Table 1?