Evolving Culture Versus Local Minima
نویسنده
چکیده
Wepropose a theory that relates difficulty of learning in deep architectures to culture and language. It is articulated around the following hypotheses: (1) learning in an individual human brain is hampered by the presence of effective local minima; (2) this optimization difficulty is particularly important when it comes to learning higher-level abstractions, i.e., concepts that cover a vast and highly-nonlinear span of sensory configurations; (3) such high-level abstractions are best represented in brains by the composition of many levels of representation, i.e., by deep architectures; (4) a human brain can learn such high-level abstractions if guided by the signals produced by other humans, which act as hints or indirect supervision for these high-level abstractions; and (5), language and the recombination and optimization of mental concepts provide an efficient evolutionary recombination operator, and this gives rise to rapid search in the space of communicable ideas that help humans build up better high-level internal representations of their world. These hypotheses put together imply that human culture and the evolution of ideas have been crucial to counter an optimization difficulty: this optimization difficulty would otherwise make it very difficult for human brains to capture high-level knowledge of the world. The theory is grounded in experimental observations of the difficulties of training deep artificial neural networks. Plausible consequences of this theory for the efficiency of cultural evolution are sketched. Y. Bengio (B) CIFAR Fellow, Department of computer science and operations research, University of Montréal, Montreal, Canada e-mail: [email protected] T. Kowaliw et al. (eds.), Growing Adaptive Machines, 109 Studies in Computational Intelligence 557, DOI: 10.1007/978-3-642-55337-0_3, © Springer-Verlag Berlin Heidelberg 2014
منابع مشابه
Evolving Culture vs Local Minima
We propose a theory that relates difficulty of learning in deep architectures to culture and language. It is articulated around the following hypotheses: (1) learning in an individual human brain is hampered by the presence of effective local minima; (2) this optimization difficulty is particularly important when it comes to learning higher-level abstractions, i.e., concepts that cover a vast a...
متن کاملGlobal optimization on an evolving energy landscape.
Locating the global minimum of a complex potential energy surface is facilitated by considering a homotopy, namely, a family of surfaces that interpolate continuously from an arbitrary initial potential to the system under consideration. Different strategies can be used to follow the evolving minima. It is possible to enhance the probability of locating the global minimum through a heuristic ch...
متن کاملTunnelling Descent: A New Algorithm for Active Contour Segmentation of Ultrasound Images
The presence of speckle in ultrasound images makes it hard to segment them using active contours. Speckle causes the energy function of the active contours to have many local minima, and the gradient descent procedure used for evolving the contour gets trapped in these minima. A new algorithm, called tunnelling descent, is proposed in this paper for evolving active contours. Tunnelling descent ...
متن کاملGlobal and Local
Discrete versus continuous, simple versus complex, global versus local, linear versus nonlinear, deterministic versus stochastic, analytic versus numerical, constructive versus nonconstructive – those contrasts are among the great organizing themes of mathematics. They are forks in the road of mathematical technique – the concepts along one fork are very different from those along the other, ev...
متن کاملFinding pathways between distant local minima.
We report a new algorithm for constructing pathways between local minima that involve a large number of intervening transition states on the potential energy surface. A significant improvement in efficiency has been achieved by changing the strategy for choosing successive pairs of local minima that serve as endpoints for the next search. We employ Dijkstra's algorithm [E. W. Dijkstra, Numer. M...
متن کامل