- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper analyzes how linear and weighted-power scalarizations redistribute gradients over identical block residuals. It derives an exact log-odds allocation law, matching conditions, ranking-reversal criteria, and a Jacobian Gram identity for shared-encoder transmission. Experiments on Energy, Parkinsons, and CelebA-40 examine these mechanisms and downstream task trade-offs.
Critical strengths
-
The mathematical analysis is precise. The log-odds law separates weight mismatch from exponent mismatch and residual heterogeneity, providing a clear characterization of gradient reallocation and equivalence conditions.
-
The empirical reporting is transparent. The authors distinguish numerical consistency checks from independent evidence and acknowledge task trade-offs and checkpoint-selection sensitivity rather than claiming universal improvements.
Critical weaknesses
-
The incremental contribution and downstream significance remain uncertain. Several results follow directly from scalarization derivatives or the chain rule. Without scale-matched retraining or simple task-reweighting controls, the independent contribution of relative gradient allocation to training outcomes remains unclear.
-
The downstream evidence is limited. Training endpoints rely mainly on two regression datasets with fixed splits and ten seeds, while CelebA-40 provides common-state diagnostics rather than endpoint comparisons. On Parkinsons, validation selection usually chooses epoch 0, weakening the fixed-budget findings.
Questions for authors
-
Do the downstream task trade-offs persist against scale-matched objectives and simpler linear task-reweighting baselines?
-
Can the authors demonstrate that the observed endpoint effects remain robust across additional data splits or training budgets?