Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research introduces Adaptive Log-Space quantization to address the distinct error propagation challenges in memory-efficient optimizers like CAME and APOLLO, which differ fundamentally from dense Adam-style methods. By adapting precision per block while preserving exact zeros, the technique significantly reduces optimizer-state storage requirements with minimal impact on model convergence across various benchmarks.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Beyond Dense Adam States: Adaptive Log-Space Quantization for Memory-Efficient Optimizers

arXiv2 min read

arXiv:2608.22322v1 Announce Type: new Abstract: Low-precision optimizer-state methods are commonly designed for dense Adam-style moments, but memory-efficient optimizers maintain factored, confidence-based, or projected states whose quantization errors propagate differently. We characterize this heterogeneity in optimizer-state traces from language-model pre-training and introduce Adaptive Log-Space (AL) quantization, a block-wise representation for non-negative states that adapts its nonzero range per block while preserving exact zeros. AL8 and AL16 are combined with independent signed-momentum encodings and state-specific precision choices. Across 96 runs totaling 214.7 GPU-hours, we evaluate AdamW, Adafactor, CAME, and APOLLO paths. On a 20K-step TinyLlama-1.1B benchmark, AdamW with AL8 second moments and 8-bit uniform momentum reaches 72.90 perplexity, versus 72.48 for FP32 and 73.54 for an 8-bit dynamic-quantization baseline, while reducing measured optimizer-state storage from 8392.7 to 2119.2 MiB. CAME requires higher precision for its non-negative states: AL16 reaches 86.16 perplexity versus 86.68 for FP32, while all-AL8 reaches 90.19. In a 100K-step GPT-2 experiment, topology-aware parameter protection reduces the late-loss gap of quantized Adafactor from +0.1185 to +0.0159. These results support state- and topology-aware optimizer quantization. End-to-end comparisons use a single training seed and are reported as empirical measurements.

Abstract:Low-precision optimizer-state methods are commonly designed for dense Adam-style moments, but memory-efficient optimizers maintain factored, confidence-based, or projected states whose quantization errors propagate differently. We characterize this heterogeneity in optimizer-state traces from language-model pre-training and introduce Adaptive Log-Space (AL) quantization, a block-wise representation for non-negative states that adapts its nonzero range per block while preserving exact zeros. AL8 and AL16 are combined with independent signed-momentum encodings and state-specific precision choices. Across 96 runs totaling 214.7 GPU-hours, we evaluate AdamW, Adafactor, CAME, and APOLLO paths. On a 20K-step TinyLlama-1.1B benchmark, AdamW with AL8 second moments and 8-bit uniform momentum reaches 72.90 perplexity, versus 72.48 for FP32 and 73.54 for an 8-bit dynamic-quantization baseline, while reducing measured optimizer-state storage from 8392.7 to 2119.2 MiB. CAME requires higher precision for its non-negative states: AL16 reaches 86.16 perplexity versus 86.68 for FP32, while all-AL8 reaches 90.19. In a 100K-step GPT-2 experiment, topology-aware parameter protection reduces the late-loss gap of quantized Adafactor from +0.1185 to +0.0159. These results support state- and topology-aware optimizer quantization. End-to-end comparisons use a single training seed and are reported as empirical measurements.

17 pages, 5 figures, 7 tables. Code: this https URL

Machine Learning (cs.LG)

arXiv:2608.22322 [cs.LG]

(or arXiv:2608.22322v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2608.22322 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 286 words

Related coverage