This course will give a detailed introduction to learning theory with a focus on the classification problem. It will be shown how to obtain (pobabilistic) bounds on the generalization error for certain types of algorithms. The main themes will be: * probabilistic inequalities and concentration inequalities * union bounds, chaining * measuring the size of a function class, Vapnik Chervonenkis dimension, shattering dimension and Rademacher averages * classification with real-valued functions Some knowledge of probability theory would be helpful but not required since the main tools will be introduced.
M. Fyfield, M. Henderson, and M. Phillips. Proceedings of Australasian Society for Computers in Learning in Tertiary Education Annual Conference 2019, page 418-423. Australia, Australasian Society for Computers in Learning in Tertiary Education, (2019)Annual Conference of the Australasian Society for Computers in Learning in Tertiary Education 2019, ASCILITE 2019 ; Conference date: 02-12-2019 Through 05-12-2019.
S. Yagli, A. Dytso, and H. Poor. (2020)cite arxiv:2005.02503Comment: Accepted for publication in Proceedings of 21st IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2020. arXiv version is 10pt font, 6 Pages. This is the same document as the SPAWC version, except that the conference version is written with 9pt font to meet the strict page margin requirements.