Combining expert weights for online portfolio selection based on the gradient descent algorithm

作者:

Highlights:

摘要

In this paper, we propose a new online portfolio selection strategy based on a weighted learning technique and an online gradient descent algorithm. Our strategy, named combination weights based on online gradient descent (CW-OGD), achieves improved robustness by integrating different expert strategies and overcomes the difficult problem of complex computational time. First, an expert system including many basic expert strategies, in which we choose the strategy that invests in a single stock as the basic expert strategy, is established. Second, we exploit the loss function to evaluate the performance of different basic expert strategies and use the OGD algorithm to update the weight vector for the experts based on their losses. In addition, we theoretically prove that the proposed strategy has a regret bound. Finally, extensive experiments conducted on four stock combinations and seven benchmark datasets show that our strategy can outperform some state-of-the-art strategies in terms of the return, risk and computational time metrics. Furthermore, our strategy can achieve higher returns even at certain transaction cost rates, which illustrates its effectiveness in the actual stock market.

论文关键词:Online portfolio selection,Gradient descent algorithm,Combining weights,Expert strategy

论文评审过程:Received 9 July 2020, Revised 20 September 2021, Accepted 22 September 2021, Available online 6 October 2021, Version of Record 21 October 2021.

论文官网地址:https://doi.org/10.1016/j.knosys.2021.107533