Continuous Drifting Games

We combine the results of [13] and [8] and derive a continuous variant of a large class of drifting games. Our analysis furthers the understanding of the relationship between boosting, drifting games and Brownian motion and yields a differential equation that describes the core of the problem.

[1]  Yoav Freund,et al.  Boosting a weak learning algorithm by majority , 1995, COLT '90.

[2]  Javed A. Aslam,et al.  On-Line Algorithms for 2-Coloring Hypergraphs Via Chip Games , 1993, Theor. Comput. Sci..

[3]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[4]  Yoav Freund,et al.  Boosting a weak learning algorithm by majority , 1990, COLT '90.

[5]  Peter L. Bartlett,et al.  Boosting Algorithms as Gradient Descent , 1999, NIPS.

[6]  Robert E. Schapire,et al.  Drifting Games , 1999, Annual Conference Computational Learning Theory.

[7]  Yoav Freund,et al.  An Adaptive Version of the Boost by Majority Algorithm , 1999, COLT.

[8]  Peter Winkler,et al.  On playing “Twenty Questions” with a liar , 1992, SODA '92.

[9]  Yoav Freund,et al.  An Adaptive Version of the Boost by Majority Algorithm , 1999, COLT '99.

[10]  Joel H. Spencer,et al.  Ulam's Searching Game with a Fixed Number of Lies , 1992, Theor. Comput. Sci..

[11]  G. Shafer,et al.  Probability and Finance: It's Only a Game! , 2001 .

[12]  Peter L. Bartlett,et al.  Functional Gradient Techniques for Combining Hypotheses , 2000 .

[13]  Yoram Singer,et al.  Improved Boosting Algorithms Using Confidence-rated Predictions , 1998, COLT' 98.

[14]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[15]  Javed A. Aslam,et al.  Searching in the presence of linearly bounded errors , 1991, STOC '91.

[16]  C. Gardiner.  Handbook of Stochastic Methods , 1983 .

[17]  Javed A. Aslam,et al.  Noise tolerant algorithms for learning and searching , 1995 .

[18]  Vladimir Vovk,et al.  A game of prediction with expert advice , 1995, COLT '95.