Challenge: a number of fine-tuning approaches are available to improve performance of large language models.
Approach: They propose a memory-efficient method to minimize memory associated with cached intermediate activations.
Outcome: The proposed method minimizes memory associated with cached intermediate activations while preserving accuracy.

Similar Papers

Memory-Efficient Structured Backpropagation for On-Device LLM Fine-Tuning (2026.acl-industry)

Copied to clipboard

Challenge: Existing approaches for fine-tuning large language models require a trade-off between exact gradients with high memory and low memory with noisy estimates (MeZO).
Approach: They propose a method which derivates gradients from LoRA's low-rank structure and manually deriving backward passes to exploit the low-level structure.
Outcome: The proposed method reduces peak memory from 361MB to 136MB for Qwen2.5-0.5B, enabling fine-tuning scenarios previously infeasible on memory-constrained devices.
Memory-Efficient Backpropagation for Fine-Tuning LLMs on Resource-Constrained Mobile Devices (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing work on memory-efficient on-device fine-tuning of large language models with backpropagation has focused on approximating gradients with zeroth-order optimization (ZO).
Approach: They propose a memory-efficient implementation of backpropagation on mobile devices that allows flexible trade-offs between memory usage and compute time while converging faster.
Outcome: The proposed method can fine-tune LLMs with backpropagation using less than 1GB of memory while achieving better performance than the baseline.
Quantized Side Tuning: Fast and Memory-Efficient Tuning of Quantized Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Existing methods to finetun large language models (LLMs) only update a small number of trainable parameters, or attempt to reduce the memory footprint during the training phase of the finetune process.
Approach: They propose quantized side tuing (QST) which quantizes an LLM’s model weights into 4-bit to reduce the memory footprint of the original weights.
Outcome: The proposed method reduces the memory footprint of the model weights, optimizer states, and intermediate activations while reducing the memory requirements.
Parameter-efficient Tuning for Large Language Model without Calculating Its Gradients (2023.emnlp-main)

Copied to clipboard

Challenge: Recent parameter-efficient tuning methods can only save 30% of training memory . gradient computation and backpropagation are still necessary for these methods .
Approach: They propose a parameter-efficient tuning method that can be used to fine-tune large language models without calculating gradients.
Outcome: The proposed method saves 30% of training memory and improves performance on large language models.
Training Long-Context LLMs Efficiently via Chunk-wise Optimization (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in long-context large language models have demonstrated superior retrieval quality compared to retrievalaugmented generation (RAG) approaches.
Approach: They propose a memory-efficient training paradigm that partitions lengthy inputs into manageable chunks.
Outcome: The proposed model expands maximum sequence length from 1K to 16K tokens on a single RTX 3090 GPU, while SpaCO achieves accelerated training speed.
Memory-Efficient Fine-Tuning of Transformers via Token Selection (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for fine-tuning require caching of intermediate activations to update weights during the backward pass.
Approach: They develop a method to reduce memory usage in fine-tuning of transformers by backpropagating through just a subset of input tokens.
Outcome: The proposed method reduces memory usage and memory footprint on large transformer models . it can be easily combined with existing methods like LoRA, reducing memory cost .
Towards Objective Fine-tuning: How LLMs’ Prior Knowledge Causes Potential Poor Calibration? (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have enabled powerful domain-specific applications through supervised fine-tuning.
Approach: They propose a cognition-aware framework that applies targeted learning strategies according to the model’s prior knowledge to improve calibration.
Outcome: The proposed framework significantly improves calibration while maintaining performance, achieving an average 57% reduction in ECE compared to standard fine-tuning in Llama3-8B.
META-LORA: Memory-Efficient Sample Reweighting for Fine-Tuning Large Language Models (2025.coling-main)

Copied to clipboard

Challenge: Supervised fine-tuning (SFT) is widely adopted for tailoring large language models (LLMs) to specific downstream tasks.
Approach: They propose a memory-efficient method for automatic sample reweighting that learns to re-weight fine-tuning samples by minimizing the loss on a small, high-quality validation set.
Outcome: Meta-LoRA learns to reweight fine-tuning samples by minimizing the loss on a small, high-quality validation set through an end-to-end bi-level optimization framework based on meta-learning.
Full Parameter Fine-tuning for Large Language Models with Limited Resources (2024.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) require massive GPU resources for training.
Approach: They propose a parameter-efficient optimization that fuses the gradient computation and parameter update in one step to reduce memory usage.
Outcome: The proposed method reduces memory usage to 10.8% compared to the standard approach.
AdaZeta: Adaptive Zeroth-Order Tensor-Train Adaption for Memory-Efficient Large Language Models Fine-Tuning (2024.emnlp-main)

Copied to clipboard

Challenge: Recent advances in memory-efficient zeroth-order methods have limited their widespread adoption due to performance drops and a high risk of divergence.
Approach: They propose a memory-efficient zeroth-order framework to improve performance and convergence of the MeZO methods by using only forward passes.
Outcome: The proposed framework improves performance and convergence of the proposed methods on Roberta-Large and Llama-2-7B models.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations