Pith. sign in

REVIEW 4 cited by

Enhancing Zeroth-order Fine-tuning for Language Models with Low-rank Structures

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 2410.07698 v1 pith:OJ5FCSUW submitted 2024-10-10 cs.LG

classification cs.LG
keywords fine-tuninglow-ranklozoalgorithmsgradientmemoryactivationcosts
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Parameter-efficient fine-tuning (PEFT) significantly reduces memory costs when adapting large language models (LLMs) for downstream applications. However, traditional first-order (FO) fine-tuning algorithms incur substantial memory overhead due to the need to store activation values for back-propagation during gradient computation, particularly in long-context fine-tuning tasks. Zeroth-order (ZO) algorithms offer a promising alternative by approximating gradients using finite differences of function values, thus eliminating the need for activation storage. Nevertheless, existing ZO methods struggle to capture the low-rank gradient structure common in LLM fine-tuning, leading to suboptimal performance. This paper proposes a low-rank ZO gradient estimator and introduces a novel low-rank ZO algorithm (LOZO) that effectively captures this structure in LLMs. We provide convergence guarantees for LOZO by framing it as a subspace optimization method. Additionally, its low-rank nature enables LOZO to integrate with momentum techniques while incurring negligible extra memory costs. Extensive experiments across various model sizes and downstream tasks demonstrate that LOZO and its momentum-based variant outperform existing ZO methods and closely approach the performance of FO algorithms.

Discussion (0). Sign in 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. RED-SEGA:Resilient Decentralized Stochastic Proximal Optimization with Gradient Sketching over Time-Varying Networks

    math.OC 2026-07 conditional novelty 6.0 of 10

    RED-SEGA achieves Byzantine-resilient linear convergence for non-decomposable SRM via gradient sketching and norm-penalized aggregation over time-varying networks.

  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. From PowerSGD to PowerSGD+: Low-Rank Gradient Compression for Distributed Optimization with Convergence Guarantees

    math.OC 2025-09 conditional novelty 6.0 of 10

    PowerSGD can provably fail to converge; the proposed PowerSGD+ with periodic SVD subspace resets converges under standard assumptions at O(1/sqrt(NT)).

  4. FZOO: Fast Zeroth-Order Optimizer for Fine-Tuning Large Language Models towards Adam-Scale Speed

    cs.LG 2025-06 reject novelty 6.0 of 10

    FZOO claims Adam-like zeroth-order fine-tuning via loss-std normalization and batched forward passes, but the paper's algorithm perturbs activations rather than parameters, breaking the link to its own theory.

Pith tools