Proceedings

Robust Median Reversion Strategy for On-Line Portfolio Selection

Download BibTeX Cite

Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 2006-2011.

© 2013 International Joint Conferences on Artificial Intelligence

Abstract

On-line portfolio selection has been attracting increasing interests from artificial intelligence community in recent decades. Mean reversion, as one most frequent pattern in financial markets, plays an important role in some state-of-the-art strategies. Though successful in certain datasets, existing mean reversion strategies do not fully consider noises and outliers in the data, leading to estimation error and thus non-optimal portfolios, which results in poor performance in practice. To overcome the limitation, we propose to exploit the reversion phenomenon by robust $L_1$-median estimator, and design a novel on-line portfolio selection strategy named Robust Median Reversion (RMR), which makes optimal portfolios based on the improved reversion estimation. Empirical results on various real markets show that RMR can overcome the drawbacks of existing mean reversion algorithms and achieve significantly better results. Finally, RMR runs in linear time, and thus is suitable for large-scale trading applications.

  1. [Agarwal et al., 2006] A. Agarwal, E. Hazan, S. kale, and R.E. Schapire. Algorithms for portfolio management based on the newton method. In Proceedings of the International Conference on Machine Learning (ICML 2006), pages 9-16, 2006.
  2. [Aldridge, 2010] Irene Aldridge. High-Frequency Trading: A Practical Guide to Algorithmic Strategies and Trading Systems. Hoboken, NJ : Wiley, Hoboken, N.J., 2010.
  3. [Borodin et al., 2004] A. Borodin, R. El-Yaniv, and V. Gogan. Can we learn to beat the best stock. JAIR, 21:579-594, 2004.
  4. [Boyd and Vandenberghe, 2004] S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, New York, 2004.
  5. [Cover and Thomas, 1991] Thomas M. Cover and Joy A. Thomas. Elements of information theory. New York : Wiley, New York, 1991.
  6. T.M. Cover. Universal portfolios. Mathematical Fi- nance, 1:1-29, 1991.
  7. [Duchi et al., 2008] J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra. Efficient projections onto the l 1-ball for learning in high dimensions. In Proceedings of the International Conference on Machine Learning (ICML 2008), 2008.
  8. [Gaivoronski and Stella, 2000] Alexei A. Gaivoronski and Fabio Stella. Stochastic nonstationary optimization for finding uni- versal portfolios. Annals of Operations Research, 100:165-188, 2000.
  9. [Grammer et al., 2006] K. Grammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer. Online passive-aggressive algorithms. JMLR, 7:551-585, 2006.
  10. [Grinold and Kahn, 1999] R. Grinold and R. Kahn. Active Portfolio Management: A Quantitative Approach for Producing Superior Returns and Controlling Risk. McGraw-Hill, New York, 1999.
  11. [Markowitz, 1952] H. Markowitz. Mean-variance analysis in port- folio choice and capital markets. J. Finance, 7(1):77-91, 1952.
  12. [Merton, 1980] R. C. Merton. On estimating the expected return on a market: An exploratory investigation. J. Financial Econ., 8:323-361, 1980.
  13. E. Ordentlich and T.M. Cover. On- line portfolio selection. In COLT, pages 310-313, 1996.
  14. [Thorp, 1971] E. O. Thorp. Portfolio choice and the kelly criterion. In Business and Economics Section of the American Statistical Association, 1971.
  15. [Vardi and Zhang, 2000] Yehuda Vardi and Cun Hui Zhang. The multivariate l1-median and associated data depth. PNAS, 97(4):1423-1426, 2000.
  16. [Weber, 1909] A. Weber. Uber den Standort der Industrien. Tub- ingen : Mohr, 1909.
  17. [Weiszfeld, 1937] E. Weiszfeld. Sur le point pour lequel la somme des distances de n points donnes est minimum. Tohoku Mathe- matical Journal, 43:355-386, 1937.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards