- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The author propose a method that pool and project the source representations plus an intermediate decision state, estimate how useful each source is via a normalized bilinear interaction, and then keep a subset based on cumulative softmax utility coverage.
The improvements on LIBERO-Plus and CALVIN are consistent across five different VLA configurations, and they come with lower source-routing ratios, so it's not just trading accuracy for sparsity's sake.
Critical strengths
The proposed module is lightweight and potentially useful for adapting existing policies without updating pretrained weights.
The paper appropriately distinguishes source RR from token counts and FLOPs, acknowledges retained encoding cost and earlier information influence, and avoids interpreting leave-one-out sensitivity as causal source importance.
The usefulness of heterogeneous sources may change during task execution, and source-level routing offers a meaningful perspective beyond pruning visual tokens alone.
Critical weaknesses
Inconsistency between method and experiment:
Eq. (21) selects source i when u_i > λ_cost c_i. Table 16 gives positive costs, and Appendix C.3 states that the sweeps reuse the same estimator and the same decision-step sample set. Under these conditions, increasing λ_cost cannot increase the number of selected sources. The highest-utility fallback for an empty selection does not change this cardinality monotonicity.
Nevertheless, Table 15 reports RR=0.29 at λ_cost=0 and RR=0.55 at λ_cost=0.10. These values cannot both follow from the specified rule on fixed scores and shared samples. Please explain whether this is a table error, a different implementation, or a change in evaluation samples/scores. This directly affects the interpretation of the cost-aware sweep, although it does not by itself establish an error in the default Adaptive-Budget results.
Experiment:
Existing controls do not fully isolate dynamic source selection. Removing the decision state changes RR from 0.47 to 0.58, random routing is not budget-matched, and the soft variant changes both retention and scaling.
The appendix's Top-K comparison is useful, but a limited comparison against a static or task-conditioned router at a similar budget, and random selection matched to the retained-source count, would better establish the value of decision-state-conditioned routing. Please also clarify the inference operator used by the soft-routing ablation.
Questions for authors
Does the advantage persist against a budget-matched static/task-conditioned router and random selection? What exactly is the soft-routing inference operator?
Response to Reviewer zfKQ
We thank the reviewer for the careful assessment and constructive suggestions. We particularly appreciate the reviewer's recognition that the Cost-Aware reporting issue does not necessarily affect the default Adaptive-Budget results. We address the two concerns below.
1. Clarification of the Cost-Aware Routing Results
We agree with the reviewer's mathematical observation regarding the monotonicity of Cost-Aware routing. Under fixed utility scores, positive source costs, and identical evaluation samples, increasing λ_cost cannot increase the number of selected sources, including under the highest-utility fallback. Importantly, this issue is confined to the auxiliary Cost-Aware sensitivity analysis and does not affect the definition of the default Adaptive-Budget algorithm (Eq. 6). The main experiments use Adaptive-Budget routing with ρ = 0.70 and do not depend on λ_cost. Moreover, the positive-cost operating points (λ_cost = 0.10–0.40) exhibit the expected decreasing RR trend. We will clarify the reporting issue without extending conclusions from this auxiliary analysis to the primary method.
2. Effectiveness of Decision-State-Conditioned Routing
We agree that budget-matched comparisons are valuable for isolating the contribution of dynamic source selection. Nevertheless, the existing experiments already provide relevant evidence that learned, decision-conditioned routing outperforms fixed-budget source selection.
In Appendix C.3, we evaluate Top-K routing using the same trained utility estimator. The comparison includes the following operating points on LIBERO-Plus with π0.5:
DataRouter achieves 88.7% SR at RR = 0.47, outperforming fixed-budget Top-K (87.1% at RR = 0.50) while retaining slightly fewer sources. This comparison supports the benefit of adapting the source budget rather than imposing a fixed number of retained sources.
Additionally, removing decision-state conditioning reduces SR from 88.7% to 85.9%, while replacing learned utility matching with cosine similarity reduces SR to 86.8%. These results support the importance of the complete decision-conditioned routing mechanism.
Soft-routing operator. The soft-routing ablation replaces hard source selection with continuous source weighting. Specifically, the normalized utility weights are applied to the corresponding source representations, while all source groups remain active during downstream prediction. Consequently, RR = 1.00. This variant achieves 86.2% SR, compared with 88.7% for hard Adaptive-Budget routing.
Summary
We appreciate the identification of the Cost-Aware reporting inconsistency and will correct it. However, this auxiliary issue is separate from the default Adaptive-Budget method and its main empirical results.
We hope these clarifications address the reviewer's concerns and encourage reconsideration of the overall assessment.