Tight worst-case loss bounds for predicting with expert advice
暂无分享,去创建一个
[1] Thomas M. Cover,et al. Behavior of sequential predictors of binary sequences , 1965 .
[2] J. D. T. Oliveira,et al. The Asymptotic Theory of Extreme Order Statistics , 1979 .
[3] J. Mycielski. A learning theorem for linear operators , 1988 .
[4] Alfredo De Santis,et al. Learning probabilistic prediction functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[5] Vladimir Vovk,et al. Aggregating strategies , 1990, COLT '90.
[6] Philip M. Long,et al. On-line learning of linear functions , 1991, STOC '91.
[7] Neri Merhav,et al. Universal sequential learning and decision from individual data sequences , 1992, COLT '92.
[8] Neri Merhav,et al. Universal prediction of individual sequences , 1992, IEEE Trans. Inf. Theory.
[9] Vladimir Vovk,et al. Universal Forecasting Algorithms , 1992, Inf. Comput..
[10] David Haussler,et al. How to use expert advice , 1993, STOC.
[11] Manfred K. Warmuth,et al. Using experts for predicting continuous outcomes , 1994, European Conference on Computational Learning Theory.
[12] Philip M. Long,et al. WORST-CASE QUADRATIC LOSS BOUNDS FOR ON-LINE PREDICTION OF LINEAR FUNCTIONS BY GRADIENT DESCENT , 1993 .
[13] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[14] Thomas H. Chung,et al. Approximate methods for sequential decision making using expert advice , 1994, COLT '94.
[15] Neri Merhav,et al. Optimal sequential probability assignment for individual sequences , 1994, IEEE Trans. Inf. Theory.
[16] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..