- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
HARP combines horizon-dependent target-layer fusion with repair-branch allocation based on prefix survival, alternative-token probability, and recoverable continuation. It keeps model weights frozen and reports a 19.7% throughput improvement over chain verification on Qwen3-4B/DFlash.
Critical strengths
1.Interesting motivation. Horizon-dependent representation preferences provide a useful perspective on parallel drafting, supported by probes and source-layer interventions. 2. Clear repair-value analysis. The first-mismatch decomposition explains why alternative-token confidence alone is insufficient for allocating repair branches. 3. Relevant empirical evaluation. The paper includes end-to-end timing, a representation-by-allocation factorial study, and comparisons with recent tree methods.
Critical weaknesses
-
The central representation intervention is underspecified. DFlash conditions on target features through cached K/V representations. Equation (4) does not explain how different draft horizons access differently fused context features within one frozen drafter pass. The attention routing, cache organization, actual fusion coefficients, and associated overhead are needed to reproduce this contribution.
-
The representation-regret argument is not valid as stated. Equation (1) compares a multi-layer composition against the best individual layer, so the difference need not be nonnegative. Different single-layer preferences also do not imply that shared fusion necessarily discards useful information. These claims require correction, although the empirical observations may remain valid.
-
Experimental scope and reporting need clarification. The full 19.7% gain is demonstrated on 100 prompts for one target–drafter pair. Cross-system results use shared representations and therefore primarily validate branch allocation. Additionally, Table 3 reports different draft accuracies under “identical proposals”; this requires clarification regarding whether statistics use fixed prefixes or method-specific online trajectories.
-
Numerical divergence is insufficiently controlled. Only 42% of 1024-token outputs match sequential decoding exactly in BF16. This does not itself establish quality degradation, but observing divergence across all methods does not demonstrate that comparisons are unbiased. Per-method output agreement, task quality, and output-length statistics would help establish the reliability of the speed comparisons.
Questions for authors
- How is horizon-specific conditioning implemented through DFlash’s attention and KV cache without additional drafter passes?
- Which reported statistics use identical fixed prefixes, and which use independently visited online states?
- Do the throughput gains persist under stronger numerical-equivalence controls, and are downstream task scores comparable?