Risk-Aware Multi-Armed Bandit Problem with Application to Portfolio Selection
Abstract
Sequential portfolio selection has attracted increasing interests in the machine learning and quantitative finance communities in recent years. As a mathematical framework for reinforcement learning policies, the stochastic multi-armed bandit problem addresses the primary difficulty in sequential decision making under uncertainty, namely the exploration versus exploitation dilemma, and therefore provides a natural connection to portfolio selection. In this paper, we incorporate risk-awareness into the classic multi-armed bandit setting and introduce an algorithm to construct portfolio. Through filtering assets based on the topological structure of financial market and combining the optimal multi-armed bandit policy with the minimization of a coherent risk measure, we achieve a balance between risk and return.
Keywords
Cite
@article{arxiv.1709.04415,
title = {Risk-Aware Multi-Armed Bandit Problem with Application to Portfolio Selection},
author = {Xiaoguang Huo and Feng Fu},
journal= {arXiv preprint arXiv:1709.04415},
year = {2017}
}
Comments
15 pages, 2 figures. This is one of the student project papers arsing from the Mathematics REU program at Dartmouth 2017 Summer. See https://math.dartmouth.edu/~reu/ for more info. Comments are always welcome