惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

T
The Blog of Author Tim Ferriss
IT之家
IT之家
Engineering at Meta
Engineering at Meta
WordPress大学
WordPress大学
博客园 - 三生石上(FineUI控件)
博客园 - 聂微东
C
Check Point Blog
T
Tailwind CSS Blog
博客园 - Franky
H
Help Net Security
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Google DeepMind News
Google DeepMind News
博客园 - 叶小钗
J
Java Code Geeks
腾讯CDC
罗磊的独立博客
爱范儿
爱范儿
阮一峰的网络日志
阮一峰的网络日志
Martin Fowler
Martin Fowler
酷 壳 – CoolShell
酷 壳 – CoolShell
I
InfoQ
B
Blog
V
Visual Studio Blog
F
Fortinet All Blogs

Transactions of the Association for Computational Linguistics

Efficient Tuning of Large Language Models for Knowledge-Grounded Dialogue Generation A Systematic Review of NLP for Dementia: Tasks, Datasets and Opportunities TALE: Token-Adaptive Low-Rank KVCache Approximation with Reconstruction Elimination Large Language Models Are Human-Like Internally BenCzechMark : A Czech-centric Multitask and Multimetric Benchmark for Large Language Models with Duel Scoring Mechanism Adding Chocolate to MINT: Mitigating Metric Interference in Machine Translation Objectifying the Subjective: Cognitive Biases in Topic Interpretations Elements of World Knowledge (EWoK): A cognition-inspired framework for evaluating basic world knowledge in language models MURI: High-Quality Instruction Tuning Datasets for Low-Resource Languages via Reverse Instructions CRAFT Your Dataset: Task-Specific Synthetic Dataset Generation Through Corpus Retrieval and Augmentation Human Choice Prediction in Language-Based Persuasion Games: Simulation-Based Off-Policy Evaluation Adversarial Defence without Adversarial Defence: Enhancing Language Model Robustness via Instance-level Principal Component Removal Exploring Practical Gaps in Using Cross Entropy to Implement Maximum Mutual Information Criterion for Rationalization Benchmarking Linguistic Diversity of Large Language Models Do Large Multimodal Models Solve Caption Generation for Scientific Figure? Lessons Learned from SciCap Challenge 2023 MTRAG: A Multi-Turn Conversational Benchmark for Evaluating Retrieval-Augmented Generation Systems Culturally Aware and Adapted NLP: A Taxonomy and a Survey of the State of the Art KEFT: Knowledge-Enhanced Fine-Tuning for Large Language Models in Domain-Specific Question Answering Active Knowledge Structuring for Large Language Models in Materials Science Text Mining How to Select Datapoints for Efficient Human Evaluation of NLG Models? A Unifying Scheme for Extractive Content Selection Tasks Early Detection and Reduction of Memorisation for Domain Adaptation and Instruction Tuning Towards More Realistic Extraction Attacks: An Adversarial Perspective The Frame Representation Hypothesis: Multi-Token LLM Interpretability and Concept-Guided Text Generation Overcoming Source Object Grounding for Semantic Image Editing Explanatory Summarization with Discourse-Driven Planning On the Effect of Instruction Tuning Loss on Generalization BharatBBQ: A Multilingual Bias Benchmark for Question Answering in the Indian Context Are Triggers Needed for Document-Level Event Extraction? Safe Pruning LoRA: Robust Distance-Guided Pruning for Safety Alignment in Adaptation of LLMs
End-to-End Long Document Summarization using Gradient Cac...
Rohit Saxena · 2025-12-25 · via Transactions of the Association for Computational Linguistics

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 Caching for Encoder-Decoder 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.

Article at MIT Press Presented at EMNLP 2025