COMS E6253 Advanced Topics in Computational Learning Theory. 3 points.
Lect: 3.Not offered during 2018-19 academic year.
In-depth study of inherent abilities and limitations of computationally efficient learning algorithms. Algorithms for learning rich Boolean function classes in online, Probably Approximately Correct, and exact learning models. Connections with computational complexity theory emphasized. Substantial course project or term paper required.