Learning from a Population of Hypotheses

We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approximate an unknown target function arbitrarily well. Our motivation includes the question of how to make optimal use of multiple independent runs of a mediocre learning algorithm, as well as settings in which the many hypotheses are obtained by a distributed population of identical learning agents.

• Type: Conference
• Year: 1993
• Where: COLT
• Authors: Michael J. Kearns, H. Sebastian Seung
• Keywords: COLT 1993, Independent Hypothesis Functions, Learning Algorithm, Machine Learning, Mediocre Learning Algorithm