Paper Overview
Field: Machine Learning Authors: Akarsh Kumar, Phillip Isola Published: 2025-06-11 arXiv: 2506.08254
Abstract
Training RNNs requires assigning credit across long sequences. Standard backpropagation through time (BPTT) is sequential in time and suffers from vanishing/exploding gradients. The authors propose Supervised Memory Training (SMT), which sidesteps recurrent credit propagation entirely by reducing RNN training to supervised learning on one-step memory transition labels.
SMT obtains memory labels by training a Transformer-based encoder on predicting state targets — keeping only the history needed to predict the future. By decoupling memory content from how the memory is updated, SMT enables temporally parallel RNN training and outperforms BPTT on language modeling and pixel sequence modeling tasks.
Key Takeaways
- Problem: BPTT limits parallelism and suffers from vanishing/exploding gradients in long-sequence RNN training.
- Approach: Reduce RNN training to supervised learning on one-step memory transition labels, avoiding recurrent credit propagation.
- Label generation: A Transformer-based encoder is trained to predict state targets that preserve only the history required for future prediction.
- Benefit: Decoupling memory content from update dynamics enables temporally parallel training.
- Results: SMT outperforms BPTT on language modeling and pixel sequence modeling benchmarks.