摘要: Supervised online learning with an ensemble of students randomized by the choice initial conditions is analyzed. For case perceptron rule, asymptotically same improvement in generalization error compared to performance a single student found as Gibbs learning. more optimized rules, however, using yields no improvement. This explained showing that for any rule f transform exists, such has behavior students.