pith. sign in

arxiv: 2603.17212 · v2 · pith:UVYUEOLKnew · submitted 2026-03-17 · 💻 cs.GT · cs.AI· cs.LG

Adaptive Contracts for Cost-Effective AI Delegation

classification 💻 cs.GT cs.AIcs.LG
keywords contractsadaptiveevaluationbenefitswhendelegationadaptivityalgorithms
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Regret Minimization in Single-Dimensional Contract-Design with Binary Actions

    cs.GT 2026-06 unverdicted novelty 7.0

    Derives tight Θ(T^{2/3}) regret independent of outcome count m for adversarial agent types and Õ(√T) regret via explore-then-commit for fixed hidden type in single-dimensional binary-action contract design.