Wealth Flow Model: Online Portfolio Selection Based on Learning Wealth Flow Matrices

被引:5
作者
Yin, Jianfei [1 ,2 ]
Wang, Ruili [3 ]
Guo, Yeqing [4 ]
Bai, Yizhe [5 ]
Ju, Shunda [5 ]
Liu, Weili [5 ]
Huang, Joshua Zhexue [5 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[2] Shenzhen Univ, Natl Engn Lab Big Data Syst Comp Technol, Shenzhen 518060, Peoples R China
[3] Massey Univ, Sch Nat & Computat Sci, Auckland 102904, New Zealand
[4] Tisson Regaltc Commun Technol, Guangzhou 510623, Peoples R China
[5] Shenzhen Univ, Shenzhen 518060, Peoples R China
基金
中国国家自然科学基金;
关键词
Online portfolio selection; wealth flow matrix; deep reinforcement learning regret bound; UNIVERSAL PORTFOLIOS; LATENT STRUCTURE; OPTIMIZATION; STRATEGIES; REVERSION;
D O I
10.1145/3464308
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article proposes a deep learning solution to the online portfolio selection problem based on learning a latent structure directly from a price time series. It introduces a novel wealth flow matrix for representing a latent structure that has special regular conditions to encode the knowledge about the relative strengths of assets in portfolios. Therefore, a wealth flow model (WFM) is proposed to learn wealth flow matrices and maximize portfolio wealth simultaneously. Compared with existing approaches, our work has several distinctive benefits: (1) the learning of wealth flow matrices makes our model more generalizable than models that only predict wealth proportion vectors, and (2) the exploitation of wealth flow matrices and the exploration of wealth growth are integrated into our deep reinforcement algorithm for the WFM. These benefits, in combination, lead to a highly-effective approach for generating reasonable investment behavior, including short-term trend following, the following of a few losers, no self-investment, and sparse portfolios. Extensive experiments on five benchmark datasets from real-world stock markets confirm the theoretical advantage of the WFM, which achieves the Pareto improvements in terms of multiple performance indicators and the steady growth of wealth over the state-of-the-art algorithms.
引用
收藏
页数:27
相关论文
共 67 条
  • [41] Learning to Trade with Deep Actor Critic Methods
    Li, Jinke
    Rao, Ruonan
    Shi, Jun
    [J]. 2018 11TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 2, 2018, : 66 - 71
  • [42] Li SH, 2019, AAAI CONF ARTIF INTE, P4213
  • [43] Approximating the Pareto optimal set using a reduced set of objective functions
    Lindroth, Peter
    Patriksson, Michael
    Stromberg, Ann-Brith
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 207 (03) : 1519 - 1534
  • [44] Deep learning-based feature engineering for stock price movement prediction
    Long, Wen
    Lu, Zhichen
    Cui, Lingxiao
    [J]. KNOWLEDGE-BASED SYSTEMS, 2019, 164 : 163 - 173
  • [45] Luo Haipeng, 2018, Advances in Neural Information Processing Systems
  • [46] Public Mood-Driven Asset Allocation: the Importance of Financial Sentiment in Portfolio Management
    Malandri, Lorenzo
    Xing, Frank Z.
    Orsenigo, Carlotta
    Vercellis, Carlo
    Cambria, Erik
    [J]. COGNITIVE COMPUTATION, 2018, 10 (06) : 1167 - 1176
  • [47] Human-level control through deep reinforcement learning
    Mnih, Volodymyr
    Kavukcuoglu, Koray
    Silver, David
    Rusu, Andrei A.
    Veness, Joel
    Bellemare, Marc G.
    Graves, Alex
    Riedmiller, Martin
    Fidjeland, Andreas K.
    Ostrovski, Georg
    Petersen, Stig
    Beattie, Charles
    Sadik, Amir
    Antonoglou, Ioannis
    King, Helen
    Kumaran, Dharshan
    Wierstra, Daan
    Legg, Shane
    Hassabis, Demis
    [J]. NATURE, 2015, 518 (7540) : 529 - 533
  • [48] Risk management strategies for finding universal portfolios
    Mohr, Esther
    Dochow, Robert
    [J]. ANNALS OF OPERATIONS RESEARCH, 2017, 256 (01) : 129 - 147
  • [49] Handcrafted vs. non-handcrafted features for computer vision classification
    Nanni, Loris
    Ghidoni, Stefano
    Brahnam, Sheryl
    [J]. PATTERN RECOGNITION, 2017, 71 : 158 - 172
  • [50] A generalized online mirror descent with applications to classification and regression
    Orabona, Francesco
    Crammer, Koby
    Cesa-Bianchi, Nicolo
    [J]. MACHINE LEARNING, 2015, 99 (03) : 411 - 435