mlsanityData to 7 Oct 2026

Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation

arXiv 2510.09908 ↗First posted 10 Oct 2025stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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 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"older-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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 56 references that are in the map. First posted on arXiv 10 Oct 2025.

Builds on

20 of 56 references.

References · 20

  1. 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,528
  2. 2021Offline Reinforcement Learning as One Big Sequence Modeling Problemcited by 636
  3. 2023Prediction-Powered Inferencecited by 214
  4. 2023Supervised Pretraining Can Learn In-Context Reinforcement Learningcited by 137
  5. 2023Transformers as Decision Makers: Provable In-Context Reinforcement Learning via Supervised Pretrainingcited by 82
  6. 2019Personalized HeartSteps: A Reinforcement Learning Algorithm for Optimizing Physical Activitycited by 70
  7. 2024LOLA: LLM-Assisted Online Learning Algorithm for Content Experimentscited by 18
  8. 2017Contextual Linear Bandits under Noisy Features: Towards Bayesian Oraclescited by 8
  9. 2021Regret Lower Bound and Optimal Algorithm for High-Dimensional Contextual Linear Banditcited by 8
  10. 2024Replicable Bandits for Digital Health Interventionscited by 7
  11. 2024Thompson Sampling in Partially Observable Contextual Banditscited by 5
  12. 2024Partially Observable Contextual Bandits with Linear Payoffscited by 5
8 more
  1. 2025Contextual Thompson Sampling via Generation of Missing Datacited by 5
  2. 2025Statistical Inference for Misspecified Contextual Banditscited by 4
  3. 2020Online learning with Corrupted context: Corrupted Contextual Banditscited by 3
  4. 2025Linear Bandits with Partially Observable Featurescited by 3
  5. 2025Pre-Trained AI Model Assisted Online Decision-Making under Missing Covariates: A Theoretical Perspectivecited by 3
  6. 2022High dimensional stochastic linear contextual bandit with missing covariatescited by 2
  7. 2024Leveraging Offline Data in Linear Latent Contextual Banditscited by 2
  8. 2024HR-Bandit: Human-AI Collaborated Linear Recourse Banditcited by 2

Built on by

Not cited yet.