Revision as of 21:28, 14 September 2008 edit JonathanWilliford (talk \| contribs) 169 edits No edit summary ← Previous edit		Revision as of 21:29, 14 September 2008 edit undo JonathanWilliford (talk \| contribs) 169 edits m →Mistake bounds Next edit →
Line 23: ==Mistake bounds== If Winnow1 is run with <math>\alpha > 1</math> and <math>\Theta\geq 1/\alpha</math> on a target function that is a $<math>k$</math>-literal monotone disjunction given by <math>f(x_1,...x_n)=x_{i_1}\cup ... \cup x_{i_k}</math>, then for any sequence of instances the total number of mistakes is bounded by <math>\alpha k ( \log_\alpha \Theta+1)+\frac{n}{\Theta}</math>. ==References==

Winnow (algorithm): Difference between revisions