|
Hi, I am trying to implement a NN with boosting. In a single NN, assume we try to minimize the log likelihood cost function. What i would like to know is, what cost do we minimize for each weak NN. Moreover what will be the gradient in this case ? Since i am new to Machine Learning please be as descriptive as possible. |
