Risk-Aware Linear Bandits with Application in Smart Order Routing

Abstract

Motivated by practical considerations in machine learning for financial decision-making, such as risk-aversion and large action space, we initiate the study of risk-aware linear bandits. Specifically, we consider regret minimization under the mean-variance measure when facing a set of actions whose reward can be expressed as linear functions of (initially) unknown parameters. We first propose the Risk-Aware Explore-then-Commit (RISE) algorithm driven by the variance-minimizing G-optimal design. Then, we rigorously analyze its regret upper bound to show that, by leveraging the linear structure, the algorithm can dramatically reduce the regret when compared to existing methods. Finally, we demonstrate the performance of the RISE algorithm by conducting extensive numerical experiments in a synthetic smart order routing setup. Our results show that the RISE algorithm can outperform the competing methods, especially when the decision-making scenario becomes more complex.