aiqbench analysis
This research introduces the Audited Surrogate Bandit (ASB), a novel algorithm for contextual bandits that optimizes expensive primary-outcome acquisitions by balancing decision relevance with residual uncertainty after observing cheaper surrogate data. The study demonstrates theoretically and empirically that leveraging post-action surrogates significantly reduces regret compared to methods relying solely on initial relevance or uncertainty, particularly in high-budget scenarios like user-video interaction benchmarks.
The Surrogate Is Not the Reward: Post-Surrogate Primary-Outcome Acquisition in Contextual Bandits
arXiv:2610.06610v1 Announce Type: cross Abstract: We study contextual bandits in which a surrogate is observed after the action but before the learner decides whether to acquire the primary outcome that defines action value and regret. The value of acquiring the primary outcome depends on both decision relevance (how much the current outcome matters for comparing policies) and the residual uncertainty after observing the surrogate. The Audited Surrogate Bandit (ASB) learns a contextual policy while allocating a budget of $B$ primary-outcome acquisitions over $T$ rounds. ASB sets a pre-surrogate acquisition level from current decision relevance and, after observing the surrogate, redistributes that level using an estimate of that residual uncertainty. For a finite class of $N$ policies over $K$ actions, ASB incurs $\widetilde O[\sqrt{KT\log N}\{1+\sqrt{T/B}\}]$ regret relative to the best policy in the class. In a two-action family where the surrogate does not reveal the better action, a learner that observes the surrogate before deciding whether to acquire can achieve bounded regret, whereas any learner that must decide before seeing the surrogate incurs $\Omega(T/B)$ worst-case regret under the same budget. Synthetic experiments show that both acquisition factors matter: ASB has lower regret than variants using only decision relevance or only residual uncertainty. On a KuaiRec benchmark of user-video interactions, the regret gap relative to relevance-only acquisition widens and then narrows as the budget grows.
Abstract:We study contextual bandits in which a surrogate is observed after the action but before the learner decides whether to acquire the primary outcome that defines action value and regret. The value of acquiring the primary outcome depends on both decision relevance (how much the current outcome matters for comparing policies) and the residual uncertainty after observing the surrogate. The Audited Surrogate Bandit (ASB) learns a contextual policy while allocating a budget of $B$ primary-outcome acquisitions over $T$ rounds. ASB sets a pre-surrogate acquisition level from current decision relevance and, after observing the surrogate, redistributes that level using an estimate of that residual uncertainty. For a finite class of $N$ policies over $K$ actions, ASB incurs $\widetilde O[\sqrt{KT\log N}\{1+\sqrt{T/B}\}]$ regret relative to the best policy in the class. In a two-action family where the surrogate does not reveal the better action, a learner that observes the surrogate before deciding whether to acquire can achieve bounded regret, whereas any learner that must decide before seeing the surrogate incurs $\Omega(T/B)$ worst-case regret under the same budget. Synthetic experiments show that both acquisition factors matter: ASB has lower regret than variants using only decision relevance or only residual uncertainty. On a KuaiRec benchmark of user-video interactions, the regret gap relative to relevance-only acquisition widens and then narrows as the budget grows.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2610.06610 [stat.ML]
(or arXiv:2610.06610v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2610.06610 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
code/algorithm/__init__.py
code/algorithm/acquisition.py
code/algorithm/learner.py
code/algorithm/pacing.py
code/experiments/kuairec.py
code/experiments/synthetic.py
code/models/kuairec.py
code/models/synthetic.py
code/requirements.txt
code/run_experiments.py
code/setup_env.sh
code/utils/plotting.py
code/utils/results.py
code/utils/stats.py
(11 additional files not shown) You must enabled JavaScript to view entire file list.
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 343 words
Related coverage

Hint-based CoT faithfulness evals still mostly work on Claude
LessWrong · Jul 30, 2026

[AINews] Meta Muse Wonder & Wonder Full: MSL’s Claude 5.5-tier Frontier Model
Latent Space · Oct 13, 2026

[AINews] not much happened today
Latent Space · Sep 10, 2026

Uplifting conversion across the acquisition funnel with personalization using contextual bandits on AWS
AWS · Oct 1, 2026