Artificial Intelligence and Hierarchical Temporal Memory By E. Seamus O’Dunn November 28, 2012.

Slides:



Advertisements
Similar presentations
LAST LECTURE. Functionalism Functionalism in philosophy of mind is the view that mental states should be identified with and differentiated in terms of.
Advertisements

Artificial Intelligence
1 Lecture 35 Brief Introduction to Main AI Areas (cont’d) Overview  Lecture Objective: Present the General Ideas on the AI Branches Below  Introduction.
1946: ENIAC heralds the dawn of Computing. I propose to consider the question: “Can machines think?” --Alan Turing, : Turing asks the question….
Artificial Intelligence Austin Luczak, Katie Regin, John Trawinski.
CSCE101 –Chapter 8 (continued) Tuesday, December 5, 2006.
CS4811 Artificial Intelligence Some slides from: Subbarao Kambhampati, Arizona State University Spiffy Introduction to AI MTU.
1946: ENIAC heralds the dawn of Computing I propose to consider the question: “Can machines think?” --Alan Turing, : Turing asks the question….
CS 357 – Intro to Artificial Intelligence  Learn about AI, search techniques, planning, optimization of choice, logic, Bayesian probability theory, learning,
Three Fundamental Questions Facing our Age G Origin of the Universe G Origin of Life G Nature of Intelligence.
Introduction to Artificial Intelligence CSE 473 Winter 1999.
COMP 3009 Introduction to AI Dr Eleni Mangina
1946: ENIAC heralds the dawn of Computing I propose to consider the question: “Can machines think?” --Alan Turing, : Turing asks the question….
CS4811 Artificial Intelligence Some slides from: Subbarao Kambhampati, Arizona State University Spiffy Introduction to AI MTU.
IT 691 Final Presentation Pace University Created by: Robert M Gust Mark Lee Samir Hessami Mark Lee Samir Hessami.
1 4 questions (Revisited) What are our underlying assumptions about intelligence? What kinds of techniques will be useful for solving AI problems? At what.
D Goforth - COSC 4117, fall Notes  Program evaluation – Sept Student submissions  Mon. Sept 11, 4-5PM  FA 181 Comments to committee are.
Artificial Intelligence: Its Roots and Scope
Chapter 16 Can Computers Think (now or in the future)? Can Computers Think (now or in the future)?
The Thinking Machine Based on Tape. Computer Has Some Intelligence Now Playing chess Solving calculus problems Other examples:
CISC4/681 Introduction to Artificial Intelligence1 Introduction – Artificial Intelligence a Modern Approach Russell and Norvig: 1.
CS206Evolutionary Robotics “Cogito ergo sum.”. CS206Evolutionary Robotics “Cogito ergo sum.” “I think, therefore I am.” “Do I exist?” “There is something.
The AI Challenge: Who are we? Images Copyright Twentieth Century Fox, Paramount, Sony;
intelligence study and design of intelligent agentsis the intelligence of machines and the branch of computer science that aims to create it. AI textbooks.
Artificial Intelligence (AI) Can Machines Think?.
Artificial Intelligence: An Introduction Definition of AI Foundations of AI History of AI Advanced Techniques.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
Advances in Modeling Neocortex and its impact on machine intelligence Jeff Hawkins Numenta Inc. VS265 Neural Computation December 2, 2010 Documentation.
CNS 4470 Artificial Intelligence. What is AI? No really what is it? No really what is it?
ARTIFICIAL INTELLIGENCE BY:Jeff Brauer, David Abarbanel, Monica Balod, Mae Anglo, Umangi Bhatt.
Unsolvability and Infeasibility. Computability (Solvable) A problem is computable if it is possible to write a computer program to solve it. Can all problems.
A New Theory of Neocortex and Its Implications for Machine Intelligence TTI/Vanguard, All that Data February 9, 2005 Jeff Hawkins Director The Redwood.
Artificial Intelligence Bodies of animals are nothing more than complex machines - Rene Descartes.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
Introduction to Machine Learning Kamal Aboul-Hosn Cornell University Chess, Chinese Rooms, and Learning.
I Robot.
Section 2.3 I, Robot Mind as Software McGraw-Hill © 2013 McGraw-Hill Companies. All Rights Reserved.
Part II: Artificial Intelligence as Representation and Search
Course Instructor: K ashif I hsan 1. Chapter # 1 Kashif Ihsan, Lecturer CS, MIHE2.
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
So what is AI?.
Why Can't A Computer Be More Like A Brain?. Outline Introduction Turning Test HTM ◦ A. Theory ◦ B. Applications & Limits Conclusion.
Artificial Intelligence Past, Present, & Future Andrea McGrath April 21 st, 2006.
FOUNDATIONS OF ARTIFICIAL INTELLIGENCE
Using Bayesian Networks to Predict Plankton Production from Satellite Data By: Rob Curtis, Richard Fenn, Damon Oberholster Supervisors: Anet Potgieter,
Personhood.  What is a person?  Why does it matter?  “Human” rights: do you have to be human to deserve human rights?  Restricted rights? Rights of.
ARTIFICIAL INTELLIGENCE include people, procedures, hardware, software, data and knowledge needed to develop computer systems and machines that demonstrated.
Maestro AI Vision and Design Overview Definitions Maestro: A naïve Sensorimotor Engine prototype. Sensorimotor Engine: Combining sensory and motor functions.
Artificial Intelligence Skepticism by Josh Pippin.
Overview of Artificial Intelligence (1) Artificial intelligence (AI) Computers with the ability to mimic or duplicate the functions of the human brain.
Sub-fields of computer science. Sub-fields of computer science.
History and Philosophy (3 and 4): A Brief History of Cognitive Science
What is cognitive psychology?
Application Areas of Artificial Intelligence(AI)
ARTIFICIAL INTELLIGENCE.
Artificial Intelligence
Artificial Intelligence
Introduction Artificial Intelligent.
Artificial Intelligence (Lecture 1)
Theory of Computation Turing Machines.
Artificial Intelligence Lecture 2: Foundation of Artificial Intelligence By: Nur Uddin, Ph.D.
Natural Language Processing
What is AI?.
Searle on Artificial Intelligence Minds, Brains and Science Chapter 2
COMP3710 Artificial Intelligence Thompson Rivers University
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Artificial Intelligence
The Network Approach: Mind as a Web
Information Retrieval
What is Artificial Intelligence? (AI) is the simulation of human intelligence processes by machines, especially computer systems. These processes include.
Presentation transcript:

Artificial Intelligence and Hierarchical Temporal Memory By E. Seamus O’Dunn November 28, 2012

Overview What is Artificial Intelligence? What is Artificial Intelligence? History History Strong AI vs. Weak AI Strong AI vs. Weak AI Recent Accomplishments Recent Accomplishments Knowledge Representation and HTM Knowledge Representation and HTM Intelligence vs. Consciousness Intelligence vs. Consciousness

What is Artificial Intelligence?

The goal of work in artificial intelligence is to build machines that perform tasks normally requiring human intelligence. -Nils J. Nelson

What is Artificial Intelligence? AI is a collective name for problems which we do not yet know how to solve properly by computer. -Donald Michie

History of AI

Turing Machine In 1937 a mathematician named Alan Turing published a paper on the computable numbers. In 1937 a mathematician named Alan Turing published a paper on the computable numbers. As a thought experiment, Turing describes a machine that writes, reads, and alters symbols on a infinitely long paper tape. As a thought experiment, Turing describes a machine that writes, reads, and alters symbols on a infinitely long paper tape. He goes on to show that this machine with a finite set of operations can perform any computable calculation, no matter the complexity. He goes on to show that this machine with a finite set of operations can perform any computable calculation, no matter the complexity.

The Turing Machine

Turing Sparks Interest in Intelligent Machines In 1950, Turing writes another influential paper entitled Computing Machines and Intelligence. In 1950, Turing writes another influential paper entitled Computing Machines and Intelligence. The paper proposes that brains must be machines, and can therefore be emulated by computers. The paper proposes that brains must be machines, and can therefore be emulated by computers. Turing proposed the famous “Turing Test” for intelligence. Turing proposed the famous “Turing Test” for intelligence. If a machine were indistinguishable from a human based on its answers to questions, It ought to be considered intelligent. If a machine were indistinguishable from a human based on its answers to questions, It ought to be considered intelligent. This paper generated a lot of excitement and interest in Artificial Intelligence. This paper generated a lot of excitement and interest in Artificial Intelligence.

Dartmouth Conference on AI We propose that a 2 month, 10 man study of artificial intelligence be carried out during the summer of 1956 at Dartmouth College in Hanover, New Hampshire. The study is to proceed on the basis of the conjecture that every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it. An attempt will be made to find how to make machines use language, form abstractions and concepts, solve kinds of problems now reserved for humans, and improve themselves. - Dartmouth AI Project Proposal; J. McCarthyDartmouth AI Project Proposal

Dartmouth Conference on AI First large gathering of AI researchers. The expectations of the conference were quite ambitious and a bit naïve. First large gathering of AI researchers. The expectations of the conference were quite ambitious and a bit naïve. During the Conference, Attempts were made to create machines that could, During the Conference, Attempts were made to create machines that could, Understand short stories enough to answer questions regarding them. Understand short stories enough to answer questions regarding them. Understand language to such a degree that it could accurately translate phrases. Understand language to such a degree that it could accurately translate phrases. Navigate through a crowded room. Navigate through a crowded room. All theses tasks proved to be quite difficult. The Dartmouth conference showed no success. All theses tasks proved to be quite difficult. The Dartmouth conference showed no success. By the mid to late sixties, the field of AI had seen no real progress. Research in AI heavily declined. By the mid to late sixties, the field of AI had seen no real progress. Research in AI heavily declined. Later the missing link in early AI research was found to be one of both processing power, and knowledge representation. Later the missing link in early AI research was found to be one of both processing power, and knowledge representation.

Two Schools of Thought Strong AI:Weak AI:

Strong AI vs. Weak AI Phrases first used by John Searle Phrases first used by John Searle Weak AI: Weak AI: Computers are powerful tools used to do things humans otherwise do and to study the nature of intelligence in general. Computers are powerful tools used to do things humans otherwise do and to study the nature of intelligence in general. Strong AI: Strong AI: A computer with the right programming is a conscious mind. A computer with the right programming is a conscious mind. John Searle showed philosophical precedence for disproof of the possibility of Strong AI with his famous Chinese room argument. John Searle showed philosophical precedence for disproof of the possibility of Strong AI with his famous Chinese room argument.

Recent Accomplishments in AI A DARPA-funded onboard computer system from Carnegie Melon University drove a van all but 52 of the 2849 miles from Washington, DC to San Diego, averaging 63 miles per hour day and night, rain or shine. A DARPA-funded onboard computer system from Carnegie Melon University drove a van all but 52 of the 2849 miles from Washington, DC to San Diego, averaging 63 miles per hour day and night, rain or shine. Deep Blue, a chess computer built by IBM researchers, defeated world champion Gary Kasparov in a landmark performance. Deep Blue, a chess computer built by IBM researchers, defeated world champion Gary Kasparov in a landmark performance. A computer system at Argonne National Laboratories proved a long- standing mathematical conjecture about algebra using a method that would be considered creative if done by humans. A computer system at Argonne National Laboratories proved a long- standing mathematical conjecture about algebra using a method that would be considered creative if done by humans. A NASA system learned to classify very faint signals as either stars or galaxies with superhuman accuracy, by studying examples classified by experts. A NASA system learned to classify very faint signals as either stars or galaxies with superhuman accuracy, by studying examples classified by experts. Jeff Hawkins and others invented HTM systems based on neocortex models from neuroscience. Jeff Hawkins and others invented HTM systems based on neocortex models from neuroscience.

The Problem of Knowledge Representation

Knowledge Representation “Realistic performance of the computer, required that the computer program have an extremely large knowledge base. Constructing the knowledge base was problem enough and it was compounded by the problem of how to access just the contextually relevant part.” -Patricia Churchland

Three Problems It takes a huge amount of data to make a machine intelligent It takes a huge amount of data to make a machine intelligent We don’t know how to collect that data. We don’t know how to collect that data. Even if we did, we don’t know how to adequately define relationships within the data. Even if we did, we don’t know how to adequately define relationships within the data. These arise because computers on the most basic level are unbiased (make no assumptions). These arise because computers on the most basic level are unbiased (make no assumptions).

Example: A Simple Short Story Tara saw a puppy in the window. She wanted it. What did Tara want? What did Tara want? From where she is now, can she pick up the puppy? From where she is now, can she pick up the puppy? Say we want to create a program that can understand the following short story enough to answer most questions we could ask.

Example: Language Translation English phrase: “The spirit is willing but the flesh is weak.” English phrase: “The spirit is willing but the flesh is weak.” Direct translation to Russian and back to English transforms the phrase to: “ The vodka is good, but the meat is rotten,” Direct translation to Russian and back to English transforms the phrase to: “ The vodka is good, but the meat is rotten,” To translate correctly, the machine either needs to truly understand the meaning of the phrase or know all pairings of figures of speech across languages of interest. To translate correctly, the machine either needs to truly understand the meaning of the phrase or know all pairings of figures of speech across languages of interest. This is a huge amount of information. This is a huge amount of information.

Problem may be Solved Using Models from Neuroscience

The Neocortex Thin sheet composing the outermost layer of the mammalian brain. Thin sheet composing the outermost layer of the mammalian brain. Is involved in higher functions such as sensory perception, generation of motor commands, spatial reasoning, conscious thought, and language Is involved in higher functions such as sensory perception, generation of motor commands, spatial reasoning, conscious thought, and language Stores information using a hierarchical structure. Higher level meanings are composed of lower level meanings. Stores information using a hierarchical structure. Higher level meanings are composed of lower level meanings. Every region of the neocortex is 98% identical and processes information in the same way. The type of information that is gathered depends on which sensing organ the region is connected to Every region of the neocortex is 98% identical and processes information in the same way. The type of information that is gathered depends on which sensing organ the region is connected to

Hierarchical Temporal Memory System of storing and categorizing information modeled after the neocortex System of storing and categorizing information modeled after the neocortex Identifies both spatial patterns and sequences of spatial patterns which allow time-based inferrence. Identifies both spatial patterns and sequences of spatial patterns which allow time-based inferrence. Are able to both make predictions and identify causal lines based on observations. Are able to both make predictions and identify causal lines based on observations. HTM systems are self learning. HTM systems are self learning.

HTM

HTM Algorithm Basics There is some sort of sensor to gather(observe) data. There is some sort of sensor to gather(observe) data. Spatial Pooling identifies frequently observed patterns and memorizes them as coincidences. Patterns that are significantly similar to each other are treated as the same coincidence. A large number of possible input patterns are reduced to a manageable number of known coincidences (ref 1). Spatial Pooling identifies frequently observed patterns and memorizes them as coincidences. Patterns that are significantly similar to each other are treated as the same coincidence. A large number of possible input patterns are reduced to a manageable number of known coincidences (ref 1). Temporal pooling partitions coincidences that are likely to follow each other in the training sequence into temporal groups. Each group of patterns represents a "name" or causeof the input pattern (ref 1). Temporal pooling partitions coincidences that are likely to follow each other in the training sequence into temporal groups. Each group of patterns represents a "name" or causeof the input pattern (ref 1). After sufficient training, HTMs identify new patterns by calculating the probability they belong to a certain node and a certain sequence (temporal groups). After sufficient training, HTMs identify new patterns by calculating the probability they belong to a certain node and a certain sequence (temporal groups).

HTM

What can HTM Do? Perception center need not parallel human senses. Perception center need not parallel human senses. Can be used to experiment with memory systems that are much larger and perhaps more complex than that of humans. Can be used to experiment with memory systems that are much larger and perhaps more complex than that of humans. Will be much better at identifying trends in data because it can observe it purely. Will be much better at identifying trends in data because it can observe it purely. Time-based inference allows these systems to both, make predictions and trace the cause based on observed patterns. Time-based inference allows these systems to both, make predictions and trace the cause based on observed patterns. Very useful tool for modeling. Should prove to be a useful tool in experimental physics. Very useful tool for modeling. Should prove to be a useful tool in experimental physics.

Intelligence vs. Consciousness

Summary Artificial intelligence aims to create intelligent machines. Artificial intelligence aims to create intelligent machines. If intelligence is adequately defined, computers will be able to model it. If intelligence is adequately defined, computers will be able to model it. We don’t know the best way to represent knowledge in a computer We don’t know the best way to represent knowledge in a computer HTM, modeled after the neocortex in the brain, seems to be a solution to knowledge representation in machines. HTM, modeled after the neocortex in the brain, seems to be a solution to knowledge representation in machines.

References ory ory ory ory

Questions?