Skip to main content
Search

# Model compression

10 related articles

Subscribe to updates
  1. arXiv

    How many bits a fine-tune must keep: the same dataset needs 1.03 bits per value on one frozen model and 0.41 on another

    The information a fine-tune writes into its adapter is now measured not by parameter count or weight reconstruction error but as the smallest serialized size of a compressed adapter that, reloaded into the frozen model, keeps 90% of the held-out fine-tuning gain. The same dataset demands very different rates across frozen models: keeping 90% of the math gain takes 1.03 bits per value on Qwen2.5-Math-7B but 0.41 on Qwen2.5-7B, and on an adapter trained with deliberately mismatched reasoning supervision, compression lifts GSM8K accuracy from 23.7% to 82.9%, above the frozen Qwen2.5-7B's 77.6%.

  2. arXiv

    AutoCompress writes deployment limits into pruning search: up to 6.57 points higher average accuracy than Minitron++ across three GPUs

    LLM pruning usually targets parameter counts, but parameter count does not predict latency, throughput or memory, which depend on architecture, workload, hardware and serving engine. AutoCompress puts latency, throughput, parameter and memory constraints directly into differentiable architecture search, searching global dimensions and per-layer structure together and guided by cost models calibrated by measurement inside the target serving engine. Under the same deployment budgets and matched recovery training as Minitron++, it raises average accuracy across eight benchmarks by 6.57, 2.35 and 0.57 percentage points on RTX 5070, RTX 5080 and H100, using roughly one-half to one-third as many architecture-selection tokens.

  3. Mixed-precision quantization stops treating each layer as one bit width: A2BQ assigns bits per block by attention sensitivity, reaching 7.884 perplexity on TinyLlama

    LLM quantization usually gives an entire layer one bit width, ignoring that weight blocks within a layer differ in sensitivity to quantization noise. A2BQ scores each 128-row weight block by post-softmax attention variance from an FP16 model on a WikiText-2 calibration set, allocates 4/6/8 bits under a 5.7-bit average budget, and sets qLoRA+ LoRA ranks from layer sensitivity and assigned precision. On TinyLlama-1.1B, the attention-scope configuration with three protected layers at each boundary reaches 7.884 test perplexity at 73.11 tokens/s, while runtime GPU memory stays near FP16 because the reference backend dequantizes weights into floating-point buffers before computing.

  4. Trained Gaussian-splat scenes no longer need retraining to shrink: post-hoc entropy coding reaches 6.0x on 13 scenes at a 0.03 dB quality change

    Trained anchor-based Gaussian-splat scenes stay too large for phones and headsets, and existing post-hoc converters saturate early. This scheme treats a trained model as a read-only artifact, fits a per-scene hash-grid entropy context with per-channel Laplace distributions, and codes attributes into a Morton-ordered, progressively decodable bitstream. Across 13 scenes on three benchmarks, the post-hoc mode averages 6.0x compression at a -0.03 dB quality change and runs unchanged on third-party checkpoints.

  5. arXiv

    MoE precision pays twice: store one 4.27 bpw copy, read 2.9 bpw per workload, and stay near 4-bit formats

    Mixture-of-experts weight precision carries two separate costs, one for storage and one for decode; DuoRate stores a single 4.27 bpw copy and picks a read prefix per workload from that workload's own prefill, reaching 76.16 average accuracy at a 2.9 bpw read rate on Qwen3-30B-A3B, close to 4-bit formats.

  6. arXiv

    Low-rank compression stops spending the same compute per token: training only routers lifts Llama-2-7B downstream accuracy by 7.6 points

    Low-rank compression previously assigned a fixed rank during inference, so every token cost the same compute. LRCC adds one lightweight router per Transformer block that selects among a few nested low-rank paths for each token, training only the routers while the low-rank factors stay frozen. Within the same average active-parameter budget, Llama-2-7B gains 7.6 percentage points in average downstream accuracy over static low-rank compression; at matched batch-size-1 decoding latency, Llama-3.2-1B improves both perplexity and downstream accuracy and Llama-2-7B stays competitive, without specialized CUDA kernels.

  7. arXiv

    AWT uses activation-derived diagonal preconditioning to close 12–60% of the tensor-network compression perplexity gap on Llama, Ministral, and Qwen

    The authors propose Activation-aware Weight Tensorization (AWT), a training-free, solver-agnostic calibration-time preconditioner that applies an activation-derived diagonal equivalent reparameterization to each weight matrix before an unchanged TT/TTN solver and deploys it with only an input-side elementwise rescaling. Across Llama 3.1 8B, Ministral 8B, and Qwen2.5 7B at 2–6 compression, AWT consistently improves vanilla tensorization: it closes 12–35% of the WikiText perplexity gap under single-operator replacement and 27–60% under Llama multi-operator suffix replacement, with gains transferring to HellaSwag and ARC-Challenge.

  8. arXiv

    Researchers find high-BOS sink attention heads are redundant components, and pruning them retains downstream tasks more reliably than weight- and activation-based criteria on Gemma-3, Llama-3.1, and Qwen3

    The work identifies the BOS sink phenomenon as a key mechanism driving layer-wise redundancy sensitivity in large language models, showing that attention heads with high BOS sink scores, especially in deeper layers, contribute little to predictive performance and effectively serve as dumping grounds for superfluous attention weights, and introduces a simple pruning strategy that removes high-BOS sink heads; experiments on Gemma-3, Llama-3.1, and Qwen3 show this approach identifies redundant transformer components more reliably than weight- and activation-based criteria in terms of downstream task retention, remaining close to dense baselines at low-to-moderate pruning ratios, and that high-scoring sink heads sustain their focus on BOS as context length grows.

  9. arXiv

    DPRD aligns ROI-masked displacement vectors so a student with ~5% of the teacher's parameters reaches 85.46% Dice on AMOS, edging out MedNeXt

    The work proposes Displacement-Preserving Relational Distillation (DPRD), which in nnU-Net aligns batch-wise pairwise displacement vectors on ROI-masked case-level embeddings with relational scale normalization, and on ISLES 2022 and AMOS 2022 lets students using about 5% of the teacher's parameters and about 3% of its FLOPs outperform Logits KD, FitNet, RKD, and CIRKD, reaching 85.46% Dice and 11.72 mm HD95 on AMOS.

  10. arXiv

    DCD raises compressed 3D MRI segmentation mDice from 63.60% to 68.51% on BraTS 2024 and to 73.95% on ISLES 2022 while cutting parameters from 101.9M to 6.4M

    The authors propose Detail Consistent Distillation (DCD), which applies a 3D discrete wavelet transform to teacher and student encoder features at every stage during training and aligns only the directional detail subband D (excluding the low-frequency approximation A and the most noise-prone extreme high-frequency band S) after inverse-wavelet reconstruction in the spatial domain, raising the mDice of a 4x channel-reduced student from 63.60% to 68.51% on BraTS 2024 and from 70.21% to 73.95% on ISLES 2022 with no inference-time overhead.

You’re all caught up