Pith. sign in

REVIEW 23 cited by

Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.14618 v1 pith:GM6SEGDP submitted 2024-04-22 cs.LG cs.AIcs.CL

classification cs.LGcs.AIcs.CL
keywords qualityapproachcostlargedesiredhybridlevelmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large language models (LLMs) excel in most NLP tasks but also require expensive cloud servers for deployment due to their size, while smaller models that can be deployed on lower cost (e.g., edge) devices, tend to lag behind in terms of response quality. Therefore in this work we propose a hybrid inference approach which combines their respective strengths to save cost and maintain quality. Our approach uses a router that assigns queries to the small or large model based on the predicted query difficulty and the desired quality level. The desired quality level can be tuned dynamically at test time to seamlessly trade quality for cost as per the scenario requirements. In experiments our approach allows us to make up to 40% fewer calls to the large model, with no drop in response quality.

Discussion (0). Sign in to comment.

Forward citations

Cited by 23 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Routing Is Least Learnable Where It Is Most Valuable: Bounds on Representation Routing for Web Agents

    cs.CL 2026-08 accept novelty 7.0 of 10

    Per-task routing between text, image, and hybrid observations of a browser page does not currently beat one fixed choice, because the labels needed to learn routing exist only where the agent already succeeds; only a ...

  2. TSRouter: Dynamic Modality-Model Selection for Time Series Reasoning

    cs.LG 2026-07 conditional novelty 6.5 of 10

    A heterogeneous-graph router jointly selects the optimal modality (text, vision, or both) and model per time series query, beating prior routing baselines and generalizing to unseen models and tasks.

  3. A Workflow-Aware Serving Layer for Agentic Applications

    cs.DC 2026-07 conditional novelty 6.5 of 10

    A workflow-aware serving layer compiles per-node model-verifier-backend plans with an ILP and adapts only uncommitted work via pre-solved pressure rungs and residual re-solves.

  4. Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First

    cs.SE 2026-08 conditional novelty 6.0 of 10

    A 7B searcher's sandbox-verified handoff lets a cheap coding model match a frontier model's solve rate on SWE-bench Pro at roughly one fifth the cost, while the router that picks the fixer contributes nothing on this ...

  5. PyroDash: Cost-Efficient Token-Level Small-Large Language Model Collaborative Inference

    cs.CL 2026-07 conditional novelty 6.0 of 10

    PyroDash lets a small model decide mid-generation to hand off once to a frozen LLM, achieving 64.04% accuracy (+6.36 points vs LLM) at lambda=0.05 and 96.4% lower estimated cost at lambda=0.6.

  6. HACO: Hedged Agent Computing for Reliable LLM Systems

    cs.NI 2026-07 conditional novelty 6.0 of 10

    HACO adaptively selects a reliability-constrained hedge set of candidate LLM agent instances for each role invocation, improving robustness under changing deployment conditions at lower token/latency cost than full-po...

  7. Routing Without Training: Controllable-Ratio LLM Offloading via Reliability Gating

    cs.AI 2026-05 conditional novelty 6.0 of 10

    A training-free router for local-cloud LLM collaboration uses prompt-varied self-consistency with Bayesian early stopping to control offload ratios and beat baselines.

  8. Optimal-Agent-Selection: State-Aware Routing Framework for Efficient Multi-Agent Collaboration

    cs.AI 2025-11 conditional novelty 6.0 of 10

    A state-aware contrastive router that selects the most relevant agent at each step improves multi-agent LLM accuracy by up to 23.8% while using a fraction of the tokens of fixed-pipeline baselines.

  9. Adaptive LLM Routing under Budget Constraints

    cs.LG 2025-08 conditional novelty 6.0 of 10

    LLM routing is framed as a budget-constrained contextual bandit, solved by a preference-prior initialized LinUCB variant with an online multi-choice knapsack cost policy.

  10. Quality-of-Service Aware LLM Routing for Edge Computing with Multiple Experts

    cs.NI 2025-08 conditional novelty 6.0 of 10

    A DRL router using graph attention state abstraction and QoS-aware rewards improves average QoS by up to 35.78% over four baselines in simulated edge LLM routing.

  11. DSSD: Efficient Edge-Device LLM Deployment and Collaborative Inference via Distributed Split Speculative Decoding

    eess.SP 2025-07 conditional novelty 6.0 of 10

    DSSD moves the resample step of speculative decoding onto the device, replacing the upload of many token distributions with a single download when a draft is rejected.

  12. Orchestration for Domain-specific Edge-Cloud Language Models

    cs.DB 2025-07 conditional novelty 6.0 of 10

    ECO-LLM jointly selects query processing, retrieval, and model components per query, cutting cost by 60% and latency up to 6x versus model routing in edge-cloud tests.

  13. IRT-Router: Effective and Interpretable Multi-LLM Routing via Item Response Theory

    cs.AI 2025-06 conditional novelty 6.0 of 10

    An IRT-based router that models each LLM's latent ability and each query's difficulty outperforms RouterBench on cost-performance reward across ID and OOD benchmarks.

  14. Trading Human Curation for Synthetic Augmentation in RLVR

    cs.LG 2026-06 unverdicted novelty 5.0 of 10

    Gated synthetic augmentations of a 10-task human base substitute for ~87 extra human RLVR tasks on aggregate held-out pass@1, with cost-adjusted trade rate ρ_cost in [1.4×, 11.6×].

  15. Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference

    cs.MA 2025-09 reject novelty 5.0 of 10

    MoMA routes each query to a specialized agent or to the cost-optimal LLM, using judge-trained performance scores, a Pareto cost frontier, and TOPSIS selection.

  16. Balancing Information Accuracy and Response Timeliness in Networked LLMs

    cs.LG 2025-08 conditional novelty 5.0 of 10

    For binary questions, combining m specialized LLMs with a Bayesian majority rule improves accuracy, and the paper derives the optimal m that trades accuracy against system delay.

  17. Semantic Scheduling for LLM Inference

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A semantic scheduler for LLM inference uses urgency labels and estimated remaining compute to cut waiting times for urgent requests, tested on emergency medical data.

  18. Toward Edge General Intelligence with Multiple-Large Language Model (Multi-LLM): Architecture, Trust, and Orchestration

    cs.NI 2025-07 conditional novelty 4.0 of 10

    A survey of multi-LLM systems in edge computing, covering architectures, enabling technologies, trust mechanisms, applications, and open datasets for edge general intelligence.

  19. Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning

    cs.LG 2025-06 reject novelty 4.0 of 10

    A difficulty-based ensemble that routes instances to specialized models is proposed, but reported gains are not tested against standard ensemble baselines and are filtered to favorable cases.

  20. FAA Framework: A Large Language Model-Based Approach for Credit Card Fraud Investigations

    cs.CR 2025-06 reject novelty 4.0 of 10

    The FAA framework automates credit card fraud investigations with GPT-4o agents and reports 98-99% fraud-detection F1, though the evaluation is weakened by self-referential LLM scoring.

  21. Towards Efficient Multi-LLM Inference: Characterization and Analysis of LLM Routing and Hierarchical Techniques

    cs.LG 2025-06 unverdicted novelty 4.0 of 10

    A survey of LLM routing and hierarchical inference techniques that proposes an unvalidated unified evaluation metric called the Inference Efficiency Score.

  22. Token-Operations-Oriented Inference Optimization Techniques for Large Models

    cs.SE 2026-06 unverdicted novelty 3.0 of 10

    The paper introduces a four-layer technical architecture for token-operations-oriented inference optimization in large models and reviews key technologies and industry status at each layer.

  23. Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey

    cs.AI 2025-07 conditional novelty 3.0 of 10

    A comprehensive review that categorizes methods for shortening and adaptively triggering chain-of-thought reasoning in large language models.

Pith tools