Neural Networks for Portfolio Analysis With Cardinality Constraints

被引:10
作者
Cao, Xinwei [1 ]
Li, Shuai [2 ,3 ]
机构
[1] Jiangnan Univ, Sch Business, Wuxi 214122, Jiangsu, Peoples R China
[2] Univ Oulu, Fac Informat Technol & Elect Engn, Oulu 90570, Finland
[3] VTT Tech Res Ctr Finland, Oulu 90590, Finland
关键词
Cardinality constraint; neural dynamics; neural networks; nonconvex optimization; portfolio analysis; TRADING STRATEGY; SELECTION; MANAGEMENT; MODEL;
D O I
10.1109/TNNLS.2023.3307192
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Portfolio analysis is a crucial subject within modern finance. However, the classical Markowitz model, which was awarded the Nobel Prize in Economics in 1991, faces new challenges in contemporary financial environments. Specifically, it fails to consider transaction costs and cardinality constraints, which have become increasingly critical factors, particularly in the era of high-frequency trading. To address these limitations, this research is motivated by the successful application of machine learning tools in various engineering disciplines. In this work, three novel dynamic neural networks are proposed to tackle nonconvex portfolio optimization under the presence of transaction costs and cardinality constraints. The neural dynamics are intentionally designed to exploit the structural characteristics of the problem, and the proposed models are rigorously proven to achieve global convergence. To validate their effectiveness, experimental analysis is conducted using real stock market data of companies listed in the Dow Jones Index (DJI), covering the period from November 8, 2021 to November 8, 2022, encompassing an entire year. The results demonstrate the efficacy of the proposed methods. Notably, the proposed model achieves a substantial reduction in costs (which combines investment risk and reward) by as much as 56.71% compared with portfolios that are averagely selected.
引用
收藏
页码:17674 / 17687
页数:14
相关论文
共 59 条
[1]  
Adamu J.A., 2019, Risk and Financial Management, V1, P8
[2]  
Allen F, 2021, Review of Corporate Finance, V1, P259, DOI [10.1561/114.00000007, 10.1561/114.00000007, DOI 10.1561/114.00000007, 10.21799/frbp.wp.2020.21, DOI 10.21799/FRBP.WP.2020.21]
[3]  
Bulukazari S., 2021, J. Water Res. Agricult., V35, P123
[4]   Heuristics for cardinality constrained portfolio optimisation [J].
Chang, TJ ;
Meade, N ;
Beasley, JE ;
Sharaiha, YM .
COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (13) :1271-1302
[5]   An Effective Approach for Obtaining a Group Trading Strategy Portfolio Using Grouping Genetic Algorithm [J].
Chen, Chun-Hao ;
Chen, Yu-Hsuan ;
Lin, Jerry Chun-Wei ;
Wu, Mu-En .
IEEE ACCESS, 2019, 7 :7313-7325
[6]   A recurrent neural network applied to optimal motion control of mobile robots with physical constraints [J].
Chen, Dechao ;
Li, Shuai ;
Liao, Liefa .
APPLIED SOFT COMPUTING, 2019, 85
[7]   New Super-Twisting Zeroing Neural-Dynamics Model for Tracking Control of Parallel Robots: A Finite-Time and Robust Solution [J].
Chen, Dechao ;
Li, Shuai ;
Lin, Faa-Jeng ;
Wu, Qing .
IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (06) :2651-2660
[8]   Temporal Attention-Augmented Bilinear Network for Financial Time-Series Data Analysis [J].
Dat Thanh Tran ;
Iosifidis, Alexandros ;
Kanniainen, Juho ;
Gabbouj, Moncef .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2019, 30 (05) :1407-1418
[9]   PORTFOLIO SELECTION WITH TRANSACTION COSTS [J].
DAVIS, MHA ;
NORMAN, AR .
MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (04) :676-713
[10]  
Dixon M.F., 2020, Machine Learning in Finance, V1170