Sign inGet started
Paper · arXiv

Low-Rank Ternary Adaptation for Fine-Tuning Transformers

Ternary transformers offer extreme memory and compute efficiency, but existing low-bit LoRA-based methods cannot directly fine-tune ternary weights. Current approaches either require dequantization, restoring low-bit base weights to higher precision to merge with adaptation weight, or update only quantization parameters, preventing a merged model that remains ternary. We propose ternary multiplicative adaptation, which represents discrete updates of ternary weights such as sign flips or zeroing through a low-rank Kronecker factorization into two small ternary matrices applied element-wise to ternary weights. This design is parameter-efficient and expressive, preserves the ternary domain, ...

AuthorsAlexandru-Dragos Manolache, Yunqiang Li, Jan van Gemert
Primary categorycs.CV
Published25 August 2026
Last updated at source25 August 2026
cs.CVcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/ea2eb58b-ed1a-4436-be5a-cf7e91f031b5" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.