A Literature Study Concerning Generalization Error Bounds for Neural Networks via Rademacher Complexity
University essay from Umeå universitet/Institutionen för matematik och matematisk statistik
Abstract: In this essay some fundamental results from the theory of machine learning and neural networks are presented, with the goal of finally discussing bounds on the generalization error of neural networks, via Rademacher complexity.
AT THIS PAGE YOU CAN DOWNLOAD THE WHOLE ESSAY. (follow the link to the next page)