paper-with-me

홈 › Papers

Intra-request branch orchestration for efficient LLM reasoning

2025-09-29 · Weifan Jiang, Rana Shahout, Yilun Du, Michael Mitzenmacher, Minlan Yu arxiv

Large Language Models (LLMs) increasingly rely on inference-time reasoning algorithms such as chain-of-thought and multi-branch reasoning to improve accuracy on complex tasks. These methods, however, substantially increase token usage and per-request latency. Prior work has largely focused on reducing token usage, often at the expense of accuracy, while overlooking other latency factors. We present DUCHESS, an LLM serving system that reduces cost and latency without sacrificing accuracy through intra-request branch orchestration guided by predictions. DUCHESS employs a lightweight linear probing model over LLM layer activations to estimate branch correctness, and its orchestration policy decides whether to terminate, duplicate, or continue a branch. When handling multiple requests, DUCHESS further reduces latency by prioritizing easier reasoning tasks when complexity can be estimated from the prompt. Experiments on three reasoning benchmarks show that DUCHESS consistently improves the token-accuracy Pareto frontier, reducing token usage by 42-63% at matched accuracy compared to self-consistency. In serving with vLLM, DUCHESS reduces mean, median, and tail latencies by 57-81%, 58-85%, and 52-84% with First-Come-First-Served scheduling, and achieves additional gains under difficulty-aware scheduling at higher request rates.

📄 PDF Abstract BibTeX arXiv:2509.24957

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Thinking Short and Right Over Thinking Long: Serving LLM Reasoning Efficiently and Accurately

2025-05-19 · Yuhang Wang, Youhe Jiang, Bin Cui, Fangcheng Fu

Recent advances in test-time scaling suggest that Large Language Models (LLMs) can gain better capabilities by generating Chain-of-Thought reasoning (analogous to human thinking) to respond a given request, and meanwhile…

Regulating Branch Parallelism in LLM Serving

2026-05-07 · Swapnil Gandhi, Siva Hari, William J. Dally, Christos Kozyrakis arxiv

Recent methods expose intra-request parallelism in LLM outputs, allowing independent branches to decode concurrently. Existing serving systems execute these branches eagerly or under fixed caps. We show that both are bri…

From Inference Routing to Agent Orchestration: Declarative Policy Compilation with Cross-Layer Verification

2026-03-28 · Huamin Chen, Xunzhuo Liu, Bowei He, Xue Liu arxiv

The Semantic Router DSL is a non-Turing-complete policy language deployed in production for per-request LLM inference routing: content signals (embedding similarity, PII detection, jailbreak scoring) feed into weighted p…

Tailored Learning-Based Scheduling for Kubernetes-Oriented Edge-Cloud System

2021-01-17 · Yiwen Han, Shihao Shen, Xiaofei Wang, Shiqiang Wang 외

Kubernetes (k8s) has the potential to merge the distributed edge and the cloud but lacks a scheduling framework specifically for edge-cloud systems. Besides, the hierarchical distribution of heterogeneous resources and t…

Scheduling

ETOM: A Five-Level Benchmark for Evaluating Tool Orchestration within the MCP Ecosystem

2025-10-22 · Jia-Kai Dong, I-Wei Huang, Chun-Tin Wu, Yi-Tien Tsai arxiv

We introduce ETOM, a five-level benchmark for evaluating multi-hop, end-to-end tool orchestration by LLM agents within a hierarchical Model-Context Protocol (MCP) ecosystem. Existing benchmarks often assess tools in isol…