Doubly Regularized Portfolio with Risk Minimization

被引:0
作者
Shen, Weiwei [1 ]
Wang, Jun [2 ]
Ma, Shiqian [3 ]
机构
[1] Columbia Univ, Appl Phys & Appl Math, New York, NY 10027 USA
[2] IBM TJ Watson Res, Business Analyt & Math Sci, Yorktown Hts, NY USA
[3] Chinese Univ Hong Kong, Syst Engn & Engn Management, Hong Kong, Peoples R China
来源
PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2014年
关键词
SELECTION; SHRINKAGE; SPARSE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to recent empirical success, machine learning algorithms have drawn sufficient attention and are becoming important analysis tools in financial industry. In particular, as the core engine of many financial services such as private wealth and pension fund management, portfolio management calls for the application of those novel algorithms. Most of portfolio allocation strategies do not account for costs from market frictions such as transaction costs and capital gain taxes, as the complexity of sensible cost models often causes the induced problem intractable. In this paper, we propose a doubly regularized portfolio that provides a modest but effective solution to the above difficulty. Specifically, as all kinds of trading costs primarily root in large transaction volumes, to reduce volumes we synergistically combine two penalty terms with classic risk minimization models to ensure: (1) only a small set of assets are selected to invest in each period; (2) portfolios in consecutive trading periods are similar. To assess the new portfolio, we apply standard evaluation criteria and conduct extensive experiments on well-known benchmarks and market datasets. Compared with various state-of-the-art portfolios, the proposed portfolio demonstrates a superior performance of having both higher risk-adjusted returns and dramatically decreased transaction volumes.
引用
收藏
页码:1286 / 1292
页数:7
相关论文
共 35 条
  • [1] Agarwal A., 2006, P INT C MACH LEARN, P9, DOI DOI 10.1145/1143844.1143846
  • [2] [Anonymous], J AM STAT ASS
  • [3] Bach F, 2012, OPTIMIZATION FOR MACHINE LEARNING, P19
  • [4] A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
    Beck, Amir
    Teboulle, Marc
    [J]. SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01): : 183 - 202
  • [5] Templates for convex cone problems with applications to sparse signal recovery
    Becker S.R.
    Candès E.J.
    Grant M.C.
    [J]. Mathematical Programming Computation, 2011, 3 (3) : 165 - 218
  • [6] Universal portfolios with and without transaction costs
    Blum, A
    Kalai, A
    [J]. MACHINE LEARNING, 1999, 35 (03) : 193 - 205
  • [7] 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
  • [8] Distributed optimization and statistical learning via the alternating direction method of multipliers
    Boyd S.
    Parikh N.
    Chu E.
    Peleato B.
    Eckstein J.
    [J]. Foundations and Trends in Machine Learning, 2010, 3 (01): : 1 - 122
  • [9] Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
  • [10] Brandt MW, 2010, HANDB FINANC, P269, DOI 10.1016/B978-0-444-50897-3.50008-0