Saved in:
| Main Authors: | , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.24824 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918177397538816 |
|---|---|
| author | Wu, Bohong Chen, Mengzhao Luo, Xiang Yan, Shen Yu, Qifan Xia, Fan Zhang, Tianqi Zhan, Hongrui Zhong, Zheng Zhou, Xun Qiao, Siyuan Bin, Xingyan |
| author_facet | Wu, Bohong Chen, Mengzhao Luo, Xiang Yan, Shen Yu, Qifan Xia, Fan Zhang, Tianqi Zhan, Hongrui Zhong, Zheng Zhou, Xun Qiao, Siyuan Bin, Xingyan |
| contents | Large Language Models (LLMs) are powerful but often too slow and costly for real-world use during inference. Looped transformers save on parameters by reusing the same weights for multiple computational steps, or "loops." However, this approach has a major flaw: the loops run one after another, causing inference latency and memory requirements to increase with each added loop. This makes them impractical for fast applications. To solve this problem, we introduce the Parallel Loop Transformer (PLT). PLT is a new architecture that delivers the performance benefits of a deep, looped model but with the low latency of a standard, non-looped model. PLT works using two key techniques. First, Cross-Loop Parallelism (CLP) breaks the sequential dependency by computing different loops for different tokens at the same time, all within a single pass. Second, to prevent memory costs from growing, we use an Efficient Representation Enhancement strategy. This method shares the memory (KV cache) from the first loop with all other loops. It then uses a Gated Sliding-Window Attention (G-SWA) to combine this shared global information with local information, maintaining high accuracy. Our experiments show that PLT achieves the high accuracy of a traditional looped model but with almost no extra latency or memory cost compared to a standard transformer. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_24824 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Parallel Loop Transformer for Efficient Test-Time Computation Scaling Wu, Bohong Chen, Mengzhao Luo, Xiang Yan, Shen Yu, Qifan Xia, Fan Zhang, Tianqi Zhan, Hongrui Zhong, Zheng Zhou, Xun Qiao, Siyuan Bin, Xingyan Computation and Language Large Language Models (LLMs) are powerful but often too slow and costly for real-world use during inference. Looped transformers save on parameters by reusing the same weights for multiple computational steps, or "loops." However, this approach has a major flaw: the loops run one after another, causing inference latency and memory requirements to increase with each added loop. This makes them impractical for fast applications. To solve this problem, we introduce the Parallel Loop Transformer (PLT). PLT is a new architecture that delivers the performance benefits of a deep, looped model but with the low latency of a standard, non-looped model. PLT works using two key techniques. First, Cross-Loop Parallelism (CLP) breaks the sequential dependency by computing different loops for different tokens at the same time, all within a single pass. Second, to prevent memory costs from growing, we use an Efficient Representation Enhancement strategy. This method shares the memory (KV cache) from the first loop with all other loops. It then uses a Gated Sliding-Window Attention (G-SWA) to combine this shared global information with local information, maintaining high accuracy. Our experiments show that PLT achieves the high accuracy of a traditional looped model but with almost no extra latency or memory cost compared to a standard transformer. |
| title | Parallel Loop Transformer for Efficient Test-Time Computation Scaling |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2510.24824 |