COMP3702/7702 Artificial Intelligence Week1: Introduction Russell & Norvig ch.1-2.3, Hanna Kurniawati

Size: px
Start display at page:

Download "COMP3702/7702 Artificial Intelligence Week1: Introduction Russell & Norvig ch.1-2.3, Hanna Kurniawati"

Transcription

1 COMP3702/7702 Artificial Intelligence Week1: Introduction Russell & Norvig ch.1-2.3, Hanna Kurniawati

2 Today } What is Artificial Intelligence? } Better know what it is first before committing the next 16 weeks of your life to it J } Some history } To predict the future } Agent defined } How to design an agent, so that we can program it } Properties of an agent } What representations & methods should be used, so that the agent can solve its problem(s) well? } Intro to Search } A way for an agent to solve its problem(s)

3 Today } What is Artificial Intelligence? } Better know what it is first before committing the next 16 weeks of your life to it J } Some history } To predict the future } Agent defined } How to design an agent, so that we can program it } Properties of an agent } What representations & methods should be used, so that the agent can solve its problem(s) well? } Intro to Search } A way for an agent to solve its problem(s)

4 What is Artificial Intelligence (AI)? } AI is an attempt to build intelligent computers. } What is intelligent? } Act like humans. } Think like humans. } Act rationally.

5 What is Artificial Intelligence (AI)? } AI is an attempt to build intelligent computers. } What is intelligent? } Act like humans. } Think like humans. } Act rationally.

6 Act like humans: Turing Test } An attempt to make intelligent machine less vague. } Goal: Test if a computer can fool humans into thinking that the computer is human. } The computer is asked questions by a human interrogator. It passes the test if the interrogator cannot tell whether the responses come from a human or a computer. } By Alan Turing in 1950.

7 Critique to Turing Test: The Chinese Room } Thought experiment by Searle } A person who only knows English is locked in a room with } Stack of papers containing Chinese symbols. } An instruction manual in English. } People outside the room send questions in Chinese. } Suppose by following the instruction manual, the man in the room can pass out Chinese symbols which are correct answers to the questions. } The person appears to know Chinese even though he is not.

8 Searle s point } No matter how intelligent the computer seems to be, if it does not understand the meaning of the symbols it process, it is not really intelligent.

9 Applications of Turing Test } Regardless of the philosophical debate, Turing s idea on trying to define (artificial) intelligence more concretely has yielded useful results. } Chatterbots: Eliza, A.L.I.C.E., automated online assistance, etc. } CAPTCHA: Completely Automated Public Turing test to tell Computers and Humans Apart. } Turing test, but the interrogator is a computer.

10 What is Artificial Intelligence (AI)? } AI is an attempt to build intelligent computers. } What is intelligent? } Act like humans. } Think like humans. } Act rationally.

11 Think like humans } Mimic the working of human brains. } Not just appear human. } To what level? } Very high level: vision, memory, } Neurons. But, people who study neurons still argue what neurons can and cannot do } Cognitive science & neuroscience.

12 What is Artificial Intelligence (AI)? } AI is an attempt to build intelligent computers. } What is intelligent? } Act like humans. } Think like humans. } Act rationally.

13 The question is } Do we really want computers to be exactly like humans? } How useful would a computer be if its shortcomings are exactly the same as our shortcomings?

14 Act rationally } Always make the best decision given the available resources (knowledge, time, computational power and memory). } Best: Maximize certain performance measure(s), usually represented as a utility function. } More on this throughout the semester.

15 What is Artificial Intelligence (AI)? } AI is an attempt to build intelligent computers. } What is intelligent? } Act like humans. } Think like humans. } Act rationally. } And many more

16 In this class, } We will take the act rationally view } We are interested to build systems (usually called agents) that behave rationally; systems that accomplish what it is supposed to do, well, given the available resources. } Don t worry about how close the systems resemble humans and about philosophical questions on what is intelligent. } We may use inspirations from humans / other intelligent beings.

17 Today What is Artificial Intelligence? Better know what it is first before committing the next 16 weeks of your life to it J } Some history } To predict the future } Agent defined } How to design an agent, so that we can program it } Properties of an agent } What representations & methods should be used, so that the agent can solve its problem(s) well? } Intro to Search } A way for an agent to solve its problem(s)

18 Some history } 1943: The beginning of neural network, started by McCulloch & Pitts. } 1950: Turing test introduced. } : The promise of AI. } 1956: The name Artificial Intelligence is coined by John McCarthy at the Dartmouth Conference. } : AI meets computational complexity. } : Development of expert systems. } : Expert systems industry booms. } : Expert systems industry busts.

19 Some history } 1988-now: Probability enters AI. Start of machine learning & soft computing. } 1995-now: Intelligent agents popularised. } 2000-now: AI is back } 2013-now: Rise of deep learning, Rush for AI in industry.

20 Of course, there s the debate

21 In the city,

22 In marine environments,

23 Today What is Artificial Intelligence? Better know what it is first before committing the next 16 weeks of your life to it J Some history To predict the future } Agent defined } How to design an agent, so that we can program it } Properties of an agent } What representations & methods should be used, so that the agent can solve its problem(s) well? } Intro to Search } A way for an agent to solve its problem(s)

24 In this class, } We will take the act rationally view } We are interested to build systems (usually called agents) that behave rationally; systems that accomplish what it is supposed to do, given the available resources. } Don t worry about how close the systems resemble humans and about philosophical questions on what is intelligent. } We may use inspirations from humans / other intelligent beings.

25 What is an agent? } A computer program that: } Gathers information about an environment, and } takes actions autonomously based on that information. } Examples: } A robot. } A web crawler. } A spam filter. Agent Percepts Action Environment This class: Focus on rational agents: Agents that act rationally.

26 Recall our goal: To build a rational agent } To achieve our goal, we need to define our agent in a way that we can program it. } So, more formal definition is needed. } The problem of defining a particular agent formally is usually called the agent design problem. } Basically, it s about defining the components of the agent, so that when the agent acts rationally, it will accomplish the task it is supposed to perform, well

27 Overview of a rational agent Percepts Agent Environment Action } An agent performs the ``best action in the environment, the environment generates a percept. The percept generated by the environment may depend on the sequence of actions the agent has done.

28 The components Agent Percepts Environment } A: Action space } The set of all actions the agent can do. } P: Percept space } The set of all things the agent can perceive in the world. } S: State space } Internal state of the agent & the environment that matters for the interaction between the agent & the environment. } World dynamics: T: S X A à S } Perception function: Z: S à P Action Model the relation between the agent & the world

29 The components } Recall: } Best action: The action that maximizes a given performance criteria. } A rational agent selects an action that it believes will maximize its performance criteria, given the available knowledge, time, & computational resources. } Utility function: A function that assigns a value to each state (or sequence of states or state-action or state-action-observation), to indicate the desirability of being in such a (sequence of) state with respect to the agent s task.

30 The components summarised } The first step in designing an agent is to set the following components: } Action space (A) } Percept space (O) } State space (S) } World dynamics (T: SXA à S) } Percept function (Z: S à O) } Can also maps from SXA } Utility function (U: S à real number) } Can also maps from SXA or SXAXS or SXAXO

31 The problem the agent should solve } Find a mapping from sequences of percepts to action P* à A that maximizes the utility function. } Given the sequences of percepts it has seen so far, what should the agent do next, so that the utility function can be maximized.

32 Wait } Isn t this just an optimization problem? } Yes. Well, most problems can be framed as optimization problems. } Real-world AI problems are usually hard optimization problems. } We ll see computational representations & techniques that utilizes the problem & environmental structures to make solving the problem more feasible.

33 Throughout the semester, we will see } Various computational representation of the components. } Various ways to represent the problem (i.e., the mapping from perceptions to actions). } Computational techniques that compute a good solution to the above problem, efficiently. } The suitable representations & techniques highly depend on properties of the environment & the agent s knowledge about the environment } More about this soon

34 Example: 8-puzzle } Action space (A) } Move the empty cell left (L), right (R), up (U), down (D). } Percept space (P) Initial state } The sequence of numbers in left-right and up-down direction, where the empty cell is marked with an underscore. } State space(s) } Same as P } World dynamics (T) } The change from one state to another, given a particular movement of the empty cell. } Can be represented as a table Goal state

35 Example: 8-puzzle } Percept function (Z) } Identity map } Utility function: } +1 for the goal state. } 0 for all other states.

36 Example: Tic Tac Toe An agent that plays Tic Tac Toe 1 time step = a single move by the agent & the opponent.

37 Example: Tic Tac Toe An agent that plays Tic Tac Toe } Action space (A) } Make a mark at cell-i. } But, may also need more details. Suppose we use a robot: } Moving the arm to a position where the robot can make a mark at the specified (x, y) position. } Moving the arm down. } Make a mark at (x, y) position. } In real-world problems, we need to decide the level of details to use. } Usually, depends on the task & computational resources. } In this example, we ll use the more abstract : } Don t worry about how the mark will be made. } Just on where to place the mark strategically, to win the game.

38 Example: Tic Tac Toe } Action space (A) } Make a mark at cell-i. } Percept space (P) } The position of the marks (the Xs & Os), e.g., ordering of Xs & Os if we read the cells top-down, left-right: In this example: X_X_OXOXO } Similar to the action space, there s different levels of abstractions we may need. If we use a robot: } Bitmap image. } In this example, we ll use the higher level abstraction.

39 Example: Tic Tac Toe } Action space (A) } Make a mark at cell-i. } Percept space (P) } The position of the marks (the Xs & Os). } State space (S) } All possible combinations of the marks positions. } World dynamics (T) } The change from a snapshot of the game to the next, given an action. } Percept function (Z) } In this case, the percept is exactly the same as the current state.

40 Example: Tic Tac Toe } Utility function: } 10 when we make a straight line. } -10 when the opponents make a straight line. } 0 for any other state

41 Key difficulty in designing an agent } Ensuring that the best sequence of actions for the agent (as defined by its components) is equivalent to the best way for the agent to accomplish its task. } Essentially, the same as the difficulties in almost any modelling problem: } Ensuring that the model is a faithful representation of the problem.

42 Today What is Artificial Intelligence? Better know what it is first before committing the next 16 weeks of your life to it J Some history To predict the future Agent defined How to design an agent, so that we can program it } Properties of an agent } What representations & methods should be used, so that the agent can solve its problem(s) well? } Intro to Search } A way for an agent to solve its problem(s)

43 Next week We ll look into different problem classes & methods for the agent to solve its problem Please review computational complexity: Check out resources page in the website

School of EECS Washington State University. Artificial Intelligence

School of EECS Washington State University. Artificial Intelligence School of EECS Washington State University 1 } Webpage: www.eecs.wsu.edu/~holder/courses/ai } Email (holder@wsu.edu) } Blackboard Learn (learn.wsu.edu) } mywsu (my.wsu.edu) 2 Readings: Chapter 1 3 } John

More information

Price: $25 (incl. T-Shirt, morning tea and lunch) Visit:

Price: $25 (incl. T-Shirt, morning tea and lunch) Visit: Three days of interesting talks & workshops from industry experts across Australia Explore new computing topics Network with students & employers in Brisbane Price: $25 (incl. T-Shirt, morning tea and

More information

COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati"

COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning  Hanna Kurniawati COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati" Last week" Main components of PRM" Collision check for a configuration"

More information

Lecture th January 2009 Fall 2008 Scribes: D. Widder, E. Widder Today s lecture topics

Lecture th January 2009 Fall 2008 Scribes: D. Widder, E. Widder Today s lecture topics 0368.4162: Introduction to Cryptography Ran Canetti Lecture 11 12th January 2009 Fall 2008 Scribes: D. Widder, E. Widder Today s lecture topics Introduction to cryptographic protocols Commitments 1 Cryptographic

More information

COMP3702/7702 Artificial Intelligence Lecture 11: Introduction to Machine Learning and Reinforcement Learning. Hanna Kurniawati

COMP3702/7702 Artificial Intelligence Lecture 11: Introduction to Machine Learning and Reinforcement Learning. Hanna Kurniawati COMP3702/7702 Artificial Intelligence Lecture 11: Introduction to Machine Learning and Reinforcement Learning Hanna Kurniawati Today } What is machine learning? } Where is it used? } Types of machine learning

More information

Limits of Computation

Limits of Computation The real danger is not that computers will begin to think like men, but that men will begin to think like computers Limits of Computation - Sydney J. Harris What makes you believe now that I am just talking

More information

Logic: Intro & Propositional Definite Clause Logic

Logic: Intro & Propositional Definite Clause Logic Logic: Intro & Propositional Definite Clause Logic Alan Mackworth UBC CS 322 Logic 1 February 27, 2013 P & M extbook 5.1 Lecture Overview Recap: CSP planning Intro to Logic Propositional Definite Clause

More information

CS 301. Lecture 18 Decidable languages. Stephen Checkoway. April 2, 2018

CS 301. Lecture 18 Decidable languages. Stephen Checkoway. April 2, 2018 CS 301 Lecture 18 Decidable languages Stephen Checkoway April 2, 2018 1 / 26 Decidable language Recall, a language A is decidable if there is some TM M that 1 recognizes A (i.e., L(M) = A), and 2 halts

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

Course 395: Machine Learning

Course 395: Machine Learning Course 395: Machine Learning Lecturers: Maja Pantic (maja@doc.ic.ac.uk) Stavros Petridis (sp104@doc.ic.ac.uk) Goal (Lectures): To present basic theoretical concepts and key algorithms that form the core

More information

CS 188: Artificial Intelligence Spring Today

CS 188: Artificial Intelligence Spring Today CS 188: Artificial Intelligence Spring 2006 Lecture 9: Naïve Bayes 2/14/2006 Dan Klein UC Berkeley Many slides from either Stuart Russell or Andrew Moore Bayes rule Today Expectations and utilities Naïve

More information

Short Course: Multiagent Systems. Multiagent Systems. Lecture 1: Basics Agents Environments. Reinforcement Learning. This course is about:

Short Course: Multiagent Systems. Multiagent Systems. Lecture 1: Basics Agents Environments. Reinforcement Learning. This course is about: Short Course: Multiagent Systems Lecture 1: Basics Agents Environments Reinforcement Learning Multiagent Systems This course is about: Agents: Sensing, reasoning, acting Multiagent Systems: Distributed

More information

Guest Speaker. CS 416 Artificial Intelligence. First-order logic. Diagnostic Rules. Causal Rules. Causal Rules. Page 1

Guest Speaker. CS 416 Artificial Intelligence. First-order logic. Diagnostic Rules. Causal Rules. Causal Rules. Page 1 Page 1 Guest Speaker CS 416 Artificial Intelligence Lecture 13 First-Order Logic Chapter 8 Topics in Optimal Control, Minimax Control, and Game Theory March 28 th, 2 p.m. OLS 005 Onesimo Hernandez-Lerma

More information

Marks. bonus points. } Assignment 1: Should be out this weekend. } Mid-term: Before the last lecture. } Mid-term deferred exam:

Marks. bonus points. } Assignment 1: Should be out this weekend. } Mid-term: Before the last lecture. } Mid-term deferred exam: Marks } Assignment 1: Should be out this weekend } All are marked, I m trying to tally them and perhaps add bonus points } Mid-term: Before the last lecture } Mid-term deferred exam: } This Saturday, 9am-10.30am,

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Intro to Learning Theory Date: 12/8/16

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Intro to Learning Theory Date: 12/8/16 600.463 Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Intro to Learning Theory Date: 12/8/16 25.1 Introduction Today we re going to talk about machine learning, but from an

More information

CS599 Lecture 1 Introduction To RL

CS599 Lecture 1 Introduction To RL CS599 Lecture 1 Introduction To RL Reinforcement Learning Introduction Learning from rewards Policies Value Functions Rewards Models of the Environment Exploitation vs. Exploration Dynamic Programming

More information

Last time: Summary. Last time: Summary

Last time: Summary. Last time: Summary 1 Last time: Summary Definition of AI? Turing Test? Intelligent Agents: Anything that can be viewed as perceiving its environment through sensors and acting upon that environment through its effectors

More information

CS 4700: Foundations of Artificial Intelligence

CS 4700: Foundations of Artificial Intelligence CS 4700: Foundations of Artificial Intelligence Prof. Bart Selman selman@cs.cornell.edu Machine Learning: Neural Networks R&N 18.7 Intro & perceptron learning 1 2 Neuron: How the brain works # neurons

More information

Solving with Absolute Value

Solving with Absolute Value Solving with Absolute Value Who knew two little lines could cause so much trouble? Ask someone to solve the equation 3x 2 = 7 and they ll say No problem! Add just two little lines, and ask them to solve

More information

de Blanc, Peter Ontological Crises in Artificial Agents Value Systems. The Singularity Institute, San Francisco, CA, May 19.

de Blanc, Peter Ontological Crises in Artificial Agents Value Systems. The Singularity Institute, San Francisco, CA, May 19. MIRI MACHINE INTELLIGENCE RESEARCH INSTITUTE Ontological Crises in Artificial Agents Value Systems Peter de Blanc Machine Intelligence Research Institute Abstract Decision-theoretic agents predict and

More information

Quantum Probability in Cognition. Ryan Weiss 11/28/2018

Quantum Probability in Cognition. Ryan Weiss 11/28/2018 Quantum Probability in Cognition Ryan Weiss 11/28/2018 Overview Introduction Classical vs Quantum Probability Brain Information Processing Decision Making Conclusion Introduction Quantum probability in

More information

Intelligent Systems and Control Prof. Laxmidhar Behera Indian Institute of Technology, Kanpur

Intelligent Systems and Control Prof. Laxmidhar Behera Indian Institute of Technology, Kanpur Intelligent Systems and Control Prof. Laxmidhar Behera Indian Institute of Technology, Kanpur Introduction I am Laxmidhar Behera, in Department of Electrical Engineering, IIT, Kanpur. I will be teaching

More information

Hypothesis testing I. - In particular, we are talking about statistical hypotheses. [get everyone s finger length!] n =

Hypothesis testing I. - In particular, we are talking about statistical hypotheses. [get everyone s finger length!] n = Hypothesis testing I I. What is hypothesis testing? [Note we re temporarily bouncing around in the book a lot! Things will settle down again in a week or so] - Exactly what it says. We develop a hypothesis,

More information

Brains and Computation

Brains and Computation 15-883: Computational Models of Neural Systems Lecture 1.1: Brains and Computation David S. Touretzky Computer Science Department Carnegie Mellon University 1 Models of the Nervous System Hydraulic network

More information

Finite Automata Part One

Finite Automata Part One Finite Automata Part One Computability Theory What problems can we solve with a computer? What problems can we solve with a computer? What kind of computer? Computers are Messy http://www.intel.com/design/intarch/prodbref/27273.htm

More information

Finite Automata Part One

Finite Automata Part One Finite Automata Part One Computability Theory What problems can we solve with a computer? What kind of computer? Computers are Messy http://www.intel.com/design/intarch/prodbref/27273.htm We need a simpler

More information

Probabilistic Graphical Models for Image Analysis - Lecture 1

Probabilistic Graphical Models for Image Analysis - Lecture 1 Probabilistic Graphical Models for Image Analysis - Lecture 1 Alexey Gronskiy, Stefan Bauer 21 September 2018 Max Planck ETH Center for Learning Systems Overview 1. Motivation - Why Graphical Models 2.

More information

IS-ZC444: ARTIFICIAL INTELLIGENCE

IS-ZC444: ARTIFICIAL INTELLIGENCE IS-ZC444: ARTIFICIAL INTELLIGENCE Lecture-07: Beyond Classical Search Dr. Kamlesh Tiwari Assistant Professor Department of Computer Science and Information Systems, BITS Pilani, Pilani, Jhunjhunu-333031,

More information

Shadows of the Mind. A Search for the Missing Science of Consciousness ROGER PENROSE. Rouse Ball Professor of Mathematics University of Oxford

Shadows of the Mind. A Search for the Missing Science of Consciousness ROGER PENROSE. Rouse Ball Professor of Mathematics University of Oxford Shadows of the Mind A Search for the Missing Science of Consciousness ROGER PENROSE Rouse Ball Professor of Mathematics University of Oxford Oxford New York Melbourne OXFORD UNIVERSITY PRESS 1994 CONTENTS

More information

Adversarial Sequence Prediction

Adversarial Sequence Prediction Adversarial Sequence Prediction Bill HIBBARD University of Wisconsin - Madison Abstract. Sequence prediction is a key component of intelligence. This can be extended to define a game between intelligent

More information

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma

More information

32. SOLVING LINEAR EQUATIONS IN ONE VARIABLE

32. SOLVING LINEAR EQUATIONS IN ONE VARIABLE get the complete book: /getfulltextfullbook.htm 32. SOLVING LINEAR EQUATIONS IN ONE VARIABLE classifying families of sentences In mathematics, it is common to group together sentences of the same type

More information

Artificial Neural Networks. Q550: Models in Cognitive Science Lecture 5

Artificial Neural Networks. Q550: Models in Cognitive Science Lecture 5 Artificial Neural Networks Q550: Models in Cognitive Science Lecture 5 "Intelligence is 10 million rules." --Doug Lenat The human brain has about 100 billion neurons. With an estimated average of one thousand

More information

POLYNOMIAL SPACE QSAT. Games. Polynomial space cont d

POLYNOMIAL SPACE QSAT. Games. Polynomial space cont d T-79.5103 / Autumn 2008 Polynomial Space 1 T-79.5103 / Autumn 2008 Polynomial Space 3 POLYNOMIAL SPACE Polynomial space cont d Polynomial space-bounded computation has a variety of alternative characterizations

More information

Algorithmic Game Theory. Alexander Skopalik

Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory Alexander Skopalik Today Course Mechanics & Overview Introduction into game theory and some examples Chapter 1: Selfish routing Alexander Skopalik Skopalik@mail.uni-paderborn.de

More information

CSE250A Fall 12: Discussion Week 9

CSE250A Fall 12: Discussion Week 9 CSE250A Fall 12: Discussion Week 9 Aditya Menon (akmenon@ucsd.edu) December 4, 2012 1 Schedule for today Recap of Markov Decision Processes. Examples: slot machines and maze traversal. Planning and learning.

More information

CS:4420 Artificial Intelligence

CS:4420 Artificial Intelligence CS:4420 rtificial Intelligence Spring 2018 Logical gents Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed by Stuart Russell

More information

Hestenes lectures, Part 5. Summer 1997 at ASU to 50 teachers in their 3 rd Modeling Workshop

Hestenes lectures, Part 5. Summer 1997 at ASU to 50 teachers in their 3 rd Modeling Workshop Hestenes lectures, Part 5. Summer 1997 at ASU to 50 teachers in their 3 rd Modeling Workshop WHAT DO WE TEACH? The question What do we teach? has to do with What do we want to learn? A common instructional

More information

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural

More information

Machine Learning Basics Lecture 3: Perceptron. Princeton University COS 495 Instructor: Yingyu Liang

Machine Learning Basics Lecture 3: Perceptron. Princeton University COS 495 Instructor: Yingyu Liang Machine Learning Basics Lecture 3: Perceptron Princeton University COS 495 Instructor: Yingyu Liang Perceptron Overview Previous lectures: (Principle for loss function) MLE to derive loss Example: linear

More information

1 Introduction 2. 4 Q-Learning The Q-value The Temporal Difference The whole Q-Learning process... 5

1 Introduction 2. 4 Q-Learning The Q-value The Temporal Difference The whole Q-Learning process... 5 Table of contents 1 Introduction 2 2 Markov Decision Processes 2 3 Future Cumulative Reward 3 4 Q-Learning 4 4.1 The Q-value.............................................. 4 4.2 The Temporal Difference.......................................

More information

AN INTRODUCTION TO NEURAL NETWORKS. Scott Kuindersma November 12, 2009

AN INTRODUCTION TO NEURAL NETWORKS. Scott Kuindersma November 12, 2009 AN INTRODUCTION TO NEURAL NETWORKS Scott Kuindersma November 12, 2009 SUPERVISED LEARNING We are given some training data: We must learn a function If y is discrete, we call it classification If it is

More information

CSE 311: Foundations of Computing I. Lecture 1: Propositional Logic

CSE 311: Foundations of Computing I. Lecture 1: Propositional Logic CSE 311: Foundations of Computing I Lecture 1: Propositional Logic About CSE 311 Some Perspective Computer Science and Engineering Programming CSE 14x Theory Hardware CSE 311 About the Course We will study

More information

Markov Models and Reinforcement Learning. Stephen G. Ware CSCI 4525 / 5525

Markov Models and Reinforcement Learning. Stephen G. Ware CSCI 4525 / 5525 Markov Models and Reinforcement Learning Stephen G. Ware CSCI 4525 / 5525 Camera Vacuum World (CVW) 2 discrete rooms with cameras that detect dirt. A mobile robot with a vacuum. The goal is to ensure both

More information

Parts 3-6 are EXAMPLES for cse634

Parts 3-6 are EXAMPLES for cse634 1 Parts 3-6 are EXAMPLES for cse634 FINAL TEST CSE 352 ARTIFICIAL INTELLIGENCE Fall 2008 There are 6 pages in this exam. Please make sure you have all of them INTRODUCTION Philosophical AI Questions Q1.

More information

The Ultimate Guide To Chatbots For Businesses ONLIM 2018

The Ultimate Guide To Chatbots For Businesses ONLIM 2018 The Ultimate Guide To Chatbots For Businesses O N L I M 2 0 1 8 Where We're At Today Y o u ve probably heard a lot a b o u t c h a t b o t s d u r i n g 2 0 1 7. The l a s t y e a r h a s s h o w n u s

More information

Neural Networks 2. 2 Receptive fields and dealing with image inputs

Neural Networks 2. 2 Receptive fields and dealing with image inputs CS 446 Machine Learning Fall 2016 Oct 04, 2016 Neural Networks 2 Professor: Dan Roth Scribe: C. Cheng, C. Cervantes Overview Convolutional Neural Networks Recurrent Neural Networks 1 Introduction There

More information

Probability, Statistics, and Bayes Theorem Session 3

Probability, Statistics, and Bayes Theorem Session 3 Probability, Statistics, and Bayes Theorem Session 3 1 Introduction Now that we know what Bayes Theorem is, we want to explore some of the ways that it can be used in real-life situations. Often the results

More information

2. Introduction to commutative rings (continued)

2. Introduction to commutative rings (continued) 2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of

More information

CMSC 421: Neural Computation. Applications of Neural Networks

CMSC 421: Neural Computation. Applications of Neural Networks CMSC 42: Neural Computation definition synonyms neural networks artificial neural networks neural modeling connectionist models parallel distributed processing AI perspective Applications of Neural Networks

More information

Reification of Boolean Logic

Reification of Boolean Logic 526 U1180 neural networks 1 Chapter 1 Reification of Boolean Logic The modern era of neural networks began with the pioneer work of McCulloch and Pitts (1943). McCulloch was a psychiatrist and neuroanatomist;

More information

We set up the basic model of two-sided, one-to-one matching

We set up the basic model of two-sided, one-to-one matching Econ 805 Advanced Micro Theory I Dan Quint Fall 2009 Lecture 18 To recap Tuesday: We set up the basic model of two-sided, one-to-one matching Two finite populations, call them Men and Women, who want to

More information

Outline. Definition of AI AI history Learning. Neural Network

Outline. Definition of AI AI history Learning. Neural Network Artificial Intelligence An Introduction Outline Definition of AI AI history Learning Q-learning Neural Network Genetic Algorithm What is AI Thought Systems that Systems that process and think like humans

More information

The P-vs-NP problem. Andrés E. Caicedo. September 10, 2011

The P-vs-NP problem. Andrés E. Caicedo. September 10, 2011 The P-vs-NP problem Andrés E. Caicedo September 10, 2011 This note is based on lecture notes for the Caltech course Math 6c, prepared with A. Kechris and M. Shulman. 1 Decision problems Consider a finite

More information

COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning

COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms

More information

Lecture 2 - Length Contraction

Lecture 2 - Length Contraction Lecture 2 - Length Contraction A Puzzle We are all aware that if you jump to the right, your reflection in the mirror will jump left. But if you raise your hand up, your reflection will also raise its

More information

The Euler Method for the Initial Value Problem

The Euler Method for the Initial Value Problem The Euler Method for the Initial Value Problem http://people.sc.fsu.edu/ jburkardt/isc/week10 lecture 18.pdf... ISC3313: Introduction to Scientific Computing with C++ Summer Semester 2011... John Burkardt

More information

Linear Classification: Perceptron

Linear Classification: Perceptron Linear Classification: Perceptron Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong 1 / 18 Y Tao Linear Classification: Perceptron In this lecture, we will consider

More information

Why on earth did you do that?!

Why on earth did you do that?! Why on earth did you do that?! A simple model of obfuscation-based choice Caspar 9-5-2018 Chorus http://behave.tbm.tudelft.nl/ Delft University of Technology Challenge the future Background: models of

More information

Uncertainty. Michael Peters December 27, 2013

Uncertainty. Michael Peters December 27, 2013 Uncertainty Michael Peters December 27, 20 Lotteries In many problems in economics, people are forced to make decisions without knowing exactly what the consequences will be. For example, when you buy

More information

CS 4700: Foundations of Artificial Intelligence

CS 4700: Foundations of Artificial Intelligence CS 4700: Foundations of Artificial Intelligence Prof. Bart Selman selman@cs.cornell.edu Machine Learning: Neural Networks R&N 18.7 Intro & perceptron learning 1 2 Neuron: How the brain works # neurons

More information

CS 361: Probability & Statistics

CS 361: Probability & Statistics February 19, 2018 CS 361: Probability & Statistics Random variables Markov s inequality This theorem says that for any random variable X and any value a, we have A random variable is unlikely to have an

More information

Classification with Perceptrons. Reading:

Classification with Perceptrons. Reading: Classification with Perceptrons Reading: Chapters 1-3 of Michael Nielsen's online book on neural networks covers the basics of perceptrons and multilayer neural networks We will cover material in Chapters

More information

Week 2: Defining Computation

Week 2: Defining Computation Computational Complexity Theory Summer HSSP 2018 Week 2: Defining Computation Dylan Hendrickson MIT Educational Studies Program 2.1 Turing Machines Turing machines provide a simple, clearly defined way

More information

CSC321 Lecture 16: ResNets and Attention

CSC321 Lecture 16: ResNets and Attention CSC321 Lecture 16: ResNets and Attention Roger Grosse Roger Grosse CSC321 Lecture 16: ResNets and Attention 1 / 24 Overview Two topics for today: Topic 1: Deep Residual Networks (ResNets) This is the state-of-the

More information

Limits of Computation. Antonina Kolokolova

Limits of Computation. Antonina Kolokolova Limits of Computation Antonina Kolokolova What is computation? What is information? What is learning? Are there any limits of our ability to solve problems? Theoretical Computer Science Is there a perfect

More information

Introduction to Machine Learning CMU-10701

Introduction to Machine Learning CMU-10701 Introduction to Machine Learning CMU-10701 2. MLE, MAP, Bayes classification Barnabás Póczos & Aarti Singh 2014 Spring Administration http://www.cs.cmu.edu/~aarti/class/10701_spring14/index.html Blackboard

More information

Algebra: Linear UNIT 16 Equations Lesson Plan 1

Algebra: Linear UNIT 16 Equations Lesson Plan 1 1A UNIT 16 Equations Lesson Plan 1 Introduction to coding T: Today we're going to code and decode letters and numbers. OS 16.1 T: What can you see on the OHP? (A circle with letters in it) T: How is it

More information

CSE 105 Theory of Computation

CSE 105 Theory of Computation CSE 105 Theory of Computation http://www.jflap.org/jflaptmp/ Professor Jeanne Ferrante 1 Today s Agenda Quick Review of CFG s and PDA s Introduction to Turing Machines and their Languages Reminders and

More information

Temporal Difference Learning & Policy Iteration

Temporal Difference Learning & Policy Iteration Temporal Difference Learning & Policy Iteration Advanced Topics in Reinforcement Learning Seminar WS 15/16 ±0 ±0 +1 by Tobias Joppen 03.11.2015 Fachbereich Informatik Knowledge Engineering Group Prof.

More information

Questioning Question Answering Answers

Questioning Question Answering Answers Questioning Question Answering Answers Sameer Singh University of California, Irvine Questioning Question Answering Answers Sameer Singh University of California, Irvine QA Systems are really good! Is

More information

Lecture 14, Thurs March 2: Nonlocal Games

Lecture 14, Thurs March 2: Nonlocal Games Lecture 14, Thurs March 2: Nonlocal Games Last time we talked about the CHSH Game, and how no classical strategy lets Alice and Bob win it more than 75% of the time. Today we ll see how, by using entanglement,

More information

Neural Networks for Machine Learning. Lecture 2a An overview of the main types of neural network architecture

Neural Networks for Machine Learning. Lecture 2a An overview of the main types of neural network architecture Neural Networks for Machine Learning Lecture 2a An overview of the main types of neural network architecture Geoffrey Hinton with Nitish Srivastava Kevin Swersky Feed-forward neural networks These are

More information

There Is Therefore Now No Condemnation Romans 8:1-12

There Is Therefore Now No Condemnation Romans 8:1-12 Lesson 314 There Is Therefore Now No Condemnation Romans 8:1-12 MEMORY VERSE ROMAN S 8:1 There is therefore now no c ondem nation to those w ho are in Christ Jesus, who do not walk according to the flesh,

More information

CS 188: Artificial Intelligence Fall 2011

CS 188: Artificial Intelligence Fall 2011 CS 188: Artificial Intelligence Fall 2011 Lecture 22: Perceptrons and More! 11/15/2011 Dan Klein UC Berkeley Errors, and What to Do Examples of errors Dear GlobalSCAPE Customer, GlobalSCAPE has partnered

More information

Lecture: Face Recognition

Lecture: Face Recognition Lecture: Face Recognition Juan Carlos Niebles and Ranjay Krishna Stanford Vision and Learning Lab Lecture 12-1 What we will learn today Introduction to face recognition The Eigenfaces Algorithm Linear

More information

How generative models develop in predictive processing

How generative models develop in predictive processing Faculty of Social Sciences Bachelor Artificial Intelligence Academic year 2016-2017 Date: 18 June 2017 How generative models develop in predictive processing Bachelor s Thesis Artificial Intelligence Author:

More information

Errors, and What to Do. CS 188: Artificial Intelligence Fall What to Do About Errors. Later On. Some (Simplified) Biology

Errors, and What to Do. CS 188: Artificial Intelligence Fall What to Do About Errors. Later On. Some (Simplified) Biology CS 188: Artificial Intelligence Fall 2011 Lecture 22: Perceptrons and More! 11/15/2011 Dan Klein UC Berkeley Errors, and What to Do Examples of errors Dear GlobalSCAPE Customer, GlobalSCAPE has partnered

More information

15. NUMBERS HAVE LOTS OF DIFFERENT NAMES!

15. NUMBERS HAVE LOTS OF DIFFERENT NAMES! 5 NUMBERS HAVE LOTS OF DIFFERENT NAMES! a fun type of game with numbers one such game playing the game: 3 pets There are lots of number games that can make you look clairvoyant One such game goes something

More information

COMP304 Introduction to Neural Networks based on slides by:

COMP304 Introduction to Neural Networks based on slides by: COMP34 Introduction to Neural Networks based on slides by: Christian Borgelt http://www.borgelt.net/ Christian Borgelt Introduction to Neural Networks Motivation: Why (Artificial) Neural Networks? (Neuro-)Biology

More information

Math 308 Midterm Answers and Comments July 18, Part A. Short answer questions

Math 308 Midterm Answers and Comments July 18, Part A. Short answer questions Math 308 Midterm Answers and Comments July 18, 2011 Part A. Short answer questions (1) Compute the determinant of the matrix a 3 3 1 1 2. 1 a 3 The determinant is 2a 2 12. Comments: Everyone seemed to

More information

An Algorithms-based Intro to Machine Learning

An Algorithms-based Intro to Machine Learning CMU 15451 lecture 12/08/11 An Algorithmsbased Intro to Machine Learning Plan for today Machine Learning intro: models and basic issues An interesting algorithm for combining expert advice Avrim Blum [Based

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction Symbolical artificial intelligence is a field of computer science that is highly related to quantum computation. At first glance, this statement appears to be a contradiction. However,

More information

Introduction to Algebra: The First Week

Introduction to Algebra: The First Week Introduction to Algebra: The First Week Background: According to the thermostat on the wall, the temperature in the classroom right now is 72 degrees Fahrenheit. I want to write to my friend in Europe,

More information

Artificial Intelligence. 3 Problem Complexity. Prof. Dr. Jana Koehler Fall 2016 HSLU - JK

Artificial Intelligence. 3 Problem Complexity. Prof. Dr. Jana Koehler Fall 2016 HSLU - JK Artificial Intelligence 3 Problem Complexity Prof. Dr. Jana Koehler Fall 2016 Agenda Computability and Turing Machines Tractable and Intractable Problems P vs. NP Decision Problems Optimization problems

More information

Grundlagen der Künstlichen Intelligenz

Grundlagen der Künstlichen Intelligenz Grundlagen der Künstlichen Intelligenz Formal models of interaction Daniel Hennes 27.11.2017 (WS 2017/18) University Stuttgart - IPVS - Machine Learning & Robotics 1 Today Taxonomy of domains Models of

More information

CS 570: Machine Learning Seminar. Fall 2016

CS 570: Machine Learning Seminar. Fall 2016 CS 570: Machine Learning Seminar Fall 2016 Class Information Class web page: http://web.cecs.pdx.edu/~mm/mlseminar2016-2017/fall2016/ Class mailing list: cs570@cs.pdx.edu My office hours: T,Th, 2-3pm or

More information

Announcements. Problem Set Four due Thursday at 7:00PM (right before the midterm).

Announcements. Problem Set Four due Thursday at 7:00PM (right before the midterm). Finite Automata Announcements Problem Set Four due Thursday at 7:PM (right before the midterm). Stop by OH with questions! Email cs3@cs.stanford.edu with questions! Review session tonight, 7PM until whenever

More information

Theory of Computation

Theory of Computation Theory of Computation Lecture #2 Sarmad Abbasi Virtual University Sarmad Abbasi (Virtual University) Theory of Computation 1 / 1 Lecture 2: Overview Recall some basic definitions from Automata Theory.

More information

Machine Learning. Neural Networks

Machine Learning. Neural Networks Machine Learning Neural Networks Bryan Pardo, Northwestern University, Machine Learning EECS 349 Fall 2007 Biological Analogy Bryan Pardo, Northwestern University, Machine Learning EECS 349 Fall 2007 THE

More information

Introduction to Deep Learning

Introduction to Deep Learning Introduction to Deep Learning A. G. Schwing & S. Fidler University of Toronto, 2014 A. G. Schwing & S. Fidler (UofT) CSC420: Intro to Image Understanding 2014 1 / 35 Outline 1 Universality of Neural Networks

More information

CSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010

CSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010 CSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010 Computational complexity studies the amount of resources necessary to perform given computations.

More information

Announcements. CS 188: Artificial Intelligence Spring Mini-Contest Winners. Today. GamesCrafters. Adversarial Games

Announcements. CS 188: Artificial Intelligence Spring Mini-Contest Winners. Today. GamesCrafters. Adversarial Games CS 188: Artificial Intelligence Spring 2009 Lecture 7: Expectimax Search 2/10/2009 John DeNero UC Berkeley Slides adapted from Dan Klein, Stuart Russell or Andrew Moore Announcements Written Assignment

More information

CHAPTER 7: RATIONAL AND IRRATIONAL NUMBERS (3 WEEKS)...

CHAPTER 7: RATIONAL AND IRRATIONAL NUMBERS (3 WEEKS)... Table of Contents CHAPTER 7: RATIONAL AND IRRATIONAL NUMBERS (3 WEEKS)... 20 7.0 ANCHOR PROBLEM: ZOOMING IN ON THE NUMBER LINE... 24 SECTION 7.1: REPRESENT NUMBERS GEOMETRICALLY... 26 7.1a Class Activity:

More information

Gentle Introduction to Infinite Gaussian Mixture Modeling

Gentle Introduction to Infinite Gaussian Mixture Modeling Gentle Introduction to Infinite Gaussian Mixture Modeling with an application in neuroscience By Frank Wood Rasmussen, NIPS 1999 Neuroscience Application: Spike Sorting Important in neuroscience and for

More information

Lecture 14: Secure Multiparty Computation

Lecture 14: Secure Multiparty Computation 600.641 Special Topics in Theoretical Cryptography 3/20/2007 Lecture 14: Secure Multiparty Computation Instructor: Susan Hohenberger Scribe: Adam McKibben 1 Overview Suppose a group of people want to determine

More information

Why on earth did you do that?!

Why on earth did you do that?! Why on earth did you do that?! A formal model of obfuscation-based choice Caspar 5-4-218 Chorus http://behave.tbm.tudelft.nl/ Delft University of Technology Challenge the future Background: models of decision-making

More information

Languages, regular languages, finite automata

Languages, regular languages, finite automata Notes on Computer Theory Last updated: January, 2018 Languages, regular languages, finite automata Content largely taken from Richards [1] and Sipser [2] 1 Languages An alphabet is a finite set of characters,

More information

30. TRANSFORMING TOOL #1 (the Addition Property of Equality)

30. TRANSFORMING TOOL #1 (the Addition Property of Equality) 30 TRANSFORMING TOOL #1 (the Addition Property of Equality) sentences that look different, but always have the same truth values What can you DO to a sentence that will make it LOOK different, but not

More information