We present a novel online ensemble learning strategy for portfolio selection. The new strategy controls and exploits any set of commission-oblivious portfolio selection algorithms. The strategy handles transaction costs using a novel commission avoidance mechanism. We p... View more
[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 23rd International Conference on Machine Learning, pages 9-16. ACM, 2006.
[Algoet and Cover, 1988] P.H. Algoet and T.M. Cover. Asymptotic optimality and asymptotic equipartition properties of log-optimum investment. The Annals of Probability, pages 876-898, 1988.
[Beck and Teboulle, 2003] A. Beck and M. Teboulle. Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3):167-175, 2003.
[Blum and Kalai, 1999] A. Blum and A. Kalai. Universal portfolios with and without transaction costs. Machine Learning, 35(3):193-205, 1999.
[Borodin and El-Yaniv, 2005] A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 2005.
[Borodin et al., 2004] A. Borodin, R. El-Yaniv, and V. Gogan. Can we learn to beat the best stock? Journal of Artificial Intelligence Research, pages 579-594, 2004.
[Cesa-Bianchi and Lugosi, 2006] N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
[Cover and Ordentlich, 1996] T.M. Cover and E. Ordentlich. Universal portfolios with side information. IEEE Transactions on Information Theory, 42(2):348-363, 1996.