Search Results

Lect: 3.Not offered during 2022-23 academic year.

Prerequisites: (COMS W4252) or (CSOR W4231) or equivalent, COMS W4236 recommended.
In-depth study of inherent abilities and limitations of computationally efficient learning algorithms. Algorithms for learning rich Boolean functions in online, Probably Approximately Correct, and exact learning models. Connections with computational complexity theory emphasized. Substantial course project or term paper required