Dynamic Mix Precision Routing for Efficient Multi-step LLM Interaction
Yuanzhe Li, Jianing Deng, Jingtong Hu, Tianlong Chen, Song Wang, Huanrui Yang
TL;DR
This work tackles the high compute cost of long-horizon LLM agentics by introducing a step-level dynamic mix-precision router that selects between high-precision and quantized models at each decision step. It pairs KL-divergence–based supervised supervision (KL-ST) with Group-Relative Policy Optimization (GRPO) to balance task success and inference cost, enabling efficient use of full-precision reasoning only at precision-critical steps. The approach is validated on ALFWorld across multiple model families and quantization levels, demonstrating superior accuracy-cost trade-offs and high gain per high-precision call (GHC) compared to baselines. By showing that a lightweight two-layer Transformer router suffices to guide precision decisions, the method offers practical, scalable improvements for deploying long-horizon LLM agents in real-world settings.
Abstract
Large language models (LLM) achieve strong performance in long-horizon decision-making tasks through multi-step interaction and reasoning at test time. While practitioners commonly believe a higher task success rate necessitates the use of a larger and stronger LLM model, multi-step interaction with a large LLM incurs prohibitive inference cost. To address this problem, we explore the use of low-precision quantized LLM in the long-horizon decision-making process. Based on the observation of diverse sensitivities among interaction steps, we propose a dynamic mix-precision routing framework that adaptively selects between high-precision and low-precision LLMs at each decision step. The router is trained via a two-stage pipeline, consisting of KL-divergence-based supervised learning that identifies precision-sensitive steps, followed by Group-Relative Policy Optimization (GRPO) to further improve task success rates. Experiments on ALFWorld demonstrate that our approach achieves a great improvement on accuracy-cost trade-off over single-precision baselines and heuristic routing methods.
