Compander-Aligned Query Geometry for Quantized Zeroth-Order Optimization
Yao Shu, Zilin Zhu

TL;DR
This paper introduces CAQ-ZO, a novel zeroth-order optimization method that aligns query geometry with nonuniform quantization to improve low-bit model adaptation.
Contribution
It models scalar nonuniform quantization as a composition of functions and develops CAQ-ZO, which optimally aligns query geometry to eliminate residual errors in quantized zeroth-order optimization.
Findings
CAQ-ZO achieves zero residual error in query updates.
Synthetic experiments confirm the elimination of residual channels.
Fine-tuning NF4 models with CAQ-ZO outperforms baseline methods.
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 . CAQ-ZO (Compander-Aligned Queries for Zeroth-Order Optimization) forms one-grid-step…
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.
