Inference efficiency

Quantization, distillation, pruning and serving work aimed at the same accuracy for less memory, latency and money.

6,122 stories · RSS feed

arXiv AI
Sep 1

Uncertainty Makes It Stable: Curiosity-Driven Quantized Mixture-of-Experts

The paper introduces a curiosity‑driven quantized Mixture‑of‑Experts framework that routes inputs based on Bayesian epistemic uncertainty across heterogeneous experts (BitNet ternary, 1‑16 bit BitLinear, post‑training quantization). On audio classification benchmarks, 4‑bit quantization preserves 99.9 % of full‑precision F1 while achieving 4× compression and 31 % energy savings, and curiosity‑driven routing further improves accuracy and reduces cross‑fold variance by up to 85 %. The routing is self‑organizing, allocating the most uncertain samples to the high‑precision expert, and the method demonstrates statistical parity with full precision across datasets.

By Sebasti\'an Andr\'es Cajas Ord\'o\~nez, Luis Fernando Torres Torres, Mackenzie J. Meni, Carlos Andr\'es Duran Paredes, Eric Arazo, Cristian Bosch, Ricardo Simon Carbajo, Yuan Lai, Leo Anthony Celi
arXiv Computation and Language
Sep 1

GRKV: Global Regression for Training-Free KV Cache Compression in Long-Context LLMs

The paper introduces GRKV, a training‑free method for compressing the key‑value cache in long‑context large language models. GRKV uses ridge‑regression to redistribute information from evicted tokens to retained ones, aiming to minimize the difference between compressed‑cache and full‑cache attention outputs. Experiments on LongBench and RULER show that GRKV improves overall performance with minimal overhead compared to other merging methods.

By Junjie Peng, You Wu, Haoyi Wu, Jialong Han, Xiaohua Xie, Kewei Tu, Jianhuang Lai
arXiv Computation and Language
Sep 1

Investigating Social Bias Changes in Quantized Language Models

Post‑training quantization of large language models reduces memory usage but can alter social biases in ways that aggregate metrics miss. In a large‑scale study of 50 quantized models on PostTrainingBiasBench, the authors discovered a phenomenon called quantization‑induced bias flipping, where up to 21% of responses switch from biased to unbiased or vice versa, especially for uncertain predictions and stronger quantization (4‑bit vs 8‑bit). These flips lead to asymmetric impacts across demographic groups, with some groups experiencing up to an 18.6% worsening of bias while others improve by 14.1%, resulting in misleadingly neutral overall scores.

By Stanley Z. Hua, Sanae Lotfi, Irene Y. Chen
arXiv Computation and Language
Sep 1

SpanCalib-VLM: Calibrated Hallucination Span Detection in Vision-Language Models

SpanCalib-VLM is a hybrid system for detecting hallucinated text spans in Vision‑Language Models. It combines a multimodal sequence tagger (XLM‑RoBERTa‑Large + SigLIP) with a fine‑tuned generative VLM (Qwen3.5‑4B‑SHROOM‑SFT) and uses a Union‑Calibrated Fusion strategy to re‑score candidate spans. On the SHROOM‑Visions English evaluation split, the ensemble achieves a Pearson calibration correlation of 0.41, an overall IoU of 0.39, a clean‑response IoU of 0.91, and a detection accuracy of 70.7%.

By Amanuel Gizachew Abebe, Yasmin Moslem
arXiv Computation and Language
Sep 1

Context-Aware Interleaved Batching for WhisperX

Context-Aware Interleaved Batching for WhisperX proposes a new batching strategy that combines WhisperX’s fast intra-audio batching with Whisper’s sequential context retention. By using voice activity detection (VAD) to define segment boundaries, the algorithm stabilizes Whisper’s text conditioning and preserves continuous historical context across batched audio segments. Experiments on long‑form audio benchmarks show reduced Word Error Rate and improved proper noun transcription while maintaining high‑throughput inference speeds.

By Carlos Bain, Max Bain
arXiv AI
Sep 1

Reconciling Process Supervision with Outcome-Based Credit in Agentic Policy Optimization

The paper introduces TASPO, a method that transforms privileged information (PI) into outcome‑grounded action credit for language‑model agents. TASPO constructs decision‑applicable PI from verified successful experience, aggregates PI‑induced likelihood shifts at the executable‑action level, and converts relative action support into positive, bounded, mean‑preserving weights on the original trajectory advantage. Experiments on three agentic benchmarks show TASPO improves over GRPO by 10.6% and generalizes better to unseen tasks, while reducing supervision mismatch and stabilizing policy optimization.

By Jingxiao Yang, Wangjie Gan, Yingxuan Zhuang, Wenqi Zhang, Jintao Chen, Xuhong Zhang
arXiv Computer Vision
Sep 1

RoboMirror: Understand Before You Imitate for Video to Humanoid Locomotion

arXiv:2512.23649v5 Announce Type: replace-cross Abstract: Humans learn locomotion through visual observation, interpreting visual content first before imitating actions. However, state-of-the-art hum...

By Zhe Li, Boan Zhu, Yangyang Wei, Shuanghao Bai, Yuheng Ji, Yibo Peng, Tao Huang, Pengwei Wang, Zhongyuan Wang, S. -H. Gary Chan, Chang Xu, Cheng Chi, Jianfei Yang, Shanghang Zhang