Competitive On-line Linear Regression
暂无分享,去创建一个
[1] Alfredo De Santis,et al. Learning probabilistic prediction functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[2] Vladimir Vovk,et al. Aggregating strategies , 1990, COLT '90.
[3] Dean Phillips Foster. Prediction in the Worst Case , 1991 .
[4] Vladimir Vovk,et al. Universal Forecasting Algorithms , 1992, Inf. Comput..
[5] Manfred K. Warmuth,et al. THE WEIGHTED MAJORITY ALGORITHM (Supersedes 89-16) , 1992 .
[6] Philip M. Long,et al. WORST-CASE QUADRATIC LOSS BOUNDS FOR ON-LINE PREDICTION OF LINEAR FUNCTIONS BY GRADIENT DESCENT , 1993 .
[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] Philip M. Long,et al. Worst-case quadratic loss bounds for prediction using linear functions and gradient descent , 1996, IEEE Trans. Neural Networks.
[11] Yoav Freund,et al. Predicting a binary sequence almost as well as the optimal biased coin , 2003, COLT '96.
[12] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..
[13] Kenji Yamanishi,et al. A Decision-Theoretic Extension of Stochastic Complexity and Its Applications to Learning , 1998, IEEE Trans. Inf. Theory.