Adaptive Contracts for Cost-Effective AI Delegation
Eden Saig, Tamar Garbuz, Ariel Procaccia, Inbal Talgam-Cohen, Jamie Tucker-Foltz
Abstract
When organizations delegate text generation tasks to AI providers via pay-for-performance contracts, expected payments rise when evaluation is noisy. As evaluation methods become more elaborate, the economic benefits of decreased noise are often overshadowed by increased evaluation costs. In this work, we introduce adaptive contracts for AI delegation, which allow detailed evaluation to be performed selectively after observing an initial coarse signal in order to conserve resources. We make three sets of contributions: First, we provide efficient algorithms for computing optimal adaptive contracts under natural assumptions or when core problem dimensions are small, and prove hardness of approximation in the general unstructured case. We then formulate alternative models of randomized adaptive contracts and discuss their benefits and limitations. Finally, we empirically demonstrate the benefits of adaptivity over non-adaptive baselines using question-answering and code-generation datasets.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on6
- SWE-bench: Can Language Models Resolve Real-world Github Issues?Carlos E. Jimenez, John Yang, Alexander Wettig, Shunyu Yao et al.ICLR 2024 · 2,082 citations
- LLM-as-a-Prophet: Understanding Predictive Intelligence with Prophet ArenaQingchuan Yang, Simon Mahns, Sida Li, Anri Gu et al.ICLR 2026 · 36 citations
- Incentivizing Quality Text Generation via Statistical ContractsEden Saig, Ohad Einav, Inbal Talgam-CohenNeurIPS 2024 · 18 citations
- Is Your LLM Overcharging You? Tokenization, Transparency, and IncentivesAnder Artola Velasco, Stratis Tsirtsis, Nastaran Okati, Manuel Gomez-RodriguezICML 2026 · 16 citations
- Contract Design Beyond Hidden-ActionsTomer Ezra, Stefano Leonardi, Matteo RussoSODA 2026 · 4 citations
Related papers
- Learning How Hard to Think: Input-Adaptive Allocation of LM ComputationMehul Damani, Idan Shenfeld, Andi Peng, Andreea Bobu et al.ICLR 2025
- Combinatorial ContractsPaul Dütting, Tomer Ezra, Michal Feldman, Thomas KesselheimFOCS 2021 · 18 citations
- Scaling Small Agents Through Strategy AuctionsLisa Alazraki, Shen, Yoram Bachrach, Akhil MathurICML 2026 · 2 citations
- Strategic Scaling of Test-Time Compute: A Bandit Learning ApproachBowen Zuo, Yinglun ZhuICLR 2026 · 9 citations
- Confident Adaptive Language ModelingTal Schuster, Adam Fisch, Jai Gupta, Mostafa Dehghani et al.NeurIPS 2022 · 394 citations
