Compander-Aligned Query Geometry for Quantized Zeroth-Order Optimization

TL;DR

CAQ-ZO method eliminates query-time residuals in low-precision evaluations, enhancing NF4 model performance.

cs.LG 🔴 Advanced 2026-05-11 11 views
Yao Shu Zilin Zhu
zeroth-order optimization quantization low precision machine learning model tuning

Key Findings

Methodology

The CAQ-ZO method forms one-grid-step Rademacher stencils in the compander coordinate, eliminating query-time residuals. It uses a nonuniform quantization model Q = φ^{-1} ◦ U ◦ φ, ensuring query endpoints are on a uniform grid, avoiding rounding errors in weight space.

Key Results

  • CAQ-ZO successfully isolated the residual channel in synthetic experiments, demonstrating improved performance in NF4 Qwen/Llama fine-tuning.
  • Under the same quantizer and evaluation budget, CAQ-ZO enhanced the trained NF4 baseline model performance.
  • Results show that CAQ-ZO eliminated query-time residuals, improving model convergence.

Significance

This research offers a novel approach to zeroth-order optimization for low-precision models, addressing query geometry mismatch issues under nonuniform quantization. It holds significant value for low-bit training of large language models, improving performance without increasing storage costs.

Technical Contribution

CAQ-ZO avoids rounding errors in traditional weight-space queries by updating directly in the compander coordinate. It theoretically proves grid-span mismatch and provides stationarity bounds under nonuniform quantization.

Novelty

CAQ-ZO is the first to treat query geometry as a design object, introducing a new method of forming one-grid-step Rademacher stencils in the compander coordinate, eliminating query-time residuals compared to traditional methods.

Limitations

  • The generalizability of CAQ-ZO to large model transfers remains unverified.
  • The method relies on the monotonicity assumption of the compander, which may limit its applicability.

Future Work

Future research could explore the application of CAQ-ZO on different quantizers and more complex models to further verify its generalizability and effectiveness.

AI Executive Summary

In the training of large language models, low-precision forward evaluation is an effective way to save memory. However, query geometry mismatch issues under nonuniform quantization limit its application. The CAQ-ZO method eliminates query-time residuals by forming one-grid-step Rademacher stencils in the compander coordinate, significantly enhancing model performance.

The core of the CAQ-ZO method is treating query geometry as a design object, updating directly in the compander coordinate to avoid rounding errors in traditional weight-space queries. It theoretically proves grid-span mismatch and provides stationarity bounds under nonuniform quantization. Synthetic experiments and NF4 Qwen/Llama fine-tuning results show that CAQ-ZO improves the trained NF4 baseline model performance under the same quantizer and evaluation budget.

Despite the outstanding performance of the CAQ-ZO method in experiments, its generalizability to large model transfers remains unverified. Future research could explore the application of CAQ-ZO on different quantizers and more complex models to further verify its generalizability and effectiveness.

Deep Analysis

Background

With the proliferation of large language models, low-bit training has become a standard practice. However, query geometry mismatch issues under nonuniform quantization limit its application. Traditional methods query in weight space, leading to rounding errors that affect model performance.

Core Problem

Query geometry mismatch under nonuniform quantization is a major challenge in zeroth-order optimization. Traditional methods query in weight space, leading to rounding errors that affect model performance.

Innovation

The CAQ-ZO method is the first to treat query geometry as a design object, forming one-grid-step Rademacher stencils in the compander coordinate, eliminating query-time residuals. Its innovation lies in avoiding rounding errors in traditional weight-space queries.

Methodology

  • �� Form one-grid-step Rademacher stencils in the compander coordinate
  • �� Update directly in the compander coordinate to avoid rounding errors
  • �� Theoretically prove grid-span mismatch and provide stationarity bounds

Experiments

The experimental design includes synthetic experiments and NF4 Qwen/Llama fine-tuning. Synthetic experiments verify the isolation of the residual channel, while NF4 fine-tuning tests CAQ-ZO's performance improvement under the same quantizer and evaluation budget.

Results

CAQ-ZO successfully isolated the residual channel in synthetic experiments, demonstrating improved performance in NF4 Qwen/Llama fine-tuning. Results show that CAQ-ZO eliminated query-time residuals, improving model convergence.

Applications

The CAQ-ZO method holds significant value for low-bit training of large language models, improving performance without increasing storage costs.

Limitations & Outlook

The generalizability of CAQ-ZO to large model transfers remains unverified. The method relies on the monotonicity assumption of the compander, which may limit its applicability.

Plain Language Accessible to non-experts

Imagine you are in a huge warehouse with many shelves, each containing boxes of different sizes. Your task is to find a specific item among these boxes. Traditional methods are like searching directly on the shelves, which might lead to errors due to varying box sizes. The CAQ-ZO method is like first arranging all the boxes by size and then searching in a unified coordinate system, preventing errors caused by different box sizes.

ELI14 Explained like you're 14

Imagine you're playing a big puzzle game. Traditional methods are like searching for the right puzzle piece directly in a pile, which might lead to mistakes due to different piece sizes. The CAQ-ZO method is like first arranging all the pieces by size and then searching in a unified coordinate system, preventing mistakes caused by different piece sizes. Isn't that cool?

Glossary

Zeroth-Order Optimization

An optimization method that does not rely on gradient information, suitable for scenarios where gradients cannot be directly computed.

Used for adaptive training of low-precision models.

Compander

A model used for nonuniform quantization, achieving uniform quantization through coordinate transformation.

Used in CAQ-ZO method to form query geometry.

Rademacher Stencil

A template used to form query geometry, ensuring query endpoints are on a uniform grid.

Used in CAQ-ZO method to eliminate query-time residuals.

NF4

A quantizer for low-bit neural network weights, achieved through quantile encoding.

Used in CAQ-ZO method to verify performance improvement.

Rounding Error

Errors caused by numerical rounding, affecting model accuracy.

Major issue in traditional weight-space queries.

Open Questions Unanswered questions from this research

  • 1 How to verify the generalizability of the CAQ-ZO method in large model transfers?
  • 2 Does the monotonicity assumption of the compander limit the applicability of the CAQ-ZO method?

Applications

Immediate Applications

Low-Bit Training

The CAQ-ZO method can be used for low-bit training of large language models, enhancing model performance.

Long-term Vision

General Model Adaptation

Explore the application of the CAQ-ZO method on different quantizers and more complex models to verify its generalizability.

Abstract

Low-bit forward evaluation is an attractive route to memory-efficient zeroth-order (ZO) adaptation: the optimizer needs only scalar losses, and the model can be queried near deployment precision. The obstacle is that a quantized ZO query is not a continuous finite difference followed by harmless storage rounding. The query chooses endpoints, the low-precision engine rounds them, and the loss difference is measured along the rounded chord. For nonuniform companding quantizers, this makes the codebook insufficient to predict ZO behavior: a fixed weight-space radius can collapse in dense cells, over-span sparse cells, or assign a rounded chord to an unrounded update direction. We identify the missing object as query geometry and model scalar nonuniform quantization as $Q = φ^{-1} \circ U \circ φ$. CAQ-ZO (Compander-Aligned Queries for Zeroth-Order Optimization) forms one-grid-step Rademacher stencils $z \pm Δr$ in $z = φ(x)$, maps endpoints back through $φ^{-1}$, and updates in $z$. Our theory proves the grid-span mismatch, decomposes endpoint-rounding estimator residuals, and gives stationarity bounds in which generic off-grid queries retain a $Δ^2/μ^2$ residual channel while CAQ-ZO makes the query-time residual exactly zero. Synthetic experiments isolate this channel, and matched NF4 Qwen/Llama fine-tuning shows that CAQ-ZO improves the trained NF4 baseline under the same quantizer and evaluation budget.

cs.LG