Cut Costs, Not Accuracy: LLM-Powered Data Processing with Guarantees
Summary: Targets LLM cascade cost-quality tradeoffs by provable selection of when to use cheaper LLMs for record processing, addressing weak quality estimation in prior confidence-based cascades. BARGAIN uses adaptive sampling and statistical estimation tuned to data/task to give tight theoretical guarantees (accuracy/precision/recall) and empirically reduces cost up to 86% vs. state-of-the-art. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sepanta Zeighami (University of California Berkeley)
- 2. Shreya Shankar (University of California Berkeley)
- 3. Aditya Parameswaran (University of California Berkeley)
BibTeX Citation
@inproceedings{zeighami_sigmod26,
title = {{Cut Costs, Not Accuracy: LLM-Powered Data Processing with Guarantees}},
author = {Zeighami, Sepanta and Shankar, Shreya and Parameswaran, Aditya},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769776},
url = {https://dl.acm.org/doi/10.1145/3769776},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,886 | Multi-Objective Agentic Rewrites for Unstructured Data Processing | 2026 | VLDB | 5.6551172e-05 |
| 10,415 | Automated Discovery of Test Oracles for Database Management Systems Using LLMs | 2026 | SIGMOD | 4.9793485e-05 |
| 10,498 | ScaleDoc: Scaling LLM-based Predicates over Large Document Collections | 2026 | SIGMOD | 4.9793485e-05 |
| 10,845 | Featurized-Decomposition Join: Low-Cost Semantic Joins with Guarantees | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 22 of 22 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,841 | Bolt-on, Verifiable Provenance for LLM-Powered Data Processing | 2026 | VLDB |
| 2 | 3,695 | Revisiting Prompt Engineering via Declarative Crowdsourcing | 2024 | CIDR |
| 3 | 11,061 | LLM-AutoDP: Automatic Data Processing via LLM Agents for Model Fine-tuning | 2026 | VLDB |
| 4 | 5,149 | LLM for Data Management | 2024 | VLDB |
| 5 | 10,765 | LLMs as Stratification Signals for KG Accuracy Evaluation | 2026 | VLDB |
| 6 | 11,161 | ScaleLLM: A Technique for Scalable LLM-augmented Data Systems | 2025 | SIGMOD |
| 7 | 6,860 | SpareLLM: Automatically Selecting Task-Specific Minimum-Cost Large Language Models under Equivalence Constraint | 2025 | SIGMOD |
| 8 | 10,690 | Task Cascades for Efficient Unstructured Data Processing | 2026 | SIGMOD |
| 9 | 8,888 | Optimized Batch Prompting for Cost-effective LLMs | 2025 | VLDB |
| 10 | 8,316 | ThriftLLM: On Cost-Effective Selection of Large Language Models for Classification Queries | 2025 | VLDB |