On‐Line Portfolio Selection Using Multiplicative Updates

We present an on‐line investment algorithm that achieves almost the same wealth as the best constant‐rebalanced portfolio determined in hindsight from the actual market outcomes. The algorithm employs a multiplicative update rule derived using a framework introduced by Kivinen and Warmuth. Our algorithm is very simple to implement and requires only constant storage and computing time per stock in each trading period. We tested the performance of our algorithm on real stock data from the New York Stock Exchange accumulated during a 22‐year period. On these data, our algorithm clearly outperforms the best single stock as well as Cover's universal portfolio selection algorithm. We also present results for the situation in which the investor has access to additional “side information.”

[1]  John L. Kelly,et al.  A new interpretation of information rate , 1956, IRE Trans. Inf. Theory.

[2]  Robert M. Bell,et al.  Competitive Optimality of Logarithmic Investment , 1980, Math. Oper. Res..

[3]  Thomas M. Cover,et al.  An algorithm for maximizing expected log investment return , 1984, IEEE Trans. Inf. Theory.

[4]  Thomas M. Cover,et al.  Empirical Bayes stock market portfolios , 1986 .

[5]  T. Cover,et al.  Asymptotic optimality and asymptotic equipartition properties of log-optimum investment , 1988 .

[6]  R. Fletcher Practical Methods of Optimization , 1988 .

[7]  T. Cover,et al.  Game-theoretic optimal portfolios , 1988 .

[8]  Andrew R. Barron,et al.  A bound on the financial value of information , 1988, IEEE Trans. Inf. Theory.

[9]  David Haussler,et al.  Predicting {0,1}-functions on randomly drawn points , 1988, COLT '88.

[10]  J. Hull Options, Futures, and Other Derivatives , 1989 .

[11]  Guy Jumarie,et al.  Relative Information — What For? , 1990 .

[12]  Nick Littlestone,et al.  Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow , 1991, COLT '91.

[13]  P. Algoet UNIVERSAL SCHEMES FOR PREDICTION, GAMBLING AND PORTFOLIO SELECTION' , 1992 .

[14]  Mark Herbster,et al.  Tracking the Best Expert , 1995, Machine-mediated learning.

[15]  Manfred K. Warmuth,et al.  Additive versus exponentiated gradient updates for linear prediction , 1995, STOC '95.

[16]  Erik Ordentlich,et al.  Universal portfolios with side information , 1996, IEEE Trans. Inf. Theory.

[17]  T. Cover Universal Portfolios , 1996 .

[18]  A. Blum,et al.  Universal portfolios with and without transaction costs , 1997, COLT '97.

[19]  Manfred K. Warmuth,et al.  Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..

[20]  Yoram Singer,et al.  Switching Portfolios , 1998, Int. J. Neural Syst..