SMART: Automatically Scaling Down Language Models with Accuracy Guarantees for Reduced Processing Fees
Not on the map. Why?
Abstract (arXiv)
The advancement of Large Language Models (LLMs) has significantly boosted performance in natural language processing (NLP) tasks. However, the deployment of high-performance LLMs incurs substantial costs, primarily due to the increased number of parameters aimed at enhancing model performance. This has made the use of state-of-the-art LLMs more expensive for end-users. AI service providers, such as OpenAI and Anthropic, often offer multiple versions of LLMs with varying prices and performance. However, end-users still face challenges in choosing the appropriate LLM for their tasks that balance result quality with cost. We introduce SMART, Scaling Models Adaptively for Reduced Token Fees, a novel LLM framework designed to minimize the inference costs of NLP tasks while ensuring sufficient result quality. It enables users to specify an accuracy constraint in terms of the equivalence of outputs to those of the most powerful LLM. SMART then generates results that deviate from the outputs of this LLM only with a probability below a user-defined threshold. SMART employs a profiling phase that evaluates the performance of multiple LLMs to identify those that meet the user-defined accuracy level. SMART optimizes the tradeoff between profiling overheads and the anticipated cost savings resulting from profiling. Moreover, our approach significantly reduces inference costs by strategically leveraging a mix of LLMs. Our experiments on three real-world datasets show that, based on OpenAI models, SMART achieves significant cost savings, up to 25.6x in comparison to GPT-4.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 16 of its 30 references that are in the map. First posted on arXiv 11 Mar 2024.
Builds on
16 of 30 references.
References · 16
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2022Large Language Models are Zero-Shot Reasonerscited by 4,323
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2023Large Language Model Cascades with Mixture of Thoughts Representations for Cost-efficient Reasoningcited by 140
- 2020The Right Tool for the Job: Matching Model and Instance Complexitiescited by 125
- 2023Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systemscited by 101
- 2023Batch Prompting: Efficient Inference with Large Language Model APIscited by 84
- 2023When Does Confidence-Based Cascade Deferral Suffice?cited by 58
- 2023Compress, Then Prompt: Improving Accuracy-Efficiency Trade-off of LLM Inference with Transferable Promptcited by 28
4 more
- 2023On Optimal Caching and Model Multiplexing for Large Model Inferencecited by 20
- 2018VerdictDB: Universalizing Approximate Query Processingcited by 11
- 2014Rapid Sampling for Visualizations with Ordering Guaranteescited by 4
- 2013A Sampling Algebra for Aggregate Estimationcited by 1
Built on by
Citing papers per year: 2025: 2.
2 papers.