- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies how to reconstruct the internal state of an executed branch in a hybrid recurrent language model using a completed sibling branch without access to their shared initial state. Building on the affine update structure of Gated DeltaNet, the authors propose Direct Factor Difference (DFD) and Scalar Subspace Residual (SSR) representations, together with headwise fallback and lossless repair mechanisms.
Experiments on Qwen3.5-4B demonstrate exact state recovery with lossless repair and reduced storage requirements for short branches, at the cost of additional computation. The authors also evaluate reconstruction fidelity, scalability with branch length, transfer costs, and downstream continuation.
Critical strengths
1. A well-motivated reconstruction problem with a clear structural solution.
The paper addresses a practical problem in multi-branch LLM execution: recovering a branch from an available sibling state without retaining their common starting state. By exploiting Gated DeltaNet's update structure, the method enables compact state reconstruction without inverting the target transition operator.
2. Strong lossless recovery results.
The repaired DFD-H method achieves bit-exact recovery and identical continuations across all 64 evaluated endpoints. For short branches, its median record size is only 29.1% of canonical lossless Full. The evaluation includes relevant baselines and fidelity analyses, while acknowledging additional computation and reduced compression efficiency for longer branches.
Critical weaknesses
1. The end-to-end practical benefit remains unclear.
Despite reducing record size, repaired DFD-H incurs 1.044 times the local cost of canonical lossless Full and 6.638 times that of Raw Full. The reported latency improvements concern approximate variants under different protocols, rather than the final lossless method. Actual network transfer costs and the memory overhead of resident sibling states and temporary buffers are also not fully evaluated.
2. The methodological novelty and broader applicability need stronger justification.
The theoretical results largely build on established principles, with the main distinction appearing to lie in the receiver-conditioned setting. However, the prevalence of this setting in realistic serving workloads is not established. The paper's own comparisons also suggest that retaining the common fork may be more efficient when multiple candidates are involved.
Questions for authors
End-to-end efficiency.
Under what deployment conditions would repaired DFD-H outperform the strongest baselines? Could the authors estimate the break-even bandwidth while accounting for all computation and memory costs?
2 comments
The new ALFWorld results show storage savings on 25 of 100 tasks after accounting for the reference state, and the 100-request replay directly addresses my question about end-to-end latency. For the eight requests that required sibling-only recovery, the workflow was still slower than both full-state baselines at 1 Gbit/s, so I am keeping my rating.
Final exact efficiency, reference costs and the contribution of the factors
Thank you for emphasizing the link between compact records and complete recovery cost. This helped focus the implementation changes and the new comparisons.
Implementation improvements. The implementation now groups FP32 prediction, packs tensors contiguously, compresses in parallel and overlaps prediction with repair decoding. Owned buffers remove duplicate copies. The recovery principle is unchanged: decay matching, captured branch factors and lossless repair under the same sibling-only receiver condition. Applicable optimizations also serve the baselines (Table 50, p.49).
Measured gains. On top of packing, grouped prediction and parallel coding, owned buffers and receiver overlap reduce lifecycle time at 5/8 matched endpoints at 1 Gbit/s. Reductions are 15.5% at the fixed two-token endpoint and 13.6% at the four-token endpoint, with identical wire streams and predictor hashes (Table 51, p.50). At 500 Mbit/s with a resident receiver sibling, the optimized implementation has median paired time reductions of 15.9% versus raw Full, 25.0% versus canonical lossless Full and 41.4% versus decay-scaled sibling XOR. It beats all five baselines on 40/48 short endpoints (Table 53, p.50).
Added experiments. New comparisons cover exact transfer, a 100-request handoff, complete candidate libraries and the decay-scaled sibling control.
1. Complete recovery cost and the break-even range.
The optimized DFD-H implementation with lossless repair (DFD-R) gives these median paired lifecycle ratios, including encoding, actual transfer, restoration and fresh forward:
The measurements bracket the change in ranking against raw Full between 500 Mbit/s and 1 Gbit/s. At 1 Gbit/s, DFD-R retains lower paired median cost than both compressed comparators shown above. Timing charges required branch execution/capture and uses paced TCP loopback, starting with a resident receiver sibling (Table 3, p.7; Table 53, p.50).
All 64 endpoints preserve native bits, fresh logits and continuations.
2. Are staging, reference storage and the fork alternative accounted for?
The new 100-request replay charges candidate generation, initial staging, selection, capture, transfer and restoration. Eight requests trigger sibling-only recovery, all exact. Within those eight at 1 Gbit/s, paired workflow time ratios are 1.295 to raw Full, 1.116 to canonical Full and 0.917 to scaled XOR (§U.1, Table 58, p.53).
The handoff anchor occupies approximately 55.7 MB of logical cache state (§T.6, p.52). Separately, complete-library accounting includes references, shared fields, the index and every candidate record. Across eight four-candidate groups, totals are 760.4 MB for DFD-R, 1,678.3 MB for raw Full and 1,435.6 MB for scaled XOR. Temporary-buffer peak memory was not separately measured (§T.5, Table 56, p.52).
Fork layouts have lower aggregate storage when reference placement is free, consistent with the submitted §6.2 (p.9). The new exact comparison includes fork-plus-token replay and fork-plus-factors with repair under the same storage accounting. In the measured handoff, the fork stays at the producer while the receiver holds a completed candidate. DFD restores another branch from that available candidate without obtaining the fork (§U.1, p.53).
3. What is the added methodological and practical value?
The construction turns a completed sibling into an inverse-free reference for exact branch recovery. Decay matching cancels shared history; captured factors encode branch-specific updates, and lossless repair restores native bits (§3, pp.3–5).
The added decay-scaled sibling XOR control (SX) tests the factors directly. Complete DFD-R records have a median paired byte ratio of 0.300 to SX, with a 95% prompt-cluster interval of [0.287, 0.329], and are smaller at every short endpoint (§T.1, Table 49, p.48).
The ALFWorld archive study finds storage benefits on 25/100 tasks using complete action candidates. Within those 25, median complete-library savings are 17.59% against canonical Full and 19.22% against SX, including anchor costs. Fig.2 (p.10) and §U.2 (pp.53–54) report the per-task measurements.
Data and code: Display inputs are in
data/rebuttal/andrebuttal_artifact/, with regeneration scripts inscripts/.rebuttal/EVIDENCE_LOCATIONS.txtlists the raw measurements and execution code. Revised page numbers refer to the 54-page manuscript.