Why Artificial Intelligence is Very Hard Theo Pavlidis Distinguished Professor Emeritus Stony Brook University

Slides:



Advertisements
Similar presentations
Testing Relational Database
Advertisements

The Development of AI St Kentigerns Academy Unit 3 – Artificial Intelligence.
Chapter 09 AI techniques in different game genres (Puzzle/Card/Shooting)
Artificial Intelligence
Presentation on Artificial Intelligence
 Emphasizes a single direction  Emphasizes the written or printed texts  Reading is driven by a process that results in meaning  PART TO WHOLE MODEL.
Supporting Business Decisions Expert Systems. Expert system definition Possible working definition of an expert system: –“A computer system with a knowledge.
Commercial Data Processing Lesson 2: The Data Processing Cycle.
Tools: Computers and IT. VB, VBA, Excel, InterDev, Etc. Humans: Decision Making Process Algorithms: Math/Flow Chart stuff that helps the tools help the.
Artificial Intelligence
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Game Design Serious Games Miikka Junnila.
Will Androids Dream of Electric Sheep? A Glimpse of Current and Future Developments in Artificial Intelligence Henry Kautz Computer Science & Engineering.
CAP 252 Lecture Topic: Requirement Analysis Class Exercise: Use Cases.
Artificial Intelligence
CS 357 – Intro to Artificial Intelligence  Learn about AI, search techniques, planning, optimization of choice, logic, Bayesian probability theory, learning,
Introduction to Artificial Intelligence CSE 473 Winter 1999.
From Discrete Mathematics to AI applications: A progression path for an undergraduate program in math Abdul Huq Middle East College of Information Technology,
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
What is AI  An attempt to imitate human reactions by scripting reactions to happen when a certain cause is brought about.
Marakas: Decision Support Systems, 2nd Edition © 2003, Prentice-Hall Chapter Chapter 7: Expert Systems and Artificial Intelligence Decision Support.
3.11 Robotics, artificial intelligence and expert systems Strand 3 Karley Holland.
Biointelligence Laboratory School of Computer Science and Engineering Seoul National University Cognitive Robots © 2014, SNU CSE Biointelligence Lab.,
Artificial Intelligence Andrea Danyluk For FPS 2/2/04.
PROGRAMMING LANGUAGES The Study of Programming Languages.
Computers, Artificial Intelligence, & Robotics Erin Harris, Graduate Researcher Jerry B. Weinberg, Associate Professor Department of Computer Science.
1 Shawlands Academy Higher Computing Software Development Unit.
REU 2008-Building the First USF Small Size Robot Team Christopher HobbsMentor: Dr. Alfredo Weitzenfeld Department of Computer Science & Engineering Abstract.
Introduction (Chapter 1) CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Why Machine Intelligence is Very Hard Theo Pavlidis Distinguished Professor Emeritus Dept. of Computer Science
Artificial Intelligence (AI) Can Machines Think?.
Why General Artificial Intelligence (AI) is so Hard Theo Pavlidis Distinguished Professor Emeritus Dept. of Computer Science
Knowledge representation
Introduction GAM 376 Robin Burke Winter Outline Introductions Syllabus.
Artificial Intelligence: Prospects for the 21 st Century Henry Kautz Department of Computer Science University of Rochester.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
Artificial Intelligence
Artificial Intelligence CS 363 Kawther Abas Lecture 1 Introduction 5/4/1435.
CSE 219 Computer Science III Program Design Principles.
Instructor: Vincent Conitzer
Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.
Performance-Based Assessment Authentic Assessment
Graphical Models in Vision. Alan L. Yuille. UCLA. Dept. Statistics.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
1 CS 2710, ISSP 2610 Foundations of Artificial Intelligence introduction.
What is Real Now? Artificial Intelligence By Geena Yarbrough.
AI: Can Machines Think? Juntae Kim Department of Computer Engineering Dongguk University.
CS 127 Introduction to Computer Science. What is a computer?  “A machine that stores and manipulates information under the control of a changeable program”
ARTIFICIALINTELLIGENCE ARTIFICIAL INTELLIGENCE EXPERT SYSTEMS.
Introduction to Artificial Intelligence CS 438 Spring 2008.
FOUNDATIONS OF ARTIFICIAL INTELLIGENCE
ITEC 1010 Information and Organizations Chapter V Expert Systems.
Machine Learning BY UZMA TUFAIL MCS : section (E) ROLL NO: /31/2016.
Artificial Intelligence, simulation and modelling.
1 Artificial Intelligence & Prolog Programming CSL 302.
Chapter 9 : Application Areas. 2 Some Advance Application Areas of Computers  Software Development  Artificial Intelligence  Robotics  Industrial.
Lecture-6 Bscshelp.com. Todays Lecture  Which Kinds of Applications Are Targeted?  Business intelligence  Search engines.
The Game Development Process: Artificial Intelligence.
Decision Support and Business Intelligence Systems (9 th Ed., Prentice Hall) Chapter 12: Artificial Intelligence and Expert Systems.
Overview of Artificial Intelligence (1) Artificial intelligence (AI) Computers with the ability to mimic or duplicate the functions of the human brain.
Instructor: Vincent Conitzer
Application Areas of Artificial Intelligence(AI)
ARTIFICIAL INTELLIGENCE.
Course Instructor: knza ch
Artificial Intelligence Includes:
Introduction Artificial Intelligent.
Why General Artificial Intelligence (AI) is so Hard
Integrating Deep Learning with Cyber Forensics
Artificial Intelligence
Artificial Intelligence Andrea Danyluk For FPS 2/2/04.
Presentation transcript:

Why Artificial Intelligence is Very Hard Theo Pavlidis Distinguished Professor Emeritus Stony Brook University

Sept. 2008T. Pavlidis2 What is Artificial Intelligence? A machine that replicates the functionality of the human brain. (General or Strong AI) “Around the Corner” since about A machine that does a specific task that traditionally has been done by humans. (Narrow or Weak AI). Each specific application is treated as an engineering problem. Numerous successes.

Sept. 2008T. Pavlidis3 Successes in Narrow AI (Seen in daily life) Restricted Speech Recognition (in Banking and Airline reservation systems, etc) Credit Card Fraud Detection Web Tools (Shopping Suggestions, Mechanical Translation, etc) Simple Robots (Roomba) 1D and 2D Bar Codes (in stores and in shipping)

Sept. 2008T. Pavlidis4 Successes in Narrow AI (Not Seen Everyday) Chess Playing Machines Optical Character Recognition Industrial Inspection Biometrics (Fingerprints, Iris, etc) Medical Diagnosis

Sept. 2008T. Pavlidis5 Restricted Speech Recognition Grammar driven models (using low level context) have been quite successful. High level context is even better. For example, matching a speech fragment to a name on a list. Successful applications include Airline reservation systems and Call Center monitoring. See a demonstration of using voice for web search in The system is a product of Nuance Open Voice Search and it relies on personalization.

Sept. 2008T. Pavlidis6 Web Shopping: Learning User Preferences

Sept. 2008T. Pavlidis7 Household Robot

Sept. 2008T. Pavlidis8 Making Reading Easy for Computers Bar codes and two-dimensional symbologies are much easier to read than text because: –They are formally defined. –They include well-defined error detection or, in some cases, error correction codes thus providing their own context.

Sept. 2008T. Pavlidis9 Examples of Two-Dimensional Symbologies Maxicode (UPS) PDF417 (Fed Ex, DMV)

Sept. 2008T. Pavlidis10 Chess Playing Machines - 1 Chess is a deterministic game, so a computer could derive a winning solution analytically. However the number of all possible positions is so large ( ) that using even the fastest available computer it will take billions of years to consider all possible moves. Skilled players may look at 20 moves ahead by pruning, i.e. ignoring non-promising moves.

Sept. 2008T. Pavlidis11 Chess Playing Machines - 2 Around 1980 Ken Thompson developed a chess playing program called Belle based on a minicomputer with a hardware attachment used to generate moves very fast. Belle defeated all other computer programs and became the world champion. The use of special chess knowledge and special purpose hardware became the preferred approach since then.

Sept. 2008T. Pavlidis12 Deep Blue (The IBM machine that beat the human world champion) A major focus of the effort was the development of special purpose hardware. An expert chess player (Murray Campbell ) contributed the evaluation functions of the moves generated by the hardware. The project had as a consultant an international grandmaster (Joel Benjamin who had played Kasparov to a draw in 1994).

Sept. 2008T. Pavlidis13 Optical Character Recognition (OCR) Printed text characters have small shape variability and high contrast with the background. Spelling checkers (or ZIP code directories in postal applications) introduce low level context. Reading of the checks sent for payment to American Express relies heavily on context. –Payments are supposed to be in full and the amount due is known, so the number written on a check is analyzed to confirm whether it matches the amount due or not

Sept. 2008T. Pavlidis14 An Aside: Why did OCR mature when the need for it was diminished? The algorithms used in the products of the 1990s were known earlier but they were too complex to be implemented effectively with the digital technology of earlier times. When computer hardware became cheap enough for good OCR, it also became cheap enough for PCs, the Internet, and direct bank transfers. Keep this in mind in your business plans!

Sept. 2008T. Pavlidis15 Features of Narrow AI Each Problem is Solved Separately even though certain common mathematical tools may be used (statistics, graph theory, signal processing, etc). Each Solution Relies Heavily on Specific Environment Constraints and performance (compared to that of humans) drops when these constraints are relaxed.

Sept. 2008T. Pavlidis16 Why Not General AI? Why “waste” time with all the special cases and not solve the general problem once for all? Why not use a “brain model” to solve all these problems? Are advances in general computer technology (hardware, systems) likely to help? Why not wait for them rather than solving problems piecemeal?

Sept. 2008T. Pavlidis17 Humans may be machines, but they are very different from computers

Sept. 2008T. Pavlidis18 Some Experiments

Sept. 2008T. Pavlidis19 Can you read these words?

Sept. 2008T. Pavlidis20 Can you read these words?

Sept. 2008T. Pavlidis21 Reading Demo - 1

Sept. 2008T. Pavlidis22 Reading Demo - 1 Tentative binding on the letter shapes (bottom up) is finalized once a word is recognized (top down). Word shape and meaning over-ride early cues.

Sept. 2008T. Pavlidis23 Reading Demo -2 New York State lacks proper facilities for the mentally III. The New York Jets won Superbowl III. Human readers may ignore entirely the shape of individual letters if they can infer the meaning through context.

Sept. 2008T. Pavlidis24 Reading dot-matrix print and fine laser print From: T. Pavlidis ``Context Dependent Shape Perception,''in Aspects of Visual Form Processing, (C. Arcelli, L. P. Cordella, and G. Sanniti di Baja, eds.) World Scientific, 1994, pp

Sept. 2008T. Pavlidis25 What Neuroscientist Say “Perceptions emerge as a result of reverberations of signals between different levels of the sensory hierarchy, indeed across different senses”. The author then goes on to criticize the view that “sensory processing involves a one-way cascade of information (processing)” Source: V.S. Ramachandran and S. Blakeslee Phantoms in the Brain, William Morrow and Company Inc., New York, 1998 (p. 56)

Sept. 2008T. Pavlidis26 The Importance of Context “Human intelligence almost always thrives on context while computers work on abstract numbers alone. … Independence from context is in fact a great strength of mathematics.” Source: Arno Penzias Ideas and Information, Norton, 1989, p. 49.

Sept. 2008T. Pavlidis27 The Big Difference Between Humans and Machines Humans (and animals) use prior knowledge to deal with sensory input. The process involves a complex of bottom-up and top- down processes. It is hard to develop algorithms for a barely understood process. Certainly, we cannot match human behavior by a machine, unless the machine has prior knowledge of its environment.

Sept. 2008T. Pavlidis28 The Big Obstacle to General AI We have too little knowledge of how the brain works, especially how context is inferred and brought into play. Adding more CPU power helps only if we understand the problem (as in the case of chess), so general advances in computing are not likely to help.

Sept. 2008T. Pavlidis29 Brain Models maybe Counter-productive Once we accept that humans and computers are fundamentally different machines we should not try to imitate the way humans solve a problem. We should attack problems in their own right given the nature of digital computers. Chess playing machines are a prime example.

Sept. 2008T. Pavlidis30 How to Choose a Problem to Work On Problem should be well defined in an algorithmic sense and context should be available. –For an example relying heavily on context see: In processing the input, it should be clear what kind of information we need to extract. (Mathematical model of the physical world must exist.) Do not be too concerned about limitations in present day computer power.

Sept. 2008T. Pavlidis31 Acknowledgements I want to thank Prof. Paul Pavlidis of the University of British Columbia for several constructive comments on an earlier draft of this presentation. The link to the speech recognition system of Nuance was provided by Prof. Amanda Stent of Stony Brook University.