title: On the challenge of learning complex functions.
abstract: A common goal of computational neuroscience and of artificial intelligence research based on statistical learning algorithms is the discovery and understanding of computational principles that could explain what we consider adaptive intelligence, in animals as well as in machines. This chapter focuses on what is required for the learning of complex behaviors. We believe it involves the learning of highly varying functions, in a mathematical sense. We bring forward two types of arguments which convey the message that many currently popular machine learning approaches to learning flexible functions have fundamental limitations that render them inappropriate for learning highly varying functions. The first issue concerns the representation of such functions with what we call shallow model architectures. We discuss limitations of shallow architectures, such as so-called kernel machines, boosting algorithms, and one-hidden-layer artificial neural networks. The second issue is more focused and concerns kernel machines with a local kernel (the type used most often in practice) that act like a collection of template-matching units. We present mathematical results on such computational architectures showing that they have a limitation similar to those already proved for older non-parametric methods, and connected to the so-called curse of dimensionality. Though it has long been believed that efficient learning in deep architectures is difficult, recently proposed computational principles for learning in deep architectures may offer a breakthrough.
authors.affiliation: Department IRO, Université de Montréal, P.O. Box 6128, Downtown Branch, Montreal, QC, H3C 3J7, Canada. bengioy@iro.umontreal.ca
authors.forename: Yoshua
authors.initials: Y
authors.lastname: Bengio
mesh_terms: D001185:Artificial Intelligence; D006801:Humans; D007858:Learning / Q000502:physiology*; D008960:Models, Psychological; D010363:Pattern Recognition, Automated