The Informational Complexity of Learning from Examples
Author(s)
Niyogi, Partha
Date Issued
September 1, 1996
Series/Report no.
AITR-1587
Abstract
This thesis attempts to quantify the amount of information needed to learn certain tasks. The tasks chosen vary from learning functions in a Sobolev space using radial basis function networks to learning grammars in the principles and parameters framework of modern linguistic theory. These problems are analyzed from the perspective of computational learning theory and certain unifying perspectives emerge.
Persistent DSpace Link