Location
Event Description
What Does Learning Mean? presented by Jeffrey Heinz
ABSTRACT
When we develop learning algorithms, what computational problems are we solving? In this talk, I discuss different answers that have been proposed for this question, and discuss some of the consequences for machine learning and artificial intelligence. The main lessons I offer are that (1) feasible solutions to learning problems require careful consideration of a target class C of functions, (2) that such a class C cannot include all functions, or even all computable functions, and so many logically possible functions must be outside of C and (3) class C must have significant structure which the solutions take advantage of. These main ideas are motivated and illustrated from modeling language acquisition and the related problem of grammatical inference from example sequences belonging to formal languages.
