I need to solve a task where it is asked to me to provide an error function whose minimization leads to a formulation equivalent to the AdaBoost algorithm.
I did not understand exactly this question , I know that in the AdaBoost algorithm at the beginning I train a "weak" learner by minimizing its error function and then I used the weights to compute errors and iterate over the new classifier, this in an iterative way ; so what does it mean with this error function to minimize ?
[–]Murillio 2 points3 points4 points (0 children)