Inference efficiency

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

6,043 stories · RSS feed

arXiv AI
Sep 2

Drift-Aware LLM Routing with Sparse Contexts and Shared Budgets

The paper introduces Drift‑Aware Sparse Routing (DRS), a method for routing requests in a multi‑model language service while respecting compute, latency, memory, or cost budgets. DRS estimates reward and resource use from a rolling audit window, routes using pessimistic reward and optimistic cost estimates, updates resource shadow prices online, and applies a hard meter before commitment. The authors provide theoretical regret bounds that separate control from statistics, showing how the method adapts to non‑stationary prompt distributions and model changes.

By Cheung Hao Lee, Patrick Wong
arXiv AI
Sep 2

Triple-Bottom-Line Sustainability of Language Models for Edge AI: A Comparison Between SLMs and Quantized LLMs

The paper compares the sustainability of native small language models (SLMs) versus large language models (LLMs) compressed via post‑training quantization for edge AI deployment. Using a Holistic Sustainability Score (HSS) that balances capability, efficiency, and safety, the study evaluates 30 configurations across five benchmarks, latency, VRAM, energy, and harmful‑prompt robustness. Results show that optimized quantized LLMs can outperform SLMs overall, while SLMs remain competitive due to lower resource demands, challenging the assumption that native SLMs are always the most sustainable choice.

By Jainil Dharmil Shah
arXiv AI
Sep 2

Making Prospective Memory SLM-Shaped: Typed Intention Stores for Small-Model Agents

The paper introduces the Prospective Intention Store (PIS), a method that places lifecycle logic in code and confines language tasks to a typed action space, enabling small models to perform prospective memory tasks more effectively. Using PIS, a small model (DeepSeek-Chat) achieves 82.9% Set‑F1 on PM‑Bench, surpassing the previous best of 65.1%. On Gemma‑E2B, PIS boosts Set‑F1 from 4.2% (without a store) to 66.2%, and reaches 70.1% Set‑F1, outperforming retrospective memory approaches that max out at 54.4%.

By Jinqing Zhao, Chengcan Wu
arXiv AI
Sep 2

A Closed-Loop Evaluation of Capability Loss and Recovery in Compressed Driving Policies

The paper introduces a stage‑wise closed‑loop evaluation method to track how compression techniques affect learned driving policies. Using a POMDP formulation and PPO‑trained belief‑state policy in Gym‑Duckietown, the authors compress the actor step by step and test it across five driving curricula. They find that structured pruning first degrades driving capability, distillation can partially recover it but is limited by rehearsal data, and integer quantization further loses curricula requiring stopping and resuming, whereas the unpruned actor retains all curricula.

By Ahmad Alfan Alfian Irfan, Nur Ahmad Khatim, Mansur Arief
arXiv AI
Sep 2

Global Attention with Linear Complexity for Exascale Generative Data Assimilation in Earth System Prediction

The paper introduces STORM, a one‑stage generative AI framework that reformulates Earth system data assimilation as diffusion‑based Bayesian posterior sampling, replacing costly PDE ensemble forecasts with scalable AI inference. STORM employs a spatiotemporal transformer with a global‑attention algorithm that reduces computational complexity from quadratic to linear, enabling high‑resolution, long‑context modeling. The system scales to 74,400 GPUs on Frontier, achieving 96–99 % strong‑scaling efficiency and up to 6 ExaFLOPs sustained BF16 throughput, while supporting 32,768‑member ensembles for uncertainty quantification in just 34 seconds on 4,096 GPUs, and demonstrates improved hurricane tracking and climate reanalysis accuracy.

By Xiao Wang, Zezhong Zhang, Isaac Lyngaas, Hong-Jun Yoon, Jong-Youl Choi, Siming Liang, Janet Wang, Hristo G. Chipilski, Ashwin M. Aji, Feng Bao, Peter Jan van Leeuwen, Dan Lu, Guannan Zhang
arXiv AI
Sep 2

When Features Become Instances: Inverted Contrastive Learning for Unsupervised Feature Selection

The paper introduces Inverted Contrastive Learning for Unsupervised Feature Selection (ICLFS), a method that treats each feature as a sample by inverting the data matrix and applies a contrastive learning framework to learn consistent representations across masked positive views and a shuffled negative view. Feature saliency is derived from the magnitude of projector‑space embeddings, and a Laplacian‑Gated Ranking Correction step refines the ranking by reducing local redundancy. Experiments on 12 benchmark datasets show that ICLFS achieves the best clustering accuracy on 10 datasets compared to both classical and neural baselines, demonstrating the effectiveness of feature‑wise contrastive consistency for unsupervised feature selection.

By Utsab Ghosh, Roshni Chakraborty
arXiv AI
Sep 2

Is Human Annotation Necessary? Iterative MBR Distillation for Error Span Detection in Machine Translation

The paper introduces Iterative MBR Distillation for Error Span Detection (ESD) in machine translation, a self‑evolution framework that replaces human annotations with pseudo‑labels generated by a large language model. By iteratively applying Minimum Bayes Risk decoding, the method produces high‑quality error spans without costly human effort. Experiments on WMT Metrics Shared Task datasets show that models trained solely on these pseudo‑labels outperform both unadapted baselines and supervised models trained on human data at system and span levels, while keeping sentence‑level performance competitive.

By Boxuan Lyu, Haiyue Song, Zhi Qu
arXiv Machine Learning
Sep 2

Subliminal Learning as Trait-Direction Drift: A Mechanism and Targeted Control under SFT Distillation

The paper investigates subliminal learning, where hidden traits from a teacher model are transferred to a student during distillation. It introduces trait‑direction drift as the underlying mechanism, showing that biased generation creates measurable preference gaps that accumulate into behavioral transfer during fine‑tuning. The authors propose probe‑space corridor regularization, a targeted defense that constrains drift along a calibrated trait direction, significantly reducing hidden‑trait transfer while maintaining task performance.

By Zhixuan Liu, Zhichen Dong, Yuyu Fan, Xiangtian Li, Chao Yang
arXiv Computer Vision
Sep 2

From Saliency to Discriminability: Rank-Preserving Visual Token Pruning for VLM Rerankers

arXiv:2609.00667v1 Announce Type: cross Abstract: Large vision-language models used as listwise rerankers must jointly process visual tokens from tens of candidates per query, making token pruning es...

By Siyi Liu, Hanjun Yang, Chenchen Zhang, Xiaorong Zhu, Xinyu Zuo, Lisheng Duan, Haijin Liang, Jin Ma, Junfu Pu, Yongqi Zhang