计算机科学
后悔
梯度下降
文件夹
稳健性(进化)
机器学习
人工智能
水准点(测量)
专家系统
数学优化
数据挖掘
算法
财务
人工神经网络
基因
生物化学
数学
经济
化学
大地测量学
地理
作者
Yong Zhang,Honghuang Lin,Xingguo Yang,Wanrong Long
标识
DOI:10.1016/j.knosys.2021.107533
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI