Skip to content
Open access

CORAL: co-evolutionary optimization of routing and adaptive prompts for cost-efficient LLM deployment

Sep 2026 · Frontiers in Artificial Intelligence · Vol 9 · 0 citations · 46 references
Medicine

TL;DR

Treating prompt design and model selection as coupled decisions rather than independent steps offers a practical path toward lower-cost, higher-accuracy LLM deployment, and the PRCP formulated here provides a reusable framework for studying this coupling in future work.

Abstract

Deploying large language models in practice means balancing not just answer quality but also the cost and latency of producing each answer, a balance that a single fixed model rarely achieves effectively. To address this issue, two methodologies are adopted: using the best model while keeping the prompt fixed, and changing the prompt according to the query while changing the model. A model has been designed that uses the Prompt–Router Co-Evolutionary Problem (PRCP) and CORAL, which stands for Co-Evolutionary Optimization of Routing and Adaptive Prompts. It considers model selection and prompt patterns as interrelated operations and is structured to improve the performance of both simultaneously. This is achieved by maintaining two groups: one for prompts and the other for routing strategies, allowing a linked interconnection between them. This entire process is guided by multi-objective optimization techniques (NSGA-II/III) to improve correctness, cost balance, throughput, and latency. The test datasets used for evaluation include MMLU, GSM8K, and Wild Chat, which measure AI model performance. The results show that CORAL is more cost-efficient than existing methods. On GSM8K, at a matched accuracy level, it reduces cost by 31.4 percent relative to RouteLLM. At a matched cost budget, it increases accuracy by up to 4.8 percentage points, again on GSM8K against RouteLLM, and lowers the average per-query latency by 12.2 percent. Taken together, these findings suggest that treating prompt design and model selection as coupled decisions rather than independent steps offers a practical path toward lower-cost, higher-accuracy LLM deployment. The PRCP formulation introduced here provides a reusable framework for studying this coupling in future work.

Read PDF

Similar papers

Sep 2026

LLM4ETS: Self‐Evolving Algorithm Design for Edge Task Scheduling via Large Language Models

With the rapid proliferation of 5G and the Internet of Things, ensuring low latency in edge computing has become crucial for real‐time processing applications. However, existing task scheduling approaches often struggle to balance multiple optimization objectives effectively due to manual parameter tuning and slo...

Yu-Qi Zhao, Shen-Dong Gao, Ya-Tong Wang et al. · 0 citations
Preprint Aug 2026

SCOPE-Router: Cost-Aware Open-Set VLM Routing for Execution-Oriented Tasks

CRM+RCCR, an architecture-agnostic cost-aware objective that encodes cost preference into continuous relevance targets through per-pair independent scoring, eliminating multi-positive dilution while regularizing queries with similar routing preferences to be closer in the routing space.

Tao Yu, Yi-Fei Qu, Zhi-Qing Cui et al. · 1 citation
Open access 2026

Vertical Routing: A Cost-Efficient Collaboration Routing Framework

Experiments show that VERTICAL ROUTING outperforms the strongest baseline (RouterDC) by 2.0 points in the averaged metric, while significantly reducing token usage and large-model output share, and enhances stability by lowering the standard deviation by 87.5%.

Si Shen, Pei-Jun Shen, Dan-Hao Zhu · 0 citations
Conference Aug 2026

CHQR: A Context-Aware Hybrid Query Routing Framework for Energy-and Latency-Optimized Academic Question Answering

The rapid adoption of Large Language Models (LLMs) for academic question answering has led to significant computational overhead, increased latency, and high energy consumption, even for queries that require minimal reasoning. Existing systems typically route all queries to LLMs without considering their complexity or...

Н. Н. Курьян, Devika Shibu, Libya Thomas et al. · 0 citations
Conference Aug 2026

Distance-Aware Cache Server Placement for Anycast CDNs via Genetic Algorithm

In anycast content delivery networks (CDNs), client requests are naturally routed to the topologically closest cache server (CS) via the border gateway protocol (BGP). However, BGP routing policies frequently cause path inflation, directing clients to geographically distant servers and severely degrading delivery laten...

Futo Masai, Noriaki Kamiyama · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.