Pretraining Latent Information Feedback Transformers with Teacher Supervision
AuthorsDor Tirosh, Ido Amos, Mor Geva
AffiliationsBlavatnik School of Computer Science and AI, Tel Aviv University · The Hebrew University of Jerusalem
Resources
LIFT teaches Transformers to pass rich hidden-state information across steps, potentially making language models more efficient and capable than standard feed-forward designs.
Key results
Accuracy on 12-step permutation-composition sequences
Accuracy of the Transformer teacher on the same 12-step task
Reduction versus token-matched Transformers across model scales
Held-out perplexity for the 1B-parameter LIFT model
Overall additional training compute, stated as under 10%
Peak memory on NVIDIA B200 GPUs, compared with 44.7 GB for T2 MLR
What the paper found
Pretraining Latent Information Feedback Transformers with Teacher Supervision introduces LIFT, a Transformer architecture that carries a dense latent state alongside each generated token, allowing deep-layer information to flow back into shallower layers across generation steps. Instead of training this recurrent channel sequentially, LIFT uses an external pretrained language model as a teacher: its next-token distribution is truncated to the top 1,024 tokens, embedded as a soft state, and supplied in parallel during pretraining. The student learns both next-token prediction and state alignment, then replaces teacher states with its own predictions at inference. On the S5 permutation-composition task, a two-layer LIFT achieved 100% accuracy on 12-step sequences even when its Transformer teacher reached only 3%, while a standard Transformer failed at that length. In language-model pretraining with OLMo 2 models ranging from 135M to 1B parameters, LIFT reduced held-out perplexity by 5–5.5% versus token-matched Transformers and improved procedural arithmetic and pattern continuation. At 1B parameters, it reached 18.81 perplexity and 1.99 arithmetic bits per byte, compared with 19.79 and 2.03 for the token-matched Transformer. The method adds under 10% training FLOPs overall, and one parallel prompt-refinement pass recovers nearly all sequential-prefill gains. Compared with Jacobi-style systems such as T2 MLR and multi-pass Transformers, LIFT is more compute-efficient and uses less memory; on NVIDIA B200 GPUs, it required 35.4 GB versus 44.7 GB for T2 MLR. This positions LIFT as a complementary alternative to scaling directions represented by DeepSeek-V3, improving information flow without abandoning parallel Transformer pretraining.
Original abstract
Transformer language models (LMs) are feed-forward: deep-layer representations are never fed back to shallower layers, and the only pathway for information to flow downward across generation steps is the decoded token. This narrow channel forces models to recompute intermediate results and to discard alternative continuations. In this work, we remove this bottleneck during pretraining, introducing the LIFT (Latent Information Feedback Transformer) architecture and training method which enable LMs to propagate state across generation. We achieve this by turning recurrent-state learning into a teacher-forced prediction problem: each input token is paired with an information-dense state, derived from the next-token distribution of an off-the-shelf pretrained LM. The model, extended with a small number of additional parameters, is then trained to predict both the next token and the next state. As the input states are precomputed, pretraining remains fully parallel across positions. At inference, the model's own predicted states are fed back, with a minor computational overhead that decreases with model size. Experiments with pretrained models ranging from 135M to 1B parameters show that LIFT consistently outperforms standard Transformers and baselines on language modeling, downstream reasoning tasks, and procedural tasks under token-matched budget, while being on par with or ahead of compute-matched Transformers. Moreover, a controlled study on a state-tracking task shows that a tiny LIFT outperforms same-size Transformers trained on 8x more data, even when trained with the states of a Transformer that fails the task. Overall, we show that LMs can learn to exploit deep-to-shallow feedback during pretraining via scalable teacher supervision.
Read the original paperMore in Transformers
Browse all 42 papers →The Geometry of Inference in Transformer Residual Streams
Timur Mudarisov, Mikhail Burtsev, Radu State
This paper shows how Transformer hidden states gradually geometrically converge toward the correct prediction while eliminating competing possible outcomes.
Transformers Stop Thinking Too Early, and a Tiny LoRA Fixes It
Zehao Jin, Ruixuan Deng, Junran Wang
A small LoRA update appears to make transformers carry information through many more layers, dramatically extending their ability to follow long chains without retraining the full model.
Nonparametric In-Context Learning under Growing Geometric Complexity: Minimax Optimality and Local Geometry-Adaptivity of Transformers
Jaehee Seo, Jisu Kim
This work shows, in theory, how transformers can adapt to data living on locally different geometric structures and still achieve statistically optimal in-context prediction.