Capabilities of fallible FINite learning
Robert Daley, Bala Kalyanasundaram, Mahendran Velauthapillai · 1993
The type of learning which we consider is finite learning( F]N-t ype) where a learner is permitted to conjecture only one program for the function which it is trying to learn.In this paper we investigate the relative learning capabilities of probabilistic and pluralistic learners when they are allowed to conjecture programs which have errors in them.Pluralistic learners are teams of learners which cooperate in trying to learn a function.We determine the exact point at which probabilistic learners are more powerful than deterministic (i.e., a team of size one) learners.