The Hierarchical Evolution in Human Vision Modeling
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Tomaso A. Poggio
BK-SFN-NEUROSCIENCE-131211-09_Poggio.indd 362 16/04/14 5:25 PM Tomaso A. Poggio BORN: Genova, Italy September 11, 1947 EDUCATION: University of Genoa, PhD in Physics, Summa cum laude (1971) APPOINTMENTS: Wissenschaftlicher Assistant, Max Planck Institut für Biologische Kybernetik, Tubingen, Germany (1978) Associate Professor (with tenure), Department of Psychology and Artificial Intelligence Laboratory, Massachusetts Institute of Technology (1981) Uncas and Helen Whitaker Chair, Department of Brain & Cognitive Sciences, Massachusetts Institute of Technology (1988) Eugene McDermott Professor, Department of Brain and Cognitive Sciences, Computer Science and Artificial Intelligence Laboratory and McGovern Institute for Brain Research, Massachusetts Institute of Technology (2002) HONORS AND AWARDS (SELECTED): Otto-Hahn-Medaille of the Max Planck Society (1979) Member, Neurosciences Research Program (1979) Columbus Prize of the Istituto Internazionale delle Comunicazioni Genoa, Italy (1982) Corporate Fellow, Thinking Machines Corporation (1984) Founding Fellow, American Association of Artificial Intelligence (1990) Fellow, American Academy of Arts and Sciences (1997) Foreign Member, Istituto Lombardo dell’Accademia di Scienze e Lettere (1998) Laurea Honoris Causa in Ingegneria Informatica, Bicentenario dell’Invezione della Pila, Pavia, Italia, March (2000) Gabor Award, International Neural Network Society (2003) Okawa Prize (2009) Fellow, American Association for the Advancement of Science (2009) Tomaso Poggio began his career in collaboration -
How Visual Cortex Works and Machine Vision Tools for the Visually Impaired
! How visual cortex works and machine vision tools for the visually impaired ! tomaso poggio CBMM, McGovern Institute, BCS, CSAIL MIT The Center for Brains, Minds and Machines Vision for CBMM • The problem of intelligence is one of the great problems in science. • Work so far has led to many systems with impressive but narrow intelligence • Now it is time to develop a basic science understanding of human intelligence so that we can take intelligent applications to another level. MIT Harvard Boyden, Desimone ,Kaelbling , Kanwisher, Blum, Kreiman, Mahadevan, Katz, Poggio, Sassanfar, Saxe, Nakayama, Sompolinsky, Schulz, Tenenbaum, Ullman, Wilson, Spelke, Valiant Rosasco, Winston Cornell Hirsh Allen Ins1tute Rockfeller UCLA Stanford Koch Freiwald Yuille Goodman Hunter Wellesley Puerto Rico Howard Epstein,... Hildreth, Conway... Bykhovaskaia, Vega... Manaye,... City U. HK Hebrew U. IIT MPI Smale Shashua MeNa, Rosasco, Buelthoff Sandini NCBS Genoa U. Weizmann Raghavan Verri Ullman Google IBM MicrosoH Orcam MoBilEye Norvig Ferrucci Blake Shashua Shashua Boston Rethink Willow DeepMind Dynamics RoBo1cs Garage Hassabis Raibert Brooks Cousins RaPonal for a Center Convergence of progress: a key opportunity Machine Learning & Computer Science Neuroscience & Computational Cognitive Science Neuroscience Change comes most of all from the unvisited no-man’s-land between the disciplines (Norbert Wiener (1894-1964)) Science + Technology of Intelligence The core CBMM challenge:describe in a scene objects, people, actions, social interactions What is this? -
Machine Learning for Neuroscience Geoffrey E Hinton
Hinton Neural Systems & Circuits 2011, 1:12 http://www.neuralsystemsandcircuits.com/content/1/1/12 QUESTIONS&ANSWERS Open Access Machine learning for neuroscience Geoffrey E Hinton What is machine learning? Could you provide a brief description of the Machine learning is a type of statistics that places parti- methods of machine learning? cular emphasis on the use of advanced computational Machine learning can be divided into three parts: 1) in algorithms. As computers become more powerful, and supervised learning, the aim is to predict a class label or modern experimental methods in areas such as imaging a real value from an input (classifying objects in images generate vast bodies of data, machine learning is becom- or predicting the future value of a stock are examples of ing ever more important for extracting reliable and this type of learning); 2) in unsupervised learning, the meaningful relationships and for making accurate pre- aim is to discover good features for representing the dictions. Key strands of modern machine learning grew input data; and 3) in reinforcement learning, the aim is out of attempts to understand how large numbers of to discover what action should be performed next in interconnected, more or less neuron-like elements could order to maximize the eventual payoff. learn to achieve behaviourally meaningful computations and to extract useful features from images or sound What does machine learning have to do with waves. neuroscience? By the 1990s, key approaches had converged on an Machine learning has two very different relationships to elegant framework called ‘graphical models’, explained neuroscience. As with any other science, modern in Koller and Friedman, in which the nodes of a graph machine-learning methods can be very helpful in analys- represent variables such as edges and corners in an ing the data. -
Genetic Algorithms Are a Competitive Alternative for Training Deep Neural Networks for Reinforcement Learning
Deep Neuroevolution: Genetic Algorithms are a Competitive Alternative for Training Deep Neural Networks for Reinforcement Learning Felipe Petroski Such Vashisht Madhavan Edoardo Conti Joel Lehman Kenneth O. Stanley Jeff Clune Uber AI Labs ffelipe.such, [email protected] Abstract 1. Introduction Deep artificial neural networks (DNNs) are typ- A recent trend in machine learning and AI research is that ically trained via gradient-based learning al- old algorithms work remarkably well when combined with gorithms, namely backpropagation. Evolution sufficient computing resources and data. That has been strategies (ES) can rival backprop-based algo- the story for (1) backpropagation applied to deep neu- rithms such as Q-learning and policy gradients ral networks in supervised learning tasks such as com- on challenging deep reinforcement learning (RL) puter vision (Krizhevsky et al., 2012) and voice recog- problems. However, ES can be considered a nition (Seide et al., 2011), (2) backpropagation for deep gradient-based algorithm because it performs neural networks combined with traditional reinforcement stochastic gradient descent via an operation sim- learning algorithms, such as Q-learning (Watkins & Dayan, ilar to a finite-difference approximation of the 1992; Mnih et al., 2015) or policy gradient (PG) methods gradient. That raises the question of whether (Sehnke et al., 2010; Mnih et al., 2016), and (3) evolution non-gradient-based evolutionary algorithms can strategies (ES) applied to reinforcement learning bench- work at DNN scales. Here we demonstrate they marks (Salimans et al., 2017). One common theme is can: we evolve the weights of a DNN with a sim- that all of these methods are gradient-based, including ES, ple, gradient-free, population-based genetic al- which involves a gradient approximation similar to finite gorithm (GA) and it performs well on hard deep differences (Williams, 1992; Wierstra et al., 2008; Sali- RL problems, including Atari and humanoid lo- mans et al., 2017). -
Old HMAX and Face Recognition
Old HMAX and face recognition Tomaso Poggio 1. Problem of visual recognition, visual cortex 2. Historical background 3. Neurons and areas in the visual system 4. Feedforward hierarchical models 5. Beyond hierarchical models WARNING: using a class of models to summarize/interpret experimental results ! • Models are cartoons of reality, eg Bohr’s model of the hydrogen atom ! • All models are “wrong” ! • Some models can be useful summaries of data and some can be a good starting point for a real theory 1. Problem of visual recognition, visual cortex 2. Historical background 3. Neurons and areas in the visual system 4. Feedforward hierarchical models 5. Beyond hierarchical models Learning and Recogni-on in Visual Cortex: what is where Unconstrained visual recognition was a difficult problem (e.g., “is there an animal in the image?”) Vision: what is where ! ! ! Vision A Computational Investigation into the Human Representation and Processing of Visual Information David Marr Foreword by Shimon Ullman !Afterword by Tomaso Poggio David Marr's posthumously published Vision (1982) influenced a generation of brain and cognitive scientists, inspiring many to enter the field. In Vision, Marr describes a general framework for understanding visual perception and touches on broader questions about how the brain and its functions can be studied and understood. Researchers from a range of brain and cognitive sciences have long valued Marr's creativity, intellectual power, and ability to integrate insights and data from neuroscience, psychology, and computation. This MIT Press edition makes Marr's influential work available to a new generation !of students and scientists. In Marr's framework, the process of vision constructs a set of representations, starting from a description of the input image and culminating with a description of three-dimensional objects in the surrounding environment. -
Learning from Brains How to Regularize Machines
Learning From Brains How to Regularize Machines Zhe Li1-2,*, Wieland Brendel4-5, Edgar Y. Walker1-2,7, Erick Cobos1-2, Taliah Muhammad1-2, Jacob Reimer1-2, Matthias Bethge4-6, Fabian H. Sinz2,5,7, Xaq Pitkow1-3, Andreas S. Tolias1-3 1 Department of Neuroscience, Baylor College of Medicine 2 Center for Neuroscience and Artificial Intelligence, Baylor College of Medicine 3 Department of Electrical and Computer Engineering, Rice University 4 Centre for Integrative Neuroscience, University of Tübingen 5 Bernstein Center for Computational Neuroscience, University of Tübingen 6 Institute for Theoretical Physics, University of Tübingen 7 Institute Bioinformatics and Medical Informatics, University of Tübingen *[email protected] Abstract Despite impressive performance on numerous visual tasks, Convolutional Neural Networks (CNNs) — unlike brains — are often highly sensitive to small pertur- bations of their input, e.g. adversarial noise leading to erroneous decisions. We propose to regularize CNNs using large-scale neuroscience data to learn more robust neural features in terms of representational similarity. We presented natural images to mice and measured the responses of thousands of neurons from cortical visual areas. Next, we denoised the notoriously variable neural activity using strong predictive models trained on this large corpus of responses from the mouse visual system, and calculated the representational similarity for millions of pairs of images from the model’s predictions. We then used the neural representation similarity to regularize CNNs trained on image classification by penalizing intermediate representations that deviated from neural ones. This preserved performance of baseline models when classifying images under standard benchmarks, while main- taining substantially higher performance compared to baseline or control models when classifying noisy images. -
Acetylcholine in Cortical Inference
Neural Networks 15 (2002) 719–730 www.elsevier.com/locate/neunet 2002 Special issue Acetylcholine in cortical inference Angela J. Yu*, Peter Dayan Gatsby Computational Neuroscience Unit, University College London, 17 Queen Square, London WC1N 3AR, UK Received 5 October 2001; accepted 2 April 2002 Abstract Acetylcholine (ACh) plays an important role in a wide variety of cognitive tasks, such as perception, selective attention, associative learning, and memory. Extensive experimental and theoretical work in tasks involving learning and memory has suggested that ACh reports on unfamiliarity and controls plasticity and effective network connectivity. Based on these computational and implementational insights, we develop a theory of cholinergic modulation in perceptual inference. We propose that ACh levels reflect the uncertainty associated with top- down information, and have the effect of modulating the interaction between top-down and bottom-up processing in determining the appropriate neural representations for inputs. We illustrate our proposal by means of an hierarchical hidden Markov model, showing that cholinergic modulation of contextual information leads to appropriate perceptual inference. q 2002 Elsevier Science Ltd. All rights reserved. Keywords: Acetylcholine; Perception; Neuromodulation; Representational inference; Hidden Markov model; Attention 1. Introduction medial septum (MS), diagonal band of Broca (DBB), and nucleus basalis (NBM). Physiological studies on ACh Neuromodulators such as acetylcholine (ACh), sero- indicate that its neuromodulatory effects at the cellular tonine, dopamine, norepinephrine, and histamine play two level are diverse, causing synaptic facilitation and suppres- characteristic roles. One, most studied in vertebrate systems, sion as well as direct hyperpolarization and depolarization, concerns the control of plasticity. The other, most studied in all within the same cortical area (Kimura, Fukuda, & invertebrate systems, concerns the control of network Tsumoto, 1999). -
Model-Free Episodic Control
Model-Free Episodic Control Charles Blundell Benigno Uria Alexander Pritzel Google DeepMind Google DeepMind Google DeepMind [email protected] [email protected] [email protected] Yazhe Li Avraham Ruderman Joel Z Leibo Jack Rae Google DeepMind Google DeepMind Google DeepMind Google DeepMind [email protected] [email protected] [email protected] [email protected] Daan Wierstra Demis Hassabis Google DeepMind Google DeepMind [email protected] [email protected] Abstract State of the art deep reinforcement learning algorithms take many millions of inter- actions to attain human-level performance. Humans, on the other hand, can very quickly exploit highly rewarding nuances of an environment upon first discovery. In the brain, such rapid learning is thought to depend on the hippocampus and its capacity for episodic memory. Here we investigate whether a simple model of hippocampal episodic control can learn to solve difficult sequential decision- making tasks. We demonstrate that it not only attains a highly rewarding strategy significantly faster than state-of-the-art deep reinforcement learning algorithms, but also achieves a higher overall reward on some of the more challenging domains. 1 Introduction Deep reinforcement learning has recently achieved notable successes in a variety of domains [23, 32]. However, it is very data inefficient. For example, in the domain of Atari games [2], deep Reinforcement Learning (RL) systems typically require tens of millions of interactions with the game emulator, amounting to hundreds of hours of game play, to achieve human-level performance. As pointed out by [13], humans learn to play these games much faster. This paper addresses the question of how to emulate such fast learning abilities in a machine—without any domain-specific prior knowledge. -
When Planning to Survive Goes Wrong: Predicting the Future and Replaying the Past in Anxiety and PTSD
Available online at www.sciencedirect.com ScienceDirect When planning to survive goes wrong: predicting the future and replaying the past in anxiety and PTSD 1 3 1,2 Christopher Gagne , Peter Dayan and Sonia J Bishop We increase our probability of survival and wellbeing by lay out this computational problem as a form of approxi- minimizing our exposure to rare, extremely negative events. In mate Bayesian decision theory (BDT) [1] and consider this article, we examine the computations used to predict and how miscalibrated attempts to solve it might contribute to avoid such events and to update our models of the world and anxiety and stress disorders. action policies after their occurrence. We also consider how these computations might go wrong in anxiety disorders and According to BDT, we should combine a probability Post Traumatic Stress Disorder (PTSD). We review evidence distribution over all relevant states of the world with that anxiety is linked to increased simulations of the future estimates of the benefits or costs of outcomes associated occurrence of high cost negative events and to elevated with each state. We must then calculate the course of estimates of the probability of occurrence of such events. We action that delivers the largest long-run expected value. also review psychological theories of PTSD in the light of newer, Individuals can only possibly approximately solve this computational models of updating through replay and problem. To do so, they bring to bear different sources of simulation. We consider whether pathological levels of re- information (e.g. priors, evidence, models of the world) experiencing symptomatology might reflect problems and apply different methods to calculate the expected reconciling the traumatic outcome with overly optimistic priors long-run values of alternate courses of action. -
Pnas11052ackreviewers 5098..5136
Acknowledgment of Reviewers, 2013 The PNAS editors would like to thank all the individuals who dedicated their considerable time and expertise to the journal by serving as reviewers in 2013. Their generous contribution is deeply appreciated. A Harald Ade Takaaki Akaike Heather Allen Ariel Amir Scott Aaronson Karen Adelman Katerina Akassoglou Icarus Allen Ido Amit Stuart Aaronson Zach Adelman Arne Akbar John Allen Angelika Amon Adam Abate Pia Adelroth Erol Akcay Karen Allen Hubert Amrein Abul Abbas David Adelson Mark Akeson Lisa Allen Serge Amselem Tarek Abbas Alan Aderem Anna Akhmanova Nicola Allen Derk Amsen Jonathan Abbatt Neil Adger Shizuo Akira Paul Allen Esther Amstad Shahal Abbo Noam Adir Ramesh Akkina Philip Allen I. Jonathan Amster Patrick Abbot Jess Adkins Klaus Aktories Toby Allen Ronald Amundson Albert Abbott Elizabeth Adkins-Regan Muhammad Alam James Allison Katrin Amunts Geoff Abbott Roee Admon Eric Alani Mead Allison Myron Amusia Larry Abbott Walter Adriani Pietro Alano Isabel Allona Gynheung An Nicholas Abbott Ruedi Aebersold Cedric Alaux Robin Allshire Zhiqiang An Rasha Abdel Rahman Ueli Aebi Maher Alayyoubi Abigail Allwood Ranjit Anand Zalfa Abdel-Malek Martin Aeschlimann Richard Alba Julian Allwood Beau Ances Minori Abe Ruslan Afasizhev Salim Al-Babili Eric Alm David Andelman Kathryn Abel Markus Affolter Salvatore Albani Benjamin Alman John Anderies Asa Abeliovich Dritan Agalliu Silas Alben Steven Almo Gregor Anderluh John Aber David Agard Mark Alber Douglas Almond Bogi Andersen Geoff Abers Aneel Aggarwal Reka Albert Genevieve Almouzni George Andersen Rohan Abeyaratne Anurag Agrawal R. Craig Albertson Noga Alon Gregers Andersen Susan Abmayr Arun Agrawal Roy Alcalay Uri Alon Ken Andersen Ehab Abouheif Paul Agris Antonio Alcami Claudio Alonso Olaf Andersen Soman Abraham H. -
A Framework for Searching Forgeneral Artificial Intelligence
M.ROSA,J.FEYEREISL&THEGOODAITEAM AFRAMEWORK FORSEARCHINGFOR GENERALARTIFICIALINTELLIGENCE arXiv:1611.00685v1 [cs.AI] 2 Nov 2016 V E R S I O N 1 Versions 1.0 current version: initial release for the general public 2.0 planned future version: additional illustrations demonstrating framework principles 3.0 planned future version: additional mathematical formalizations and proofs Correspondence: {marek.rosa,jan.feyereisl}@goodai.com Copyright © 2016 GoodAI www.goodai.com The LATEX template used in this document is licensed under the Apache License, Version 2.0 (the “License”); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0. Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an “as is” basis, without warranties or conditions of any kind, either express or implied. See the License for the specific language governing permissions and limitations under the License. First printing, November 2016 Abstract There is a significant lack of unified approaches to building generally intelligent machines. The majority of current artificial intelligence re- search operates within a very narrow field of focus, frequently without considering the importance of the ’big picture’. In this document, we seek to describe and unify principles that guide the basis of our de- velopment of general artificial intelligence. These principles revolve around the idea that intelligence is a tool for searching for general so- lutions to problems. We define intelligence as the ability to acquire skills that narrow this search, diversify it and help steer it to more promising areas. -
Technical Note Q-Learning
Machine Learning, 8, 279-292 (1992) © 1992 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Technical Note Q-Learning CHRISTOPHER J.C.H. WATKINS 25b Framfield Road, Highbury, London N5 1UU, England PETER DAYAN Centre for Cognitive Science, University of Edinburgh, 2 Buccleuch Place, Edinburgh EH8 9EH, Scotland Abstract. ~-learning (Watkins, 1989) is a simpleway for agentsto learn how to act optimallyin controlledMarkovian domains. It amounts to an incremental method for dynamic programming which imposes limited computational demands. It works by successivelyimproving its evaluationsof the quality of particular actions at particular states. This paper presents and proves in detail a convergencetheorem for ~-learning based on that outlined in Watkins (1989). We show that 0~-learningconverges to the optimum action-valueswith probability 1 so long as all actions are repeatedly sampled in all states and the action-values are represented discretely. We also sketch extensions to the cases of non-discounted, but absorbing, Markov environments, and where many O~values can be changed each iteration, rather than just one. Keywords. 0~-learning, reinforcement learning, temporal differences, asynchronous dynamic programming 1. Introduction O~-learning (Watkins, 1989) is a form of model-free reinforcement learning. It can also be viewed as a method of asynchronous dynamic programming (DP). It provides agents with the capability of learning to act optimally in Markovian domains by experiencing the con- sequences of actions, without requiring them to build maps of the domains. Learning proceeds similarly to Sutton's (1984; 1988) method of temporal differences (TD): an agent tries an action at a particular state, and evaluates its consequences in terms of the immediate reward or penalty it receives and its estimate of the value of the state to which it is taken.