Transaction cost optimization for online portfolio selection

被引:56
作者
Li, Bin [1 ]
Wang, Jialei [2 ]
Huang, Dingjiang [3 ]
Hoi, Steven C. H. [4 ]
机构
[1] Wuhan Univ, Econ & Management Sch, Dept Finance, Wuhan, Hubei, Peoples R China
[2] Univ Chicago, Dept Comp Sci, Chicago, IL 60637 USA
[3] East China Normal Univ, Sch Data Sci & Engn, Shanghai, Peoples R China
[4] Singapore Management Univ, Sch Informat Syst, Singapore, Singapore
基金
中国国家自然科学基金; 上海市自然科学基金;
关键词
Portfolio optimization; Transaction costs; Learning in financial models; Investment strategy; NAIVE DIVERSIFICATION; ALGORITHMS; INFORMATION; ACCRUALS; STRATEGY; RETURNS;
D O I
10.1080/14697688.2017.1357831
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
To improve existing online portfolio selection strategies in the case of non-zero transaction costs, we propose a novel framework named Transaction Cost Optimization (TCO). The TCO framework incorporates the L1 norm of the difference between two consecutive allocations together with the principle of maximizing expected log return. We further solve the formulation via convex optimization, and obtain two closed-form portfolio update formulas, which follow the same principle as Proportional Portfolio Rebalancing (PPR) in industry. We empirically evaluate the proposed framework using four commonly used data-sets. Although these data-sets do not consider delisted firms and are thus subject to survival bias, empirical evaluations show that the proposed TCO framework may effectively handle reasonable transaction costs and improve existing strategies in the case of non-zero transaction costs.
引用
收藏
页码:1411 / 1424
页数:14
相关论文
共 49 条
[1]  
Agarwal A, 2006, P INT C MACH LEARN P
[2]   On-line portfolio selection strategy with prediction in the presence of transaction costs [J].
Albeverio, S ;
Lao, LJ ;
Zhao, XL .
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2001, 54 (01) :133-161
[3]  
[Anonymous], 2000, Active Portfolio Management
[4]  
[Anonymous], FOUND TRENDS MACH LE
[5]  
[Anonymous], 2002, J MACH LEARN RES
[6]  
[Anonymous], 2008, P INT C MACH LEARN
[7]   Optimization with Sparsity-Inducing Penalties [J].
Bach, Francis ;
Jenatton, Rodolphe ;
Mairal, Julien ;
Obozinski, Guillaume .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 4 (01) :1-106
[8]   An empirical comparison of voting classification algorithms: Bagging, boosting, and variants [J].
Bauer, E ;
Kohavi, R .
MACHINE LEARNING, 1999, 36 (1-2) :105-139
[9]   Delisting returns and their effect on accounting-based market anomalies [J].
Beaver, William ;
McNichols, Maureen ;
Price, Richard .
JOURNAL OF ACCOUNTING & ECONOMICS, 2007, 43 (2-3) :341-368
[10]  
Bodie Z., 2014, INVESTMENTS 10E