Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning
<|reference_start|>Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning: In this paper, we study multi-task structured bandit problem where the goal is to learn a near-optimal algorithm that minimizes cumulative regret. The tasks share a common structure and the algorithm exploits the shared structure to minimize the cumulative regret for an unseen but related test task. We use a transformer as a decision-making algorithm to learn this shared structure so as to generalize to the test task. The prior work of pretrained decision transformers like DPT requires access to the optimal action during training which may be hard in several scenarios. Diverging from these works, our learning algorithm does not need the knowledge of optimal action per task during training but predicts a reward vector for each of the actions using only the observed offline data from the diverse training tasks. Finally, during inference time, it selects action using the reward predictions employing various exploration strategies in-context for an unseen test task. Our model outperforms other SOTA methods like DPT, and Algorithmic Distillation over a series of experiments on several structured bandit problems (linear, bilinear, latent, non-linear). Interestingly, we show that our algorithm, without the knowledge of the underlying problem structure, can learn a near-optimal policy in-context by leveraging the shared structure across diverse tasks. We further extend the field of pre-trained decision transformers by showing that they can leverage unseen tasks with new actions and still learn the underlying latent structure to derive a near-optimal policy. We validate this over several experiments to show that our proposed solution is very general and has wide applications to potentially emergent online and offline strategies at test time. Finally, we theoretically analyze the performance of our algorithm and obtain generalization bounds in the in-context multi-task learning setting.<|reference_end|>
@article{mukherjee2024pretraining,
    title={Pretraining Decision Transformers with Reward Prediction for In-Context
  Multi-task Structured Bandit Learning},
    author={Subhojyoti Mukherjee, Josiah P. Hanna, Qiaomin Xie, Robert Nowak},
    journal={arXiv preprint arXiv:2406.05064},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.05064},
    primaryClass={cs.LG}
}