Universal portfolio selection
暂无分享,去创建一个
[1] L. Levin,et al. THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .
[2] Vladimir Vovk,et al. Aggregating strategies , 1990, COLT '90.
[3] Philip M. Long,et al. On-line learning of linear functions , 1991, STOC '91.
[4] Neri Merhav,et al. Universal prediction of individual sequences , 1992, IEEE Trans. Inf. Theory.
[5] Vladimir Vovk,et al. Universal Forecasting Algorithms , 1992, Inf. Comput..
[6] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[7] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[8] David Haussler,et al. Tight worst-case loss bounds for predicting with expert advice , 1994, EuroCOLT.
[9] Vladimir Vovk,et al. A game of prediction with expert advice , 1995, COLT '95.
[10] Erik Ordentlich,et al. Universal portfolios with side information , 1996, IEEE Trans. Inf. Theory.
[11] Yoram Singer,et al. On‐Line Portfolio Selection Using Multiplicative Updates , 1998, ICML.
[12] A. Blum,et al. Universal portfolios with and without transaction costs , 1997, COLT '97.
[13] Vladimir Vovk,et al. Derandomizing Stochastic Prediction Strategies , 1997, COLT '97.
[14] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..