English

End-to-End Long Document Summarization using Gradient Caching

Computation and Language 2025-06-30 v2 Artificial Intelligence

Abstract

Training transformer-based encoder-decoder models for long document summarization poses a significant challenge due to the quadratic memory consumption during training. Several approaches have been proposed to extend the input length at test time, but training with these approaches is still difficult, requiring truncation of input documents and causing a mismatch between training and test conditions. In this work, we propose CachED (Gradient Cach\textbf{Cach}ing for E\textbf{E}ncoder-D\textbf{D}ecoder models), an approach that enables end-to-end training of existing transformer-based encoder-decoder models, using the entire document without truncation. Specifically, we apply non-overlapping sliding windows to input documents, followed by fusion in decoder. During backpropagation, the gradients are cached at the decoder and are passed through the encoder in chunks by re-computing the hidden vectors, similar to gradient checkpointing. In the experiments on long document summarization, we extend BART to CachED BART, processing more than 500K tokens during training and achieving superior performance without using any additional parameters.

Keywords

Cite

@article{arxiv.2501.01805,
  title  = {End-to-End Long Document Summarization using Gradient Caching},
  author = {Rohit Saxena and Hao Tang and Frank Keller},
  journal= {arXiv preprint arXiv:2501.01805},
  year   = {2025}
}

Comments

Accepted to Transactions of the Association for Computational Linguistics (TACL 2025); Pre MIT Press version

R2 v1 2026-06-28T20:55:27.872Z