0% found this document useful (0 votes)
8 views

Lecture 1

CMPT 310 is an introductory course on Artificial Intelligence, taught by Steven Bergner at Simon Fraser University. The course covers the definition of AI, its history, decision-making processes, and applications in various fields such as natural language processing and robotics. Students will learn about rational agents, utility maximization, and the course includes assignments, exams, and recommended readings.

Uploaded by

nomorebluepen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views

Lecture 1

CMPT 310 is an introductory course on Artificial Intelligence, taught by Steven Bergner at Simon Fraser University. The course covers the definition of AI, its history, decision-making processes, and applications in various fields such as natural language processing and robotics. Students will learn about rational agents, utility maximization, and the course includes assignments, exams, and recommended readings.

Uploaded by

nomorebluepen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 40

CMPT 310: Artificial Intelligence

Introduction

Instructor: Steven Bergner


Simon Fraser University
(slides adapted from UC Berkeley CS188 slides)
AI
Today
o What is artificial intelligence?
o Where did it come
from/What can AI do?
o What should we and shouldn’t
we worry about?
o Course Logistics
o Utilities and Rationality
What is AI?
The science of making machines that:

Think like people Think rationally

Think like people Think rationally


Act rationally
Act like people

Act like people Act rationally


Rational Decisions
We’ll use the term rational in a very specific, technical way:
§ Rational: maximally achieving pre-defined goals
§ Rationality only concerns what decisions are made
(not the thought process behind them)
§ Goals are expressed in terms of the utility of outcomes
§ Being rational means maximizing your expected utility

A better title for this course would be:


Computational Rationality
Maximize Your
Expected Utility
Maximize Your
Expected Utility
Maximize Your
Expected Utility
Maximize Your
Expected Utility
Maximize Your
Expected Utility
What About the Brain?
§ Brains (human minds) are very
good at making rational decisions,
but not perfect
§ Brains aren’t as modular as
software, so hard to reverse
engineer!
§ “Brains are to intelligence as
wings are to flight”
§ Lessons learned from the brain:
memory and simulation are key to
decision making
Course Topics
o Part 1: Making Decisions
o Fast search/planning
o Constraint satisfaction (e.g. scheduling)
o Adversarial and uncertain search (e.g. routing, navigation)
o Part 2: Intelligence from Data
o Probabilistic inference with Bayes’ nets (e.g. robot localization)
o Decision theory
o Supervised machine learning (e.g. spam detection)
o Throughout: Applications
o Natural language, vision, robotics, games, etc.
A (Short) History of AI
A (Short) History of AI
o 1940-1950: Early days
o 1943: McCulloch & Pitts: Boolean circuit model of brain
o 1950: Turing's “Computing Machinery and Intelligence”
o 1950—70: Excitement: Look, Ma, no hands!
o 1950s: Early AI programs, including Samuel's checkers
program, Newell & Simon's Logic Theorist, Gelernter's
Geometry Engine
o 1956: Dartmouth meeting: “Artificial Intelligence” adopted
o 1965: Robinson's complete algorithm for logical reasoning
o 1970—90: Knowledge-based approaches
o 1969—79: Early development of knowledge-based systems
o 1980—88: Expert systems industry booms
o 1988—93: Expert systems industry busts: “AI Winter”
o 1990—: Statistical approaches
o Resurgence of probability, focus on uncertainty
o General increase in technical depth
o Agents and learning systems… “AI Spring”?

o 2000—: Where are we now?


What Can AI Do?
Quiz: Which of the following can be done at present?

o Play a decent game of Jeopardy?


o Win against any human at chess?
o Win against the best humans at Go?
o Play a decent game of tennis?
o Grab a particular cup and put it on a shelf?
o Unload any dishwasher in any home?
o Drive safely along the highway?
o Drive safely along Hastings Street?
o Buy a week's worth of groceries on the web?
o Buy a week's worth of groceries at Nesters Market?
o Discover and prove a new mathematical theorem?
o Perform a surgical operation?
o Unload a know dishwasher in collaboration with a person?
o Translate spoken Chinese into spoken English in real time?
o Write an intentionally funny story?
Unintentionally Funny Stories
o One day Joe Bear was hungry. He asked his friend
Irving Bird where some honey was. Irving told him
there was a beehive in the oak tree. Joe walked to
the oak tree. He ate the beehive. The End.
o Henry Squirrel was thirsty. He walked over to the
river bank where his good friend Bill Bird was sitting.
Henry slipped and fell in the river. Gravity drowned.
The End.

o Once upon a time there was a dishonest fox and a vain crow. One day
the crow was sitting in his tree, holding a piece of cheese in his mouth.
He noticed that he was holding the piece of cheese. He became hungry,
and swallowed the cheese. The fox walked over to the crow. The End.
[Shank, Tale-Spin System, 1984]
Natural Language
o Speech technologies (e.g. Siri)
o Automatic speech recognition (ASR)
o Text-to-speech synthesis (TTS)
o Dialog systems

o Language processing technologies


o Question answering
o Machine translation

o Web search
o Text classification, spam filtering, etc…
Computer Vision
Tools for Predictions & Decisions
Game Agents
o Classic Moment: May, '97: Deep Blue vs. Kasparov
o First match won against world champion
o “Intelligent creative” play
o 200 million board positions per second
o Humans understood 99.9 of Deep Blue's moves
o Can do about the same now with a PC cluster

o 1996: Kasparov Beats Deep Blue


“I could feel --- I could smell --- a new kind of intelligence across the table.”
o 1997: Deep Blue Beats Kasparov
“Deep Blue hasn't proven anything.”

Text from Bart Selman, image from IBM’s Deep Blue pages
Game Agents
o Reinforcement learning
Simulated Agents

[Schulman, Moritz, Levine, Jordan, Abbeel, ICLR 2016]


Game Agents
o Reinforcement learning

Pong Enduro Beamrider Q*bert


Robotics
o Robotics
o Part mech. eng.
o Part AI
o Reality much
harder than
simulations!

o Technologies
o Vehicles
o Rescue
o Help in the home
o Lots of automation…

o In this class:
o We ignore mechanical aspects
o Methods for planning
o Methods for control
Robots
Robots

[Levine*, Finn*, Darrell, Abbeel, JMLR 2016]


Utility?

Clear utility function Not so clear utility function


Designing Rational Agents

o An agent is an entity that perceives and acts.


o A rational agent selects actions that maximize
its (expected) utility.
o Characteristics of the percepts, environment,
and action space dictate techniques for selecting
rational actions
o This course is about:
o General AI techniques for a variety of

Environment
problem types Sensors
Percepts

Agent
o Learning to recognize when and how a new
problem can be solved with an existing ?
technique
Actuators
Actions
Pac-Man as an Agent

Agent Environment
Sensors
Percepts
?
Actuators Actions

Pac-Man is a registered trademark of Namco-Bandai Games, used here for educational purposes Demo1: pacman-l1.mp4
Instructor
Steven Bergner
o Webpage:
https://www.sfu.ca/computing/people/faculty/stevenbergner.html
o Email
o Instructional team: [email protected]
o Direct: [email protected]
o Research interests
o Machine learning, Computer Vision, Signal Processing
o Human-machine interaction, Scientific Visualization
o Big Data & Data Science
Links
o Website: https://coursys.sfu.ca/2023fa-cmpt-310-d1/pages/
o Piazza: https://piazza.com/sfu.ca/fall2023/cmpt310d100
Grading
o 10% * 4 Assignments
o 25% Midterm exam (in-class)
o 35% Final exam
Textbook
o Not required, but for students who want to
read more we recommend
o Russell & Norvig, AI: A Modern Approach

o Warning: Not a course textbook, so our


presentation does not necessarily follow the
presentation in the book.

You might also like