AI & ML
Not All Loops Cost the Same: Phase-Dependent Depth for Serving Looped Transformers
arXiv cs.DC0 views
arXiv:2611.07211v1 Announce Type: new Abstract: Looped transformers scale inference-time reasoning by repeatedly reusing a shared core, increasing computation without increasing parameter count. Serving prefilling and decoding with a uniform loop budget couples their costs. We present LoopDuet, a phase-dependent depth and training-free serving approach that selects the two budgets jointly while preserving decoding depth at prefilling boundaries. Our vLLM implementation gathers tokens requiring further recurrence into compact batches, turning the selected allocation into executable savings with existing weights and attention kernels. At runtime, a queue-age controller adjusts prefilling depth to retain quality as demand changes. Experiments on the full HotpotQA dataset with one A100-80GB demonstrate two benefits of this flexibility. First, separate phase budgets improve the quality--throughput trade-off: Huginn delivers 19\% more throughput than the fastest tested uniform setting meeting the same accuracy criterion, while a higher-throughput operating point gains 6.04 EM points over uniform depth eight at 97\% of its throughput. Second, the same execution mechanism retains more quality under load: on two evaluated OLMo arrival traces, adaptive prefilling gains 0.92--1.35 EM points over the most accurate tested fixed-depth controls at the same 100\% attainment of a one-second time-to-first-token target. Together, these results establish LoopDuet as a practical way to turn flexible model computation into higher serving capacity and better quality under load.
Source:https://arxiv.org/abs/2611.07211PreviousCapability Gain from ISA to Shared Execution on AMD MI300A and MI250XNextKOSMOS: Self-scheduling Persistent Kernels for Communication-Compute Overlap
Related posts
Geometric Functional Inequalities for Markov Processes: An Invitation via the Langevin Diffusion
0arXiv stat.CO
A Unified Coordinate Descent Framework for Penalized Longitudinal Log-Contrast Quantile Regression
0arXiv stat.CO
Fast Functional Clustering via Closed-Form Covariance Updates
0arXiv stat.CO
marp: Model-Averaged Inference for Parametric Renewal Processes in R
0arXiv stat.CO
dsp: An R Package for Bayesian Time Series Modeling with the Dynamic Shrinkage Process
0arXiv stat.CO
Machine Learning Fundamentals: Understanding How Machines Learn from Data
0dev.to Discuss