TensorX
返回文献探索

Paper · arXiv 2412.20993

Efficiently Serving LLM Reasoning Programs with Certaindex

Yichao Fu, Junda Chen, Siqi Zhu, Zheyu Fu, Zhongdongming Dai, Aurick Qiao, Hao Zhang

35 upvotesDecember 30, 2024arXiv 预印本
AI 摘要

Dynasor optimizes compute resources for large language model inference by dynamically adjusting allocation based on query difficulty and reasoning progress.

large language modelsinference-time reasoningDynasorCertaindexcompute allocationquery difficultyreasoning progresscompute reductionquery rateslatency SLOs

Abstract

The rapid evolution of large language models (LLMs) has unlocked their capabilities in advanced reasoning tasks like mathematical problem-solving, code generation, and legal analysis. Central to this progress are inference-time reasoning algorithms, which refine outputs by exploring multiple solution paths, at the cost of increasing compute demands and response latencies. Existing serving systems fail to adapt to the scaling behaviors of these algorithms or the varying difficulty of queries, leading to inefficient resource use and unmet latency targets. We present Dynasor, a system that optimizes inference-time compute for LLM reasoning queries. Unlike traditional engines, Dynasor tracks and schedules requests within reasoning queries and uses Certaindex, a proxy that measures statistical reasoning progress based on model certainty, to guide compute allocation dynamically. Dynasor co-adapts scheduling with reasoning progress: it allocates more compute to hard queries, reduces compute for simpler ones, and terminates unpromising queries early, balancing accuracy, latency, and cost. On diverse datasets and algorithms, Dynasor reduces compute by up to 50% in batch processing and sustaining 3.3x higher query rates or 4.7x tighter latency SLOs in online serving.

北京市昌平区探索星信息技术及软件开发工作室

京ICP备2026059466号