A decision-theoretic generalization of on-line learning and an application to boosting

Explore this paper's citation graph

Summary

The model studied can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting, and it is shown that the multiplicative weight-update Littlestone?Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems.

Type
article
Published
1997-08-01
Cited by
23,563
References
31

Keywords

Boosting (machine learning), Multiplicative function, Bounded function, Computer science, Generalization

References

Cited by

Related papers