Metraipolis › archive › dc_57fe7cdf1dbf
Budgeted Multi-Source Counterfactual Annotation for Off-Policy Evaluation — arXiv:2610.10974
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10974
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T05:56:16.187Z
- SHA-256 of the archived text
ddf58f093b9a25f5876dddd8b8c6ad749a58e54d2009e19d8243894085b504f5- Stable URL of this page
https://metraipolis.com/documento/dc_57fe7cdf1dbf
How to cite
Budgeted Multi-Source Counterfactual Annotation for Off-Policy Evaluation — arXiv:2610.10974 — arXiv (en), https://arxiv.org/abs/2610.10974 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_57fe7cdf1dbf (Metraipolis archive dc_57fe7cdf1dbf, sha256 ddf58f093b9a25f5876dddd8b8c6ad749a58e54d2009e19d8243894085b504f5)
BibTeX
@misc{dc57fe7cdf1dbf,
title = {Budgeted Multi-Source Counterfactual Annotation for Off-Policy Evaluation — arXiv:2610.10974},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10974},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_57fe7cdf1dbf; sha256 ddf58f093b9a25f5876dddd8b8c6ad749a58e54d2009e19d8243894085b504f5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10974. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Off-policy evaluation (OPE) estimates the value of a target policy from logged data, but limited behavior-policy coverage can force high-variance reweighting or reward-model extrapolation. Counterfactual annotations can add evidence about unobserved actions, yet practical sources, including domain experts and large language models (LLMs), may be costly, biased, or noisy. We study budgeted acquisition of such annotations for contextual-bandit OPE. Given source-specific costs and error profiles, we formulate an integer allocation problem over context-action pairs and annotation sources to minimize the component of estimator variance that depends on the annotation plan. We characterize when annotations are valuable through a first-annotation threshold and local annotation-value regimes. For the coupled multi-source problem, we develop a majorization-minimization algorithm with dynamic-programming subroutines that monotonically improves the objective. Experiments in synthetic clinical and LLM-annotated education bandits show that our allocation method reduces fixed-profile mean squared error (MSE) by 20.58% and 10.77%, respectively, relative to no annotation. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.10974 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:47:01.413Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).