Weak aggregating specialist algorithm for online portfolio selection

被引:3
作者
He, Jin'an [1 ]
Yin, Shicheng [1 ]
Peng, Fangping [1 ]
机构
[1] Sun Yat Sen Univ, Sch Business, Guangzhou 510275, Peoples R China
基金
中国国家自然科学基金;
关键词
Specialized expert; Weak aggregating specialist algorithm; Online portfolio selection; Transaction costs; REVERSION STRATEGY; UNIVERSAL PORTFOLIOS; OPTIMIZATION;
D O I
10.1007/s10614-023-10411-5
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper proposes a novel online learning algorithm, named weak aggregating specialist algorithm (WASA), and presents its theoretical bound. This algorithm has a flexible feature, which is to allow abandoning some expert advice according to pre-set rules. Based on this algorithm, a new online portfolio strategy named weak aggregating specialized CRP (WASC) is designed, which only aggregates awake specialized expert advice. Firstly, a pool of special constant rebalanced portfoliosCRP(b) strategies is employed to construct the index set of specialized experts. Secondly, a distance function is exploited to measure the distance between the current adjusted portfolio and each specialized expert advice, and the index set of awake specialized experts is constructed. Finally, the portfolio is updated by aggregating all awake specialized expert advice. Furthermore, theoretical and experimental analyses are established to illustrate the performance of the proposed strategy WASC. Theoretical results guarantee that WASC performs as well as the best specialized expert. Experimental results show that WASC outperforms some existing strategies in terms of the return and risk metrics, which illustrates its effectiveness in various real financial markets.
引用
收藏
页码:2405 / 2434
页数:30
相关论文
共 44 条
  • [1] Agarwal A., 2006, P 23 INT C MACHINE L, P9
  • [2] On-line portfolio selection strategy with prediction in the presence of transaction costs
    Albeverio, S
    Lao, LJ
    Zhao, XL
    [J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2001, 54 (01) : 133 - 161
  • [3] Universal portfolios with and without transaction costs
    Blum, A
    Kalai, A
    [J]. MACHINE LEARNING, 1999, 35 (03) : 193 - 205
  • [4] Can we learn to beat the best stock
    Borodin, A
    El-Yaniv, R
    Gogan, V
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2004, 21 : 579 - 594
  • [5] Gaussian Weighting Reversion Strategy for Accurate Online Portfolio Selection
    Cai, Xia
    Ye, Zekun
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2019, 67 (21) : 5558 - 5570
  • [6] Cover T. M., 1991, MATH FINANC, V1, P1, DOI 10.1111/j.1467-9965.1991.tb00002.x
  • [7] Universal portfolios with side information
    Cover, TM
    Ordentlich, E
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) : 348 - 363
  • [8] Cover's universal portfolio, stochastic portfolio theory, and the numeraire portfolio
    Cuchiero, Christa
    Schachermayer, Walter
    Wong, Ting-Kam Leonard
    [J]. MATHEMATICAL FINANCE, 2019, 29 (03) : 773 - 803
  • [9] An online portfolio strategy based on trend promote price tracing ensemble learning algorithm
    Dai, Hong-Liang
    Liang, Chu-Xin
    Dai, Hong-Ming
    Huang, Cui-Yin
    Adnan, Rana Muhammad
    [J]. KNOWLEDGE-BASED SYSTEMS, 2022, 239
  • [10] Das P., 2011, METAOPTIMIZATION ITS