Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation

Hao Yan, Heyan Zhang, Yongyi Guo
Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, PMLR 300:1630-1638, 2026.

Abstract

The rise of large-scale pretrained models has made it feasible to generate predictive or synthetic features at low cost, raising the question of how to incorporate such surrogate predictions into downstream decision-making. We study this problem in the setting of online linear contextual bandits, where contexts may be complex, nonstationary, and only partially observed. In addition to bandit data, we assume access to an auxiliary historical dataset containing fully observed contexts–common in practice since such data are collected without adaptive interventions. We propose PULSE-UCB, an algorithm that leverages pretrained models trained on the auxiliary data to impute missing features during online decision-making. We establish regret guarantees that decompose into a standard bandit term plus an additional component reflecting pretrained model quality. In the i.i.d. context case with H{ö}lder-smooth missing features, PULSE-UCB achieves near-optimal performance, supported by matching lower bounds. Our results quantify how uncertainty in predicted contexts affects decision quality and how much historical data is needed to improve downstream learning.

Cite this Paper


BibTeX
@InProceedings{pmlr-v300-yan26a, title = { Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation }, author = {Yan, Hao and Zhang, Heyan and Guo, Yongyi}, booktitle = {Proceedings of The 29th International Conference on Artificial Intelligence and Statistics}, pages = {1630--1638}, year = {2026}, editor = {Khan, Emtiyaz and Li, Yingzhen and Solin, Arno and Ramdas, Aaditya}, volume = {300}, series = {Proceedings of Machine Learning Research}, month = {02--05 May}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v300/main/assets/yan26a/yan26a.pdf}, url = {https://proceedings.mlr.press/v300/yan26a.html}, abstract = { The rise of large-scale pretrained models has made it feasible to generate predictive or synthetic features at low cost, raising the question of how to incorporate such surrogate predictions into downstream decision-making. We study this problem in the setting of online linear contextual bandits, where contexts may be complex, nonstationary, and only partially observed. In addition to bandit data, we assume access to an auxiliary historical dataset containing fully observed contexts–common in practice since such data are collected without adaptive interventions. We propose PULSE-UCB, an algorithm that leverages pretrained models trained on the auxiliary data to impute missing features during online decision-making. We establish regret guarantees that decompose into a standard bandit term plus an additional component reflecting pretrained model quality. In the i.i.d. context case with H{ö}lder-smooth missing features, PULSE-UCB achieves near-optimal performance, supported by matching lower bounds. Our results quantify how uncertainty in predicted contexts affects decision quality and how much historical data is needed to improve downstream learning. } }
Endnote
%0 Conference Paper %T Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation %A Hao Yan %A Heyan Zhang %A Yongyi Guo %B Proceedings of The 29th International Conference on Artificial Intelligence and Statistics %C Proceedings of Machine Learning Research %D 2026 %E Emtiyaz Khan %E Yingzhen Li %E Arno Solin %E Aaditya Ramdas %F pmlr-v300-yan26a %I PMLR %P 1630--1638 %U https://proceedings.mlr.press/v300/yan26a.html %V 300 %X The rise of large-scale pretrained models has made it feasible to generate predictive or synthetic features at low cost, raising the question of how to incorporate such surrogate predictions into downstream decision-making. We study this problem in the setting of online linear contextual bandits, where contexts may be complex, nonstationary, and only partially observed. In addition to bandit data, we assume access to an auxiliary historical dataset containing fully observed contexts–common in practice since such data are collected without adaptive interventions. We propose PULSE-UCB, an algorithm that leverages pretrained models trained on the auxiliary data to impute missing features during online decision-making. We establish regret guarantees that decompose into a standard bandit term plus an additional component reflecting pretrained model quality. In the i.i.d. context case with H{ö}lder-smooth missing features, PULSE-UCB achieves near-optimal performance, supported by matching lower bounds. Our results quantify how uncertainty in predicted contexts affects decision quality and how much historical data is needed to improve downstream learning.
APA
Yan, H., Zhang, H. & Guo, Y.. (2026). Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation . Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, in Proceedings of Machine Learning Research 300:1630-1638 Available from https://proceedings.mlr.press/v300/yan26a.html.

Related Material