Pith. sign in

REVIEW 4 cited by

Variance-reduced Zeroth-Order Methods for Fine-Tuning Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.08080 v1 pith:TGGTWQNS submitted 2024-04-11 cs.LG cs.AIcs.CLmath.OC

classification cs.LGcs.AIcs.CLmath.OC
keywords fine-tuningmezo-svrgmemorymethodsmezomodelstaskszeroth-order
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Fine-tuning language models (LMs) has demonstrated success in a wide array of downstream tasks. However, as LMs are scaled up, the memory requirements for backpropagation become prohibitively high. Zeroth-order (ZO) optimization methods can leverage memory-efficient forward passes to estimate gradients. More recently, MeZO, an adaptation of ZO-SGD, has been shown to consistently outperform zero-shot and in-context learning when combined with suitable task prompts. In this work, we couple ZO methods with variance reduction techniques to enhance stability and convergence for inference-based LM fine-tuning. We introduce Memory-Efficient Zeroth-Order Stochastic Variance-Reduced Gradient (MeZO-SVRG) and demonstrate its efficacy across multiple LM fine-tuning tasks, eliminating the reliance on task-specific prompts. Evaluated across a range of both masked and autoregressive LMs on benchmark GLUE tasks, MeZO-SVRG outperforms MeZO with up to 20% increase in test accuracies in both full- and partial-parameter fine-tuning settings. MeZO-SVRG benefits from reduced computation time as it often surpasses MeZO's peak test accuracy with a $2\times$ reduction in GPU-hours. MeZO-SVRG significantly reduces the required memory footprint compared to first-order SGD, i.e. by $2\times$ for autoregressive models. Our experiments highlight that MeZO-SVRG's memory savings progressively improve compared to SGD with larger batch sizes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Accelerated Stochastic Zeroth-Order Quasar-Convex Optimization

    math.OC 2026-07 conditional novelty 6.0 of 10

    A continuized zeroth-order Nesterov method achieves O(d/√ε) function-evaluation complexity for smooth quasar-convex minimization, with improved dimension dependence under a 1-norm mirror step when the solution is sparse.

  2. Learning a Zeroth-Order Optimizer for Fine-Tuning LLMs

    cs.LG 2025-10 conditional novelty 6.0 of 10

    A learned per-block noise-scale generator improves zeroth-order (gradient-free) fine-tuning of LLMs and can be trained once on one task and reused elsewhere.

  3. A Memory Efficient Randomized Subspace Optimization Method for Training Large Language Models

    cs.LG 2025-02 conditional novelty 5.0 of 10

    A randomized subspace optimizer cuts activation and optimizer-state memory during LLM training, with convergence guarantees and mostly comparable performance to GaLore and Adam.

  4. KerZOO: Kernel Function Informed Zeroth-Order Optimization for Accurate and Accelerated LLM Fine-Tuning

    cs.LG 2025-05 reject novelty 3.0 of 10

    Kernel functions with vanishing third-moment conditions reduce the leading bias term in zeroth-order gradient estimates, yielding faster LLM fine-tuning than MeZO and HiZOO on several classification and generation benchmarks.

Pith tools