Backward-Friendly Optimization: Training Large Language Models with Approximate Gradients under Memory Constraints
Jing Yang, Kaitong Cai, Yijia Fan, Yufeng Yang, Keze Wang

TL;DR
GradLite is a novel optimizer that enables memory-efficient training of large language models by using approximate gradients with error correction, maintaining convergence and performance without changing model architecture.
Contribution
Introduces GradLite, a backward-friendly optimizer that reduces memory usage through low-rank Jacobian approximation and error-feedback, without altering model architecture.
Findings
Reduces optimizer and activation memory by up to 50%.
Maintains convergence guarantees comparable to Adam.
Achieves competitive or superior performance on multiple benchmarks.
Abstract
Full fine-tuning of Large Language Models (LLMs) is notoriously memory-intensive, primarily because conventional optimizers such as SGD or Adam assume access to exact gradients derived from cached activations. Existing solutions either alter the model architecture (e.g., reversible networks) or trade memory for computation (e.g., activation checkpointing), but the optimizer itself remains untouched. In this work, we introduce GradLite, a backward-friendly optimizer that relaxes the requirement of exact gradients, enabling efficient training even when intermediate activations are aggressively discarded or approximated. GradLite leverages two key techniques: (i) low-rank Jacobian approximation, which reduces the dimensionality of backpropagated error signals, and (ii) error-feedback correction, which accumulates and compensates approximation errors across iterations to preserve…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
