Pith. sign in

REVIEW 4 major objections 5 minor 41 references

The paper claims that a frozen language model can be turned into a multi-stream generator that coordinates its parallel decoding lanes through shared latent notes, recovering near-serial coherence without fine-tuning the base weights.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review

2026-08-03 17:15 UTC pith:FYXJAW7F

load-bearing objection A genuinely novel parallel-decoding architecture in the abstract, but the body is a different, unfinished paper with a missing proof and unstable numbers. the 4 major comments →

arxiv 2512.10054 v3 pith:FYXJAW7F submitted 2025-12-10 cs.AI cs.CL

Parallel Decoder Transformer: Planner-Conditioned Latent Coordination for Model-Intrinsic Parallel Generation

Logan Robbins This is my paper
classification cs.AI cs.CL
keywords parallel decodingmulti-stream generationspeculative note conditioningfrozen backboneparameter-efficient fine-tuningcoherence driftcoverage predictionlatent coordination
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper is trying to establish that parallel text generation can be made intrinsic to the model: rather than orchestrating several calls around a black-box LLM, a single architecture can hold multiple causal frontiers and coordinate them through a shared latent notes bus, without retraining the base weights. The payoff would be parallel decoding with the coherence of serial generation, at a fraction of the fine-tuning cost. The author reports a 50,000-step run on a frozen 20-billion-parameter backbone that reached 77.8% precision in coverage prediction, though an accompanying passage describes the paper as a theory-and-protocol contribution with empirical evaluation still in progress. If the architecture works as claimed, it would let long structured documents be written concurrently by one model, each lane following its own plan while staying consistent with its siblings.

Core claim

The central claim is that a pretrained transformer with frozen weights can be turned into a system with K parallel decoding lanes, each generating a different section, by inserting lightweight Speculative Note Conditioning (SNC) adapters. In each synchronized round, every lane produces one next-token distribution for its own frontier; lanes are conditionally independent given the source text, their per-lane plans, private histories, and previously committed notes. Sibling lanes broadcast compressed semantic notes to a shared bus, and each lane attends to those notes through a zero-initialized gate, so the frozen trunk is identity at the start of training and gradually learns to use cross-str

What carries the argument

The load-bearing object is the SNC adapter set: a cross-attention layer reading from a shared 'note bus' of compressed latent messages, a zero-initialized scalar gate that keeps the frozen trunk unchanged at initialization, and an agreement head that turns a trust score into a discrete rollback decision. A planner produces per-stream outlines that are held as persistent Plan-KV memory, so each lane knows its own section. The claim is that this small trainable set — under 5% of the total parameters — carries the whole coordination load, letting the model own multiple causal frontiers in one forward pass.

Load-bearing premise

The entire coherence claim rests on the assertion that parallel lanes with speculative notes recover approximate serial semantics with bounded error — a proof that Section 4.3 says is in Appendix A, but Appendix A contains no theorem or argument; if that bounded-divergence guarantee cannot be supplied or is false, the central claim that PDT preserves serial coherence collapses.

What would settle it

Run the released code on multi-section documents with N parallel lanes and compute the per-token cross-entropy gap between the parallel output and the serial output of the same frozen base model on the same prompt: the bounded-error claim predicts a small, length-independent gap, while divergence growing with sequence length would refute it. Also open Appendix A: if no actual proof appears there, the claimed guarantee is absent from the paper.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X LinkedIn Reddit HN

If this is right

  • Long structured documents could be generated concurrently by a single model with near-serial coherence, cutting latency by roughly the number of active lanes.
  • Coordination becomes a parameter-efficient add-on: the same frozen base model could be reused with different adapter sets for different parallelization schemes, without retraining the trunk.
  • The staged curriculum (planner pretrain, adapter bootstrap, notes-bus enable, stability) gives a transferable recipe for training coordination on any frozen backbone.
  • The released logit-replay and synthetic-rollback harnesses let the field test the coordination mechanics deterministically before committing to large GPU runs.
  • A concrete, falsifiable metric is provided: coverage precision on plan items, which at 77.8% suggests the coverage head is a reliable (if conservative) gatekeeper against coherence drift.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the bounded-divergence proof is not actually supplied (Appendix A contains only an artifact list), the paper's coherence claim should be read as a conjecture, not a theorem; the reported coverage precision does not by itself establish serial-semantics recovery.
  • A natural stress test: measure the divergence between parallel and serial outputs as a function of sequence length; the bounded-error claim predicts a flat or slowly growing gap, while unsupported coordination would show divergence that grows with length.
  • The same note-bus mechanism could be applied to other frozen-model tasks where multiple draft streams must synchronize, such as multi-agent simulation or speculative decoding with several drafters.
  • The very low recall (4.91%) suggests the system may under-claim coverage; an editor would want to see whether this conservatism causes the rollback mechanism to miss many true divergences, limiting practical self-correction.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes the Parallel Decoder Transformer (PDT), an architecture intended to enable model-intrinsic parallel generation by maintaining multiple causal frontiers that generate different sections concurrently. Coordination is mediated by a shared latent note bus and a Speculative Note Conditioning (SNC) mechanism, with an agreement head that triggers rollbacks. The paper claims that SNC 'recovers approximate serial semantics with bounded error' and reports a 50,000-step training run on a frozen 20B-parameter backbone, with coverage precision of 77.8% and recall of 4.91%. It also presents a multi-stage curriculum, implementation details, and reproducibility artifacts. However, the manuscript is internally inconsistent in its architectural description, the promised proof is absent, and the empirical claims contradict the abstract's disclaimer that this is 'not a positive empirical result.'

Significance. If the PDT architecture and its central invariance guarantee were rigorously established, this would be a meaningful contribution to parallel decoding, combining prompt-level decomposition with model-internal coordination and a parameter-efficient training scheme. The manuscript offers some useful design elements: a four-stage curriculum, a logit-replay harness for deterministic verification, and a synthetic simulation script for rollback clustering. These artifacts are to the paper's credit. Nevertheless, the core theoretical claim—that SNC recovers serial semantics with bounded error—is not proven, and the paper's empirical section is internally inconsistent. As written, the contribution cannot be evaluated, which is a significant shortfall for a paper that presents itself as a theory-and-design paper.

major comments (4)
  1. [§4.3, Appendix A] The central claim that SNC 'recovers approximate serial semantics with bounded error (as proven in Appendix A)' is not supported. Appendix A is an artifact summary; it contains no theorem, proof, or divergence bound. Appendix B.5 explicitly states its Lipschitz ranges are 'illustrative (replace with measurements)' and Appendix E labels its derivation as 'illustrative' and 'optimistic.' Since no formal definition of 'approximate serial semantics' is given and no quantitative bound is derived, the load-bearing guarantee that distinguishes PDT from external parallel generation is unsubstantiated.
  2. [Title/Abstract vs §3.1, §3.2] The architecture is described inconsistently. The arXiv abstract states that PDT 'retains a frozen shared lower knowledge trunk and replaces the upper trunk with three independently parameterized physical decoder stacks,' while §3.1-3.2 describe a single frozen trunk with lightweight adapters and distinct KV-caches, with no mention of replacing layers. These are different parameterizations. The formal equations in §4 and the empirical results in §6 therefore attach to an ambiguous object, making the claims untestable as written.
  3. [§1.2, §6.4, §7, Abstract] The empirical results are mutually contradictory. Contributions claim 71.6% precision, §6.4 reports 77.78%, and the full-text abstract reports 77.8%, while the arXiv abstract explicitly says the paper is 'not a positive empirical result.' Moreover, the reported validation loss of 0.00 with coverage recall of 4.91% is anomalous and not explained. With recall at 4.91%, the coverage head almost never flags an item as covered; precision on the rare positive class is uninformative about coordination quality, and the validation loss of exactly 0.00 suggests either a near-constant prediction or a possible evaluation issue. These inconsistencies need resolution before any empirical claim can be assessed.
  4. [§3.3, §6.1, §6.3, Table 1] The training-step counts are inconsistent. §6.1 says the curriculum ran for 50,000 steps, §6.3 says the SNC mechanism was trained for 30,000 steps (Stages 2 and 3), and Table 1 reports the final checkpoint 'Step 50,000.' The mapping of curriculum stages to step counts is absent, so the reader cannot tell which configuration produced the reported metrics. This impedes reproducibility.
minor comments (5)
  1. [Appendix B.3] The text references '§9.3,' but the body has only sections 1-7; this cross-reference is broken.
  2. [Figure 1] Figure 1 is described as a learning curve, and the architecture diagram appears as an placeholder, but no actual figure is included in the text. Please include the actual plots and diagram.
  3. [Throughout] The paper uses two different titles/abstracts: the arXiv title and abstract describe 'Planner-Conditioned Latent Coordination' and disclaim positive results, while the full-text title and abstract describe 'Model-Internal Parallel Decoding' and report 77.8% precision. This is confusing and should be unified.
  4. [Appendix B.5.2] The 'illustrative ranges' for Lipschitz constants are not values measured from the model; labeling them as 'replace with measurements' means they should not be presented as support for the bounded-error claim.
  5. [References] Reference [26] is a self-citation to 'Parallel decoder transformer codebase' without a URL, version, or release date. The paper promises 'we release our codebase' but provides only a Weights & Biases URL. Please provide a persistent repository link.

Circularity Check

0 steps flagged

No derivation-level circularity: the central SNC guarantee is asserted, not derived, and the only self-citation is non-load-bearing.

full rationale

The paper has almost no derivation chain that could be circular: Section 4 defines stream adapters and SNC cross-attention (Eqs. 1-4), an agreement head (Eq. 5), and then asserts the key property. Section 4.3 states that SNC allows the PDT architecture to be 'robust, recovering approximate serial semantics with bounded error (as proven in Appendix A)'; Appendix A is headed 'Artifacts summary' and lists only repository contents, so the promised proof does not exist in the manuscript. Per the reviewing rule I flag this explicitly as an omitted proof / self-referential pointer, but it is not a definitional reduction: the claim is unsupported rather than derived from the equations or reduced to a fitted parameter. The only self-citation is [26], the author's own codebase, cited for 'custom SharedNotesCrossAttention layers'; it is not load-bearing for the scientific claims. The 77.8% coverage precision is a held-out validation of the coverage_head that was trained to predict coverage flags derived from the notes; this is a weak surrogate for the serial-semantics claim but not a fitted parameter renamed as a prediction because the evaluation is on a held-out set. I find no step where an equation is equivalent to its own input, no imported uniqueness theorem, and no ansatz smuggled in via self-citation. Score 2 reflects exactly one minor, non-load-bearing self-citation; the missing Appendix A proof is a correctness/soundness risk, not an additional circularity.

Axiom & Free-Parameter Ledger

4 free parameters · 5 axioms · 3 invented entities

The central claim rests on a frozen-trunk assumption, an unproven conditional-independence/approximation premise, and internal note representations that are never validated externally. The paper also relies on a hardware OOM measurement to justify parameter efficiency, which is not evidence of semantic coordination. The invented entities (Note Bus, Plan-KV, quantized bus) have no falsifiable handles outside the architecture itself.

free parameters (4)
  • SNC gate λ (per stream/layer) = initialized via γ = -4.0; trainable
    Controls the amount of cross-stream context injected into the frozen trunk. If it stays near zero, the mechanism reduces to identity; if it grows too fast, the frozen trunk can be destabilized.
  • Agreement-head rollback threshold τ = tuned; value not reported
    Determines when a stream is pruned and regenerated. The self-correction behavior claimed in §4.3 depends critically on this threshold, but no value or tuning procedure is given.
  • Trainable modules φ (Stream Adapters, SNC projections, planner/notes/coverage/agreement heads) = trained; claimed <5% of total parameters
    All learned coordination behavior is carried by these fitted modules. Without their trained values and the corresponding data, the reported precision and loss figures cannot be interpreted.
  • GradNorm and auxiliary loss weights (λuse, λinv, λKD, λaux, λL) = defaults in Appendix B; not fitted to external data
    Optional stabilizers introduced to make training work. They are hyperparameters, not core architectural constants, but they shape the reported learning curves.
axioms (5)
  • domain assumption Frozen 20B trunk retains the full pretrained distribution after adapter and cross-attention injection.
    Section 3.1 and §4.1 freeze all trunk weights; all new behavior must be learned in φ. If the adapters or SNC gates destabilize the trunk, the central coordination claim fails.
  • ad hoc to paper Same-round lane tokens are conditionally independent given source, plans, private histories, and prior notes, and this still approximates serial semantics.
    Section 1 and §4.3 present this as the core modeling assumption. The bounded-error proof is promised in Appendix A but absent, so the approximation claim is ungrounded.
  • domain assumption A shared Note State compressed into embeddings can carry enough semantic information to prevent coherence drift.
    Section 3.2 and §4.2 assume that compressed notes preserve the facts and commitments needed for cross-lane consistency. Appendix B gives only illustrative bounds, not measurements.
  • domain assumption GPT-4-distilled tasks with teacher plans and notes contracts provide valid source-grounded supervision for historical exposition.
    Section 6.1 describes a 10,000-task dataset without construction details. The abstract mentions historical exposition with single-owner cited facts, which does not match the body's dataset description.
  • domain assumption The OOM at full fine-tuning (>290GB/device) demonstrates that parameter-efficient coordination is necessary.
    Section 6.2 and §5.2 report a hardware constraint. This supports the motivation for adapters but does not validate the semantic coordination claim.
invented entities (3)
  • Note Bus / Note State no independent evidence
    purpose: A shared dynamic latent buffer through which sibling decoders write and read compressed semantic notes, enabling cross-lane coordination without modifying the frozen trunk.
    The bus is an internal architectural mechanism. No falsifiable prediction or external measurement is attached to it; its usefulness is assessed only through the model's own coverage and agreement heads.
  • Plan-KV memory no independent evidence
    purpose: Persistent per-lane outline contexts produced by the prompt-time set planner and hard-routed to decoder stacks as conditioning keys/values.
    Mentioned in the abstract but not specified mathematically in the full text. It has no independent empirical handle in the paper.
  • Product-quantized notes bus no independent evidence
    purpose: A finite discrete-code bus intended to carry block-delayed latent messages between decoder lanes with bounded communication.
    This is the abstract's version of the bus mechanism. No product-quantization codebook, training procedure, or evaluation is provided.

reviewed 2026-08-03 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Parallel Decoder Transformer: Planner-Conditioned Latent Coordination for Model-Intrinsic Parallel Generation." pith.science (2026). https://pith.science/paper/FYXJAW7F

@misc{pith2026251210054,
  author       = {Pith},
  title        = {Pith review of: Parallel Decoder Transformer: Planner-Conditioned Latent Coordination for Model-Intrinsic Parallel Generation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FYXJAW7F}},
  note         = {Machine review of arXiv:2512.10054}
}
Share X LinkedIn Reddit HN
read the original abstract

Autoregressive language models expose one causal token frontier, even when the requested document contains sections that could be developed concurrently. Existing parallel-generation systems arrange external branches around an otherwise unchanged model. We instead formulate model-intrinsic parallel generation: a single trained architecture owns multiple causal frontiers and produces one next-token distribution for each frontier in every synchronized decoding round. The Parallel Decoder Transformer (PDT) retains a frozen shared lower knowledge trunk and replaces the upper trunk with three independently parameterized physical decoder stacks. A prompt-time set planner produces three unordered continuous outlines, each hard-routed to one decoder as persistent Plan-KV memory, while a finite product-quantized notes bus carries block-delayed latent messages among the decoders. Autoregression is preserved within each lane; same-round lane tokens are conditionally independent given the source, plans, private histories, and previously committed messages. We specify source-grounded supervision for long-form historical exposition with single-owner cited facts and token-aligned cross-lane dependencies, a composite objective, a staged curriculum, and preregistered causal evaluations: plan swap and removal, delayed-message ablation, a parameter-matched self-only control, dependency-token likelihood, and blinded human fact audits. The architecture and evaluation pipeline are implemented; scientific training and held-out evaluation are in progress. This paper presents the theory, design, and falsifiable protocol, not a positive empirical result.

Figures

Figures reproduced from arXiv: 2512.10054 by Logan Robbins.

Figure 1
Figure 1. Figure 1: Learning curve of the Coverage Mechanism (Stages 2–3). The precipitous drop in loss at Step 20k marks the [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

41 extracted references · 20 linked inside Pith

  1. [1]

    Ainslie, J

    J. Ainslie, J. Lee-Thorp, M. de Jong, Y . Zemlyanskiy, F. Lebrón, and S. Sanghai. Gqa: Training generalized multi- query transformer models from multi-head checkpoints. InProceedings of EMNLP 2023, 2023. arXiv:2305.13245

    Pith/arXiv arXiv 2023

  2. [2]

    Rezero is all you need: Fast convergence at large depth

    Thomas Bachlechner, Bodhisattwa Prasad Majumder, Henry Mao, Garrison W Cottrell, and Julian McAuley. Rezero is all you need: Fast convergence at large depth. InUncertainty in Artificial Intelligence, 2021

    2021

  3. [3]

    Beltagy, M

    I. Beltagy, M. E. Peters, and A. Cohan. Longformer: The long-document transformer.arXiv preprint arXiv:2004.05150, 2020

    Pith/arXiv arXiv 2004

  4. [4]

    Recurrent memory transformer

    Aydar Bulatov, Yuri Kuratov, and Mikhail Burtsev. Recurrent memory transformer. InNeurIPS, 2022

    2022

  5. [5]

    Cai et al

    T. Cai et al. Medusa: Simple llm inference acceleration framework with multiple decoding heads.arXiv preprint arXiv:2401.10774, 2024

    Pith/arXiv arXiv 2024

  6. [6]

    Z. Chen, V . Badrinarayanan, C.-Y . Lee, and A. Rabinovich. Gradnorm: Gradient normalization for adaptive loss balancing in deep multitask networks. InProceedings of ICML 2018, 2018. arXiv:1711.02257

    Pith/arXiv arXiv 2018

  7. [7]

    Z. Dai, Z. Yang, Y . Yang, J. Carbonell, Q. V . Le, and R. Salakhutdinov. Transformer-xl: Attentive language models beyond a fixed-length context.arXiv preprint arXiv:1901.02860, 2019

    Pith/arXiv arXiv 1901

  8. [8]

    T. Dao, D. Y . Fu, S. Ermon, A. Rudra, and C. Ré. Flashattention-2: Faster attention with better memory utilization. arXiv preprint arXiv:2307.08691, 2023

    Pith/arXiv arXiv 2023

  9. [9]

    J. Deng. Latent reasoning in llms as a vocabulary-space superposition.arXiv preprint arXiv:2510.15522, 2025

    arXiv 2025

  10. [10]

    Fazlyab, A

    M. Fazlyab, A. Robey, H. Hassani, M. Morari, and G. J. Pappas. Efficient and accurate estimation of lipschitz constants for deep neural networks. InProceedings of NeurIPS 2019, 2019. arXiv:1906.04893

    Pith/arXiv arXiv 2019

  11. [11]

    Geifman and R

    Y . Geifman and R. El-Yaniv. Selective classification for deep neural networks. InAdvances in Neural Information Processing Systems (NeurIPS 2017), 2017. arXiv:1705.08500

    Pith/arXiv arXiv 2017

  12. [12]

    Goyal et al

    A. Goyal et al. Coordination among neural modules through a shared workspace.arXiv preprint arXiv:2103.01197, 2021

    Pith/arXiv arXiv 2021

  13. [13]

    Mamba: Linear-time sequence modeling with selective state spaces.arXiv preprint arXiv:2312.00752, 2023

    Albert Gu and Tri Dao. Mamba: Linear-time sequence modeling with selective state spaces.arXiv preprint arXiv:2312.00752, 2023

    Pith/arXiv arXiv 2023

  14. [14]

    Parameter-efficient transfer learning for nlp

    Neil Houlsby, Andrei Giurgiu, Stanislaw Jastrzebski, Bruna Morri, Andrea De Coro, Sergei Vassilvitskii, Ariel Fisher, and Deep Ganguli. Parameter-efficient transfer learning for nlp. InInternational Conference on Machine Learning, 2019

    2019

  15. [15]

    Lora: Low-rank adaptation of large language models

    Edward J Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen. Lora: Low-rank adaptation of large language models. InInternational Conference on Learning Representa- tions, 2022

    2022

  16. [16]

    W. Kwon, Z. Li, S. Zhuang, Y . Sheng, L. Zheng, C. H. Yu, J. Gonzalez, H. Zhang, and I. Stoica. Efficient memory management for large language model serving with pagedattention. InProceedings of SOSP 2023, 2023. arXiv:2309.06180

    Pith/arXiv arXiv 2023

  17. [17]

    Fast inference from transformers via speculative decoding

    Yaniv Leviathan, Matan Kalman, and Yossi Matias. Fast inference from transformers via speculative decoding. In International Conference on Machine Learning, 2023

    2023

  18. [18]

    Y . Li, F. Wei, C. Zhang, and H. Zhang. Break the sequential dependency of llm inference using lookahead decoding. InProceedings of ICML 2024, 2024. arXiv:2402.02057. 8 arXiv Preprint

    Pith/arXiv arXiv 2024

  19. [19]

    Liu et al

    X. Liu et al. Pslm: Parallel generation of text and speech with llms. InFindings of EMNLP 2024, 2024

    2024

  20. [20]

    Liu et al

    X. Liu et al. Chunkkv: Semantic-preserving kv cache compression for efficient long-context llm inference.arXiv preprint arXiv:2502.00299, 2025

    arXiv 2025

  21. [21]

    Liu et al

    X. Liu et al. Zsmerge: Zero-shot kv cache compression for memory-efficient long-context llms.arXiv preprint arXiv:2503.10714, 2025

    arXiv 2025

  22. [22]

    Lopez-Paz, L

    D. Lopez-Paz, L. Bottou, B. Schölkopf, and V . Vapnik. Unifying distillation and privileged information. InICLR Workshop, 2016

    2016

  23. [23]

    Miyato, T

    T. Miyato, T. Kataoka, M. Koyama, and Y . Yoshida. Spectral normalization for generative adversarial networks. InProceedings of ICLR 2018, 2018. arXiv:1802.05957

    Pith/arXiv arXiv 2018

  24. [24]

    X. Ning, Z. Lin, H. Yang, and Y . Wang. Skeleton-of-thought: Prompting llms for efficient parallel generation. arXiv preprint arXiv:2307.15337, 2023

    Pith/arXiv arXiv 2023

  25. [25]

    A. Ren, B. Li, R. Sun, and T. Liu. Calibrating large language models with handcrafted augmentation.arXiv preprint arXiv:2310.05417, 2023

    Pith/arXiv arXiv 2023

  26. [26]

    L. Robbins. Parallel decoder transformer codebase, 2025

    2025

  27. [27]

    Rodionov et al

    A. Rodionov et al. Hogwild! inference: Parallel llm generation via concurrent attention.arXiv preprint arXiv:2504.06261, 2025

    arXiv 2025

  28. [28]

    Stern, N

    M. Stern, N. Shazeer, and J. Uszkoreit. Blockwise parallel decoding for deep autoregressive models.arXiv preprint arXiv:1811.03115, 2018

    Pith/arXiv arXiv 2018

  29. [29]

    Sun et al

    Z. Sun et al. Eagle: Speculative sampling requires rethinking feature uncertainty.arXiv preprint arXiv:2401.15077, 2024

    Pith/arXiv arXiv 2024

  30. [30]

    V . Vapnik. Learning using privileged information: Similarity control and knowledge transfer.Journal of Machine Learning Research, 16, 2015

    2015

  31. [31]

    Wei et al

    J. Wei et al. Side-channel attacks on speculative decoding in llms.arXiv preprint arXiv:2411.01076, 2025

    arXiv 2025

  32. [32]

    Xiao et al

    G. Xiao et al. Sprint: Enabling interleaved planning and parallelized execution in large reasoning models.arXiv preprint arXiv:2506.05745, 2025

    arXiv 2025

  33. [33]

    Yan et al

    M. Yan et al. Decoding speculative decoding.arXiv preprint arXiv:2402.01528, 2024

    Pith/arXiv arXiv 2024

  34. [34]

    Yoshikawa and N

    S. Yoshikawa and N. Okazaki. Selective generation for pass-fail evaluation.arXiv preprint arXiv:2311.08803, 2023

    Pith/arXiv arXiv 2023

  35. [35]

    Zhang, L

    L. Zhang, L. Fang, C. Duan, M. He, L. Pan, P. Xiao, S. Huang, Y . Zhai, X. Hu, P. S. Yu, and A. Liu. A survey on parallel text generation: From parallel decoding to diffusion language models.arXiv preprint arXiv:2508.08712, 2025

    arXiv 2025

  36. [36]

    contradiction

    L. Zheng et al. Semantic reflective verification for faster speculative decoding.arXiv preprint arXiv:2505.18629, 2025. A Artifacts Summary Artifacts summary. The repository includes (i) full training and inference for GPT-OSS-120B; (ii) the fine-tuned checkpoint; (iii) Appendix E synthetic simulation code; (iv) Appendix F logit-replay ablation; (v) scrip...

    Pith/arXiv arXiv 2025

  37. [37]

    Page granularity: fixed-size pages of Bpage tokens/layer (e.g., 128–512); separate pools per stream and for bus snapshots

  38. [38]

    Placement: stride-aligned allocation so the lastLtokens lie in≤ ⌈L/B page⌉pages (minimizes rollback waste)

  39. [39]

    Eviction: LRR to CPU memory; pin bus pages shared by multiple consumers

  40. [40]

    Prefetch: next-stride +∆-lagged snapshot pages; overlap copies with compute

  41. [41]

    On-GPU resident bound: Mresident ≤min Mpeak,M GPU budget −M weights −reserve , with swap latencyt page per page; alignLwithB page to avoid page-thrash on rollbacks

    Compaction: summarize old snapshots to keepℓ bus bounded by most recentK. On-GPU resident bound: Mresident ≤min Mpeak,M GPU budget −M weights −reserve , with swap latencyt page per page; alignLwithB page to avoid page-thrash on rollbacks. D.4 Practical Knobs Prefer small nself kv (MQA/GQA) for long contexts; keep the effective notes/bus ratio η small by c...

This paper was first reviewed by deepseek-v4-flash on August 3, 2026.