1 Comparing Humans and AI Agents Javier Insa-Cabrera 1, David L. Dowe 2, Sergio España-Cubillo 1, M.Victoria Hernández-Lloreda 3, José Hernández Orallo.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

HOW DOES HUMAN-LIKE KNOWLEDGE COME INTO BEING IN ARTIFICIAL ASSOCIATIVE SYSTEMS? AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY Faculty of Electrical Engineering,
Chapter 6 The Structural Risk Minimization Principle Junping Zhang Intelligent Information Processing Laboratory, Fudan University.
SELBO Agent Ivan Minov University of Plovdiv “Paisii Hilendarski“
Lecture 13 Last time: Games, minimax, alpha-beta Today: Finish off games, summary.
1 Reinforcement Learning Introduction & Passive Learning Alan Fern * Based in part on slides by Daniel Weld.
IN SEARCH OF VALUE EQUILIBRIA By Christopher Kleven & Dustin Richwine xkcd.com.
Complexity 7-1 Complexity Andrei Bulatov Complexity of Problems.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Complexity 5-1 Complexity Andrei Bulatov Complexity of Problems.
Northwestern University Winter 2007 Machine Learning EECS Machine Learning Lecture 13: Computational Learning Theory.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 1 Introduction Jan Maluszynski, IDA, 2007
Hash Tables1 Part E Hash Tables  
A Finite Sample Upper Bound on the Generalization Error for Q-Learning S.A. Murphy Univ. of Michigan CALD: February, 2005.
Human Computation CSC4170 Web Intelligence and Social Computing Tutorial 7 Tutor: Tom Chao Zhou
CS6800 Advanced Theory of Computation Fall 2012 Vinay B Gavirangaswamy
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
On Roles of Models in Information Systems (Arne Sølvberg) Gustavo Carvalho 26 de Agosto de 2010.
1 USING EXPERT SYSTEMS TECHNOLOGY FOR STUDENT EVALUATION IN A WEB BASED EDUCATIONAL SYSTEM Ioannis Hatzilygeroudis, Panagiotis Chountis, Christos Giannoulis.
intelligence study and design of intelligent agentsis the intelligence of machines and the branch of computer science that aims to create it. AI textbooks.
Tennessee Technological University1 The Scientific Importance of Big Data Xia Li Tennessee Technological University.
Introduction Many decision making problems in real life
Sullivan – Fundamentals of Statistics – 2 nd Edition – Chapter 11 Section 1 – Slide 1 of 34 Chapter 11 Section 1 Random Variables.
5. Alternative Approaches. Strategic Bahavior in Business and Econ 1. Introduction 2. Individual Decision Making 3. Basic Topics in Game Theory 4. The.
Formalizing the Asynchronous Evolution of Architecture Patterns Workshop on Self-Organizing Software Architectures (SOAR’09) September 14 th 2009 – Cambrige.
Area/Sigma Notation Objective: To define area for plane regions with curvilinear boundaries. To use Sigma Notation to find areas.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
By: TARUN MEHROTRA 12MCMB11.  More time is spent maintaining existing software than in developing new code.  Resources in M=3*(Resources in D)  Metrics.
Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.
Javier Insa-Cabrera José Hernández-Orallo Dep. de Sistemes Informàtics i Computació, Universitat Politècnica de València
PROBABILISTIC COMPUTATION By Remanth Dabbati. INDEX  Probabilistic Turing Machine  Probabilistic Complexity Classes  Probabilistic Algorithms.
Turing Tests with Turing Machines José Hernández Orallo DSIC, Universitat Politecnica de Valencia, Spain Javier Insa Cabrera DSIC,
1 On more realistic environment distributions for defining, evaluating and developing intelligence José Hernández Orallo 1, David L. Dowe 2, Sergio España-Cubillo.
Chapter 5 Parameter estimation. What is sample inference? Distinguish between managerial & financial accounting. Understand how managers can use accounting.
ICNEE 2002 Applying RL to Take Pedagogical Decisions in Intelligent Tutoring Systems Ana Iglesias Maqueda Computer Science Department Carlos III of Madrid.
Evolving cooperation in one-time interactions with strangers Tags produce cooperation in the single round prisoner’s dilemma and it’s.
Umans Complexity Theory Lectures Lecture 1a: Problems and Languages.
It is Artificial Idiocy that is alarming, Not Artificial Intelligence David Sanders Reader – University of Portsmouth Senior Research Fellow – Royal Academy.
Fundamentals of Game Design by Ernest Adams and Andrew Rollings Chapter 1: Games and Video Games.
CSCI-383 Object-Oriented Programming & Design Lecture 10.
1 Turing Machines and Recursive Turing Tests José Hernández Orallo 1, Javier Insa-Cabrera 1, David L. Dowe 2, Bill Hibbard 3, 1.Departament de Sistemes.
Interaction settings for measuring (social) intelligence in multi-agent systems Javier Insa-Cabrera, José Hernández-Orallo Dep. de Sistemes Informàtics.
1 CHUKWUEMEKA DURUAMAKU.  Machine learning, a branch of artificial intelligence, concerns the construction and study of systems that can learn from data.
Beginning the Design Process. Next Generation Science / Common Core Standards Addressed! CCSS. Math. Content.HSN ‐ Q.A.1 Use units as a way to understand.
Keynote paper: Unlocking the learning value of wireless mobile devices Adviser: Ming-Puu Chen Presenter: Li-Chun Wang Roschelle, J. (2003). Keynote paper:
Introduction to HCI Lecture #1.
RULES Patty Nordstrom Hien Nguyen. "Cognitive Skills are Realized by Production Rules"
Reinforcement Learning AI – Week 22 Sub-symbolic AI Two: An Introduction to Reinforcement Learning Lee McCluskey, room 3/10
Area/Sigma Notation Objective: To define area for plane regions with curvilinear boundaries. To use Sigma Notation to find areas.
1 Section 13.1 Turing Machines A Turing machine (TM) is a simple computer that has an infinite amount of storage in the form of cells on an infinite tape.
1 Turing Machines and Equivalent Models Section 13.1 Turing Machines.
Organic Evolution and Problem Solving Je-Gun Joung.
Machine Learning Chapter 7. Computational Learning Theory Tom M. Mitchell.
Reinforcement Learning Guest Lecturer: Chengxiang Zhai Machine Learning December 6, 2001.
1 Artificial Intelligence & Prolog Programming CSL 302.
Overfitting, Bias/Variance tradeoff. 2 Content of the presentation Bias and variance definitions Parameters that influence bias and variance Bias and.
Area/Sigma Notation Objective: To define area for plane regions with curvilinear boundaries. To use Sigma Notation to find areas.
Towards a Universal Test of Social Intelligence PhD Thesis Javier Insa Cabrera Valencia, SpainMay 16, 2016 Supervisor: José Hernández Orallo.
Sub-fields of computer science. Sub-fields of computer science.
Functional Programming
Genetic Algorithm in TDR System
What is AI All About? What is AI All About?
A computational approximation to the AIXI model
Theory of Computation Turing Machines.
CASE − Cognitive Agents for Social Environments
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Stepping on Earth: A Roadmap for Data-driven Agent-Based Modelling
Artificial General Intelligence (AGI)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 7
Artificial General Intelligence (AGI)
Presentation transcript:

1 Comparing Humans and AI Agents Javier Insa-Cabrera 1, David L. Dowe 2, Sergio España-Cubillo 1, M.Victoria Hernández-Lloreda 3, José Hernández Orallo 1 1.Departament de Sistemes Informàtics i Computació, Universitat Politècnica de València, Spain. 2.Computer Science & Software Engineering, Clayton School of I.T., Monash University, Clayton, Victoria, 3800, Australia. 3.Departamento de Metodología de las Ciencias del Comportamiento, Universidad Complutense de Madrid, Spain AGI’ Mountain View, California, 3-7 August 2011

2 Outline Measuring intelligence universally Precedents Test setting and administration Agents and interfaces Results Discussion

Measuring intelligence universally 3 Project: anYnt (Anytime Universal Intelligence)  Any kind of system (biological, non-biological, human)  Any system now or in the future.  Any moment in its development (child, adult).  Any degree of intelligence.  Any speed.  Evaluation can be stopped at any time.  Can we construct a ‘universal’ intelligence test?

4  Imitation Game “Turing Test” (Turing 1950):  It is a test of humanity, and needs human intervention.  Not actually conceived to be a practical test for measuring intelligence up to and beyond human intelligence.  CAPTCHAs (von Ahn, Blum and Langford 2002):  Quick and practical, but strongly biased.  They evaluate specific tasks.  They are not conceived to evaluate intelligence, but to tell humans and machines apart at the current state of AI technology.  It is widely recognised that CAPTCHAs will not work in the future (they soon become obsolete). Precedents

5  Tests based on Kolmogorov Complexity (compression-extended Turing Tests, Dowe 1997a-b, 1998) (C-test, Hernandez-Orallo 1998).  Look like IQ tests, but formal and well-grounded.  Exercises (series) are not arbitrarily chosen.  They are drawn and constructed from a universal distribution, by setting several ‘levels’ for k: Precedents  However...  Some relatively simple algorithms perform well in IQ-like tests (Sanghi and Dowe 2003).  They are static (no planning abilities are required).

6  Universal Intelligence (Legg and Hutter 2007): an interactive extension to C-tests from sequences to environments. = performance over a universal distribution of environments.  Universal intelligence provides a definition which adds interaction and the notion of “planning” to the formula (so intelligence = learning + planning).  This makes this apparently different from an IQ (static) test. Precedents π μ riri oioi aiai

7  A definition of intelligence does not ensure an intelligence test.  Anytime Intelligence Test (Hernandez-Orallo and Dowe 2010):  An interactive setting following (Legg and Hutter 2007) which addresses:  Issues about the difficulty of environments.  The definition of discriminative environments.  Finite samples and (practical) finite interactions.  Time (speed) of agents and environments.  Reward aggregation, convergence issues.  Anytime and adaptive application.  An environment class  (Hernandez-Orallo 2010) (AGI-2010). Precedents In this work we perform an implementation of the test and we evaluate humans and a reinforcement learning algorithm with it, as a proof of concept.

Test setting and administration 8  Implementation of the environment class :  Spaces are defined as fully connected graphs.  Actions are the arrows in the graphs.  Observations are the ‘contents’ of each edge/cell in the graph.  Agents can perform actions inside the space.  Rewards:  Two special agents Good ( ⊕ ) and Evil ( ⊖ ), which are responsible for the rewards. Symmetric behaviour, to ensure balancedness.

9  We randomly generated only 7 environments for the test:  Different topologies and sizes for the patterns of the agents Good and Evil (which provide rewards).  Different lengths for each session (exercise) accordingly to the number of cells and the size of the patterns.  The goal was to allow for a feasible administration for humans in about minutes. Test setting and administration

10  An AI agent: Q-learning  A simple choice. A well-known algorithm.  A biological agent: humans  20 humans were used in the experiment  A specific interface was developed for them, while the rest of the setting was equal for both types of agents.  Agents and interfaces

11  Experiments were paired.  Results show that performance is fairly similar. Results

12  Analysis of the effect of complexity :  Complexity is approximated by using LZ (Lempel-Ziv) coding to the string which defines the environment. Results  Lower variance for exercises with higher complexity.  Slight inverse correlation with complexity ( difficulty , reward  ).

13  Not many studies comparing human performance and machine performance on non-specific tasks.  The environment class here has not been designed to be anthropomorphic.  The AI agent (Q-learning) has not been designed to address this problem.  The results are consistent with the C-test (Hernandez-Orallo 1998) and with the results in (Sanghi & Dowe 2003), where a simple algorithm is competitive in regular IQ tests. Discussion

14  The results show this is not a universal intelligence test.  The use of an interactive test has not changed the picture from the results in the C-test.  What may be wrong?  A problem of the current implementation. Many simplifications made.  A problem of the environment class. Both this and the C-test used an inappropriate reference machine.  A problem of the environment distribution.  A problem with the interfaces, making the problem very difficult for humans.  A problem of the theory.  Intelligence cannot be measured universally.  Intelligence is factorial. Test must account for more factors.  Using algorithmic information theory to precisely define and evaluate intelligence may be insufficient. Discussion

Thank you! Some pointers: Project: anYnt (Anytime Universal Intelligence) Have fun with the test