Cut Costs, Not Accuracy: LLM-Powered Data Processing with Guarantees
Open Access
- 4 December 2025
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (6) , 1-26
Abstract
Large Language Models (LLMs) are being increasingly used as a building block in data systems to process large text datasets. To do so, LLM model providers offer multiple LLMs with different sizes, spanning various cost-quality trade-offs when processing text at scale. Top-of-the-line LLMs (e.g., GPT-4o, Claude Sonnet) operate with high accuracy but are prohibitively expensive when processing many records. To avoid high costs, more affordable but lower quality LLMs (e.g., GPT-4o-mini, Claude Haiku) can be used to process records, but we need to ensure that the overall accuracy does not deviate substantially from that of the top-of-the-line LLMs. The model cascade framework provides a blueprint to manage this trade-off, by using the confidence of LLMs in their output (e.g., log-probabilities) to decide on which records to use the affordable LLM. However, existing solutions following this framework provide only marginal cost savings and weak theoretical guarantees because of poor estimation of the quality of the affordable LLM's outputs. We present BARGAIN, a method that judiciously uses affordable LLMs in data processing to significantly reduce cost while providing strong theoretical guarantees on the solution quality. BARGAIN employs a novel adaptive sampling strategy and statistical estimation procedure that uses data and task characteristics and builds on recent statistical tools to make accurate estimations with tight theoretical guarantees. Variants of BARGAIN can support guarantees on accuracy, precision, or recall of the output. Experimental results across 8 real-world datasets show that BARGAIN reduces cost, on average, by up to 86% more than state-of-the-art, while providing stronger theoretical guarantees on accuracy of output, with similar gains when guaranteeing a desired level of precision or recall.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- RetClean: Retrieval-Based Data Cleaning Using LLMs and Data LakesProceedings of the VLDB Endowment, 2024
- Solo: Data Discovery Using Natural Language Questions Via A Self-Supervised ApproachProceedings of the ACM on Management of Data, 2023
- Accelerating Aggregation Queries on Unstructured Streams of DataProceedings of the VLDB Endowment, 2023
- How Large Language Models Will Disrupt Data ManagementProceedings of the VLDB Endowment, 2023
- Estimating means of bounded random variables by bettingJournal of the Royal Statistical Society Series B: Statistical Methodology, 2023
- On Efficient Approximate Queries over Machine Learning ModelsProceedings of the VLDB Endowment, 2022
- How Can We Know When Language Models Know? On the Calibration of Language Models for Question AnsweringTransactions of the Association for Computational Linguistics, 2021
- Accelerating approximate aggregation queries with expensive predicatesProceedings of the VLDB Endowment, 2021
- Physical Representation-Based Predicate Optimization for a Visual Analytics Database2019
- Probability Inequalities for sums of Bounded Random Variables1994