Pith. sign in

REVIEW 3 cited by

Optimising Calls to Large Language Models with Uncertainty-Based Two-Tier Selection

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 2405.02134 v1 pith:CNJPCUC4 submitted 2024-05-03 cs.CL

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

Researchers and practitioners operating on a limited budget face the cost-performance trade-off dilemma. The challenging decision often centers on whether to use a large LLM with better performance or a smaller one with reduced costs. This has motivated recent research in the optimisation of LLM calls. Either a cascading strategy is used, where a smaller LLM or both are called sequentially, or a routing strategy is used, where only one model is ever called. Both scenarios are dependent on a decision criterion which is typically implemented by an extra neural model. In this work, we propose a simpler solution; we use only the uncertainty of the generations of the small LLM as the decision criterion. We compare our approach with both cascading and routing strategies using three different pairs of pre-trained small and large LLMs, on nine different tasks and against approaches that require an additional neural model. Our experiments reveal this simple solution optimally balances cost and performance, outperforming existing methods on 25 out of 27 experimental setups.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. TagRouter: Learning Route to LLMs through Tags for Open-Domain Text Generation Tasks

    cs.CL 2025-06 conditional novelty 6.0 of 10

    TagRouter, a tag-based LLM routing method with a distilled tag generator and a tag-score lookup table, reports a 6.15% Accept Rate gain and 17.20% cost reduction over the largest candidate model on the proprietary BCU...

  2. 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.

  3. 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.

Pith tools