Hierarchical Residuals: A Minimalist Decoupling of Residual Width from Compute Width
AuthorsZiteng Wang, Jianqiao Lu, Xinyu Ma, Jintao Zhang, Jun Zhu, Yiyuan Ma, Jianfei Chen
AffiliationsTsinghua University · ByteDance Seed
HiRes gives Transformers a wider memory path between blocks without making each layer more computationally expensive.
Key results
The vanilla baseline requires 1.30× the FLOPs to reach validation loss 3.00.
HiRes and the baseline are compared after this training run.
HiRes achieves this lower training loss than the baseline on OLMoE-1B-7B.
HiRes improves average downstream accuracy by this many points on OLMoE-1B-7B.
HiRes adds this many parameters to OLMoE-1B-7B.
What the paper found
A ByteDance-associated study introduces Hierarchical Residuals, or HiRes, which separates the width of the state carried through a Transformer from the width used for computation inside each layer. HiRes groups standard d-dimensional PreNorm layers into blocks, then uses learned dense read and write projections to connect them to a wider D-dimensional residual stream, with RMSNorm regulating that outer stream at block boundaries. The default design uses a 2× residual expansion and 4 blocks, leaving the inner Transformer layers unchanged and avoiding specialized kernels. Against vanilla residual addition, fitted scaling laws estimate that the baseline needs 1.30× as many FLOPs to reach the same validation loss of 3.00. On OLMoE-1B-7B, HiRes adds 83.9M parameters and, after 500B tokens of training, lowers training loss by 0.0208 and raises average downstream accuracy by 1.14 points. It remains competitive with Hyper-Connections, mHC, Virtual Width Networks, and Attention Residuals, while adding just 3.3–3.4% peak memory overhead and reaching 91.7–93.1% of baseline throughput with optimized Triton implementations. The key result is that a wider persistent residual state can improve scaling without widening the computation in every layer.
Original abstract
Residual connections underpin Transformers, but they implicitly tie the residual width carried through depth to the compute width used inside each layer. We introduce Hierarchical Residuals (HiRes), a minimalist architectural change that decouples these dimensions, widening the residual state while keeping per-layer compute width fixed. HiRes groups layers into blocks: standard d-dimensional PreNorm layers operate inside each block, while a wider D-dimensional PostNorm outer residual connects blocks. Learned read/write projections bridge the two spaces at block boundaries, leaving individual Transformer layers unchanged. Across different model sizes and depths, HiRes consistently outperforms vanilla residual addition, with fitted scaling laws indicating a 1.30-fold improvement in FLOPs efficiency. On OLMoE-1B-7B pretraining for 500B tokens, HiRes achieves 0.0208 lower training loss and 1.14-point higher downstream accuracy. HiRes is also competitive with other residual expansion methods such as VWN, mHC and AttnRes with less activation memory and I/O costs. Built from only dense projections and normalizations, it requires neither specialized kernels nor infrastructure-level optimizations. HiRes thus exposes residual width as a practical scaling variable using only standard operators.
Read the original paperMore in Transformers
Browse all 51 papers →How to Loop Your Transformer: Loop Scaling, Specialization, and Parallel Inference
Chanakya Ekbote, Artidoro Pagnoni, Devendra Singh Sachan, Shruti Bhosale, Mike Lewis, Maryam Fazel-Zarandi, Shashank Rajput, Sujan Kumar Gonugondla
The paper explores how to make transformers deeper through weight reuse while balancing model quality, training cost, and inference speed.
StateLoop: Persistent State for Looped Transformers
Feichen Song, Boyi Zeng, He Li, Shixiang Song, Yiqin Hao, Zitong Wang, Yizhou Yang, Yifan Liu, Ziwei He, Zhouhan Lin
StateLoop gives repeatedly applied Transformers a persistent memory to carry useful information across computation loops.
A Conditional No-Hair Theorem for Transformers: How Language Models Forget Their Prompt
Shuyang Xiang
The paper finds that a transformer’s direct memory of its prompt fades as it generates text, while the text itself can carry that memory forward.