nips nips2009 nips2009-178 nips2009-178-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Elad Hazan, Satyen Kale
Abstract: In practice, most investing is done assuming a probabilistic model of stock price returns known as the Geometric Brownian Motion (GBM). While often an acceptable approximation, the GBM model is not always valid empirically. This motivates a worst-case approach to investing, called universal portfolio management, where the objective is to maximize wealth relative to the wealth earned by the best fixed portfolio in hindsight. In this paper we tie the two approaches, and design an investment strategy which is universal in the worst-case, and yet capable of exploiting the mostly valid GBM model. Our method is based on new and improved regret bounds for online convex optimization with exp-concave loss functions. 1
[AHKS06] Amit Agarwal, Elad Hazan, Satyen Kale, and Robert E. Schapire. Algorithms for portfolio management based on the newton method. In ICML, pages 9–16, 2006. ´ [Bac00] L. Bachelier. Th´ orie de la sp´ culation. Annales Scientifiques de l’Ecole Normale e e Sup´ rieure, 3(17):21–86, 1900. e [BK97] Avrim Blum and Adam Kalai. Universal portfolios with and without transaction costs. In COLT, pages 309–313, New York, NY, USA, 1997. ACM. [BS73] Fischer Black and Myron Scholes. The pricing of options and corporate liabilities. Journal of Political Economy, 81(3):637–654, 1973. [BV04] Stephen Boyd and Lieven Vandenberghe. Convex Optimization. Cambridge University Press, New York, NY, USA, 2004. [CB03] Jason E Cross and Andrew R Barron. Efficient universal portfolios for past dependent target classes. Mathematical Finance, 13(2):245–276, 2003. [CBMS07] Nicol` Cesa-Bianchi, Yishay Mansour, and Gilles Stoltz. Improved second-order o bounds for prediction with expert advice. Mach. Learn., 66(2-3):321–352, 2007. [Cov91] T. Cover. Universal portfolios. Math. Finance, 1:1–19, 1991. [DKM06] Peter DeMarzo, Ilan Kremer, and Yishay Mansour. Online trading algorithms and robust option pricing. In STOC ’06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 477–486, New York, NY, USA, 2006. ACM. [HK08] Elad Hazan and Satyen Kale. Extracting certainty from uncertainty: Regret bounded by variation in costs. In Proceedings of 21st COLT, 2008. [HK09] Elad Hazan and Satyen Kale. Better algorithms for benign bandits. In SODA, pages 38–47, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics. [HKKA06] Elad Hazan, Adam Kalai, Satyen Kale, and Amit Agarwal. Logarithmic regret algorithms for online convex optimization. In COLT, pages 499–513, 2006. [HSSW96] David P. Helmbold, Robert E. Schapire, Yoram Singer, and Manfred K. Warmuth. Online portfolio selection using multiplicative updates. In ICML, pages 243–251, 1996. [Jam92] F. Jamshidian. Asymptotically optimal portfolios. Mathematical Finance, 2:131–150, 1992. [KS04] Ioannis Karatzas and Steven E. Shreve. Brownian Motion and Stochastic Calculus. Springer Verlag, New York, NY, USA, 2004. [KV03] Adam Kalai and Santosh Vempala. Efficient algorithms for universal portfolios. J. Mach. Learn. Res., 3:423–440, 2003. [KV05] [MF92] Adam Kalai and Santosh Vempala. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71(3):291–307, 2005. Neri Merhav and Meir Feder. Universal sequential learning and decision from individual data sequences. In COLT, pages 413–427, 1992. [Osb59] M. F. M. Osborne. Brownian motion in the stock market. Operations Research, 2:145– 173, 1959. [Zin03] Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, pages 928–936, 2003. 9