Skip to content

Scale-QLoRA: Code-Invariant Adapter Merging for Native 4-bit Microscaling LLMs

Sep 2026 · 1 citation · 35 references
Computer Science

TL;DR

Scale-QLoRA and merge-aware QAT-LoRA are both accuracy-lossless, so they claim no accuracy ordering between them; they differ structurally, in that QAT-LoRA re-derives the code plane through a quantizer while Scale-QLoRA preserves it exactly.

Abstract

Merging a LoRA adapter into its base model is standard deployment practice: it removes the runtime adapter's per-forward overhead and leaves a single standalone checkpoint any serving stack can load. On a native 4-bit microscaling checkpoint (NVFP4, MXFP4) that step stops being free. The merged weights must be written back through a quantizer, which re-derives the checkpoint's discrete E2M1 code plane (roughly 90% of the artifact's bytes), so the deployed artifact becomes coupled to one quantization convention, and every later code-touching event in its lifecycle can move it. Done naively the step is worse than fragile: it deletes the adaptation, by up to 39 pp, because against an already-on-grid base the reconstruction optimum is that base. Scale-QLoRA instead adapts only the native per-block scale field, trains those scales on the deployment grid, and freezes every E2M1 code. Within a fixed native format, scale grid, block layout and code plane, merging is then a bit-exact identity and the merged artifact is code-invariant. Across four models and four tasks, Scale-QLoRA and merge-aware QAT-LoRA are both accuracy-lossless, so we claim no accuracy ordering between them; they differ structurally, in that QAT-LoRA re-derives the code plane through a quantizer while Scale-QLoRA preserves it exactly. That difference is what the lifecycle prices: nearest-rounding implementations disagree by about a point on the measured task, and more extreme rule mismatches can drive the weight-space artifact to ~0%, which we report as a sensitivity bound rather than a deployment frequency. Preserving the code plane also drops the weight-space straight-through estimator from training (3.9x per step on the dense 8B model) and enables exact rollback, code-plane deduplication, and a ~125x faster scale-only task swap.

View source

Similar papers

Book Open access Sep 2026

Quantifying the Code-Size Overhead of eBPF JIT Compilation

eBPF allows user-defined programs to safely extend Linux kernel functionality at runtime, but its final machine code comes from a compilation pipeline that differs from native targets, and how efficient that pipeline is has no clear reference point. Our work constructs one: using the standard LLVM x86 backend as an app...

Hoang Duong, Hao Sun, Zhen-Dong Su · 0 citations
#artificial intelligence Preprint Sep 2026

Validating Hybrid-State Cache Recovery for GLM-5.3-Flash with vLLM and LMCache

The contribution is an experimentally validated integration repair applying an existing checkpoint-alignment principle, confined to one model revision and controlled configuration; it does not establish general determinism, task-quality equivalence, concurrent-serving gains, or capacity beyond GPU memory.

Frank Li · 0 citations
Conference Aug 2026

SAPA: A Programmable Shared Polynomial Arithmetic Accelerator with Semantic Handoff Validation for Staged ML-KEM/ML-DSA Flows

ML-KEM and ML-DSA are dominated by the same modular polynomial operators, which makes a shared FPGA datapath attractive. However, an accelerator that runs both primitives back to back has a failure mode that arithmetic checking alone cannot catch: a command can be locally correct yet bound to the wrong cross-command st...

Lei Peng, Ya-Lin Wang, Yun-Bo Jia et al. · 0 citations
Book Open access Sep 2026

To Migrate or Not to Migrate: KOxI, an Evidence-Gated Pipeline for Rust-for-Linux Storage Drivers

Rust-for-Linux (R4L) is landing storage code in mainline, but per-driver migration decisions are still largely a judgment call: maintainers must weigh historical bug exposure, residual unsafe surface, dynamic robustness, and execution cost without a shared evidence pipeline. We propose KOxI, an evidence-gated pipeline...

Guilherme Lima, Tomaz Mikio Sasaki · 0 citations
Preprint Aug 2026

Direct-Operable SIMD Bit-Slicing: A Framework for Memory-Efficient Predicate Evaluation

A novel framework that utilizes the Project Panama Vector API to perform predicate evaluation directly over bit-sliced, compressed data streams by transposing standard row-oriented data into parallel bit-planes to demonstrate a mechanism to evaluate complex filters using SIMD instructions without requiring prior decomp...

A. Mathiyazhagan · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.