TACO: Ternary Absolute-max Column-wise One-sparse Optimizer for LLM Fine-Tuning
Not on the map. Why?
Abstract (arXiv)
Full-parameter fine-tuning of large language models (LLMs) incurs substantial optimizer state memory overhead, limiting the model sizes that fit on modern GPUs. Existing approaches either compress optimizer state, abandon first-order gradients, or change the update geometry while retaining dense state. The recently introduced Muon optimizer reduces optimizer memory through matrix-valued updates. Still, its geometry differs from AdamW and can lead to performance degradation when fine-tuning AdamW-pretrained models. To reduce optimizer memory without sacrificing accuracy or computational efficiency in LLM fine-tuning, we propose Ternary Absolute-max Column-wise One-sparse optimizer, or TACO, which follows Muon's operator-norm steepest-descent view but takes the geometric route further. TACO computes the exact steepest-descent direction under a dimension-normalized 1→1 operator norm by selecting the sign of the largest magnitude entry in each column of two-dimensional weight matrices. This retains first-order gradients while making optimizer state memory nearly negligible. Our practical TACO optimizer maintains only a small set of low precision gradient components per column, reducing persistent optimizer state by 174× relative to AdamW8bit (from 27.7 GB to 0.16 GB) and peak training memory by 2.9× (from 80.6 GB to 27.5 GB) on OPT-13B, while achieving comparable accuracy and runtime. TACO further enables full-parameter fine-tuning of 30-32B-parameter models on a single 80 GB H100 GPU across multiple model families and tasks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 38 of its 51 references that are in the map. First posted on arXiv 1 Oct 2026.
Builds on
38 of 51 references.
References · 38
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2025Qwen3 Technical Reportcited by 8,195
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,718
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 896
26 more
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 883
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
- 20218-bit Optimizers via Block-wise Quantizationcited by 395
- 2023Fine-Tuning Language Models with Just Forward Passescited by 337
- 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 253
- 2022FP8 Formats for Deep Learningcited by 187
- 2025Training Deep Learning Models with Norm-Constrained LMOscited by 177
- 2024Old Optimizer, New Norm: An Anthologycited by 173
- 2025Practical Efficiency of Muon for Pretrainingcited by 74
- 2024Sparse MeZO: Less Parameters for Better Performance in Zeroth-Order LLM Fine-Tuningcited by 53
- 2024Second-Order Fine-Tuning without Pain for LLMs:A Hessian Informed Zeroth-Order Optimizercited by 51
- 2024APOLLO: SGD-like Memory, AdamW-level Performancecited by 50
- 2021A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimizationcited by 46
- 2021Rethinking gradient sparsification as total error minimizationcited by 41
- 2023CAME: Confidence-guided Adaptive Memory Efficient Optimizationcited by 34
- 2019On the Discrepancy between the Theoretical Analysis and Practical Implementations of Compressed Communication for Distributed Deep Learningcited by 31
- 2019Stochastic Three Points Method for Unconstrained Smooth Minimizationcited by 24
- 2024Zeroth-Order Fine-Tuning of LLMs in Random Subspacescited by 23
- 2026Powering Up Zeroth-Order Training via Subspace Gradient Orthogonalizationcited by 11
- 2019A Stochastic Derivative-Free Optimization Method with Importance Sampling: Theory and Learning to Controlcited by 9
- 2019A Stochastic Derivative Free Optimization Method with Momentumcited by 9
- 2021Curvature-Aware Derivative-Free Optimizationcited by 7
- 2022Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimizationcited by 6
- 2026Can Muon Fine-tune Adam-Pretrained Models?cited by 6
- 2026FlashOptim: Optimizers for Memory-Efficient Trainingcited by 4
- 2026SignMuon: Communication-Efficient Distributed Muon Optimizationcited by 2
Built on by
Not cited yet.