CSE 571: Artificial Intelligence Instructor: Subbarao Kambhampati Homepage:

Slides:



Advertisements
Similar presentations
2k-p Fractional Factorial Designs
Advertisements

Chapter 16 Unemployment: Search and Efficiency Wages.
1 Knowledge Representation Introduction KR and Logic.
1 Knowledge and reasoning – second part Knowledge representation Logic and representation Propositional (Boolean) logic Normal forms Inference in propositional.
1 MPE and Partial Inversion in Lifted Probabilistic Variable Elimination Rodrigo de Salvo Braz University of Illinois at Urbana-Champaign with Eyal Amir.
Inference in First-Order Logic
Artificial Intelligence: Knowledge Representation
Advanced Piloting Cruise Plot.
Copyright © 2002 Pearson Education, Inc. Slide 1.
Chapter 1 The Study of Body Function Image PowerPoint
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
Chapter 1 Image Slides Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
1 Probability and the Web Ken Baclawski Northeastern University VIStology, Inc.
1 The Academic Profession and the Managerial University: An International Comparative Study from Japan Akira Arimoto Research Institute for Higher Education.
Introduction to Metview
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Setting Up The Interactive Notebook!!
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
Addition Facts
Year 6 mental test 5 second questions
Introduction Lesson 1 Microsoft Office 2010 and the Internet
ABC Technology Project
GENERAL EDUCATION ASSESSMENT Nathan Lindsay January 22-23,
Green Eggs and Ham.
1 Multimedia Systems 2 Dr Paul Newbury School of Engineering and Information Technology ENGG II - 3A11 Ext:
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
1 CS 391L: Machine Learning: Rule Learning Raymond J. Mooney University of Texas at Austin.
Computer Science CPSC 322 Lecture 3 AI Applications.
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) Nov, 28, 2012.
© 2012 National Heart Foundation of Australia. Slide 2.
Chapter 5 Test Review Sections 5-1 through 5-4.
Addition 1’s to 20.
25 seconds left…...
Week 1.
We will resume in: 25 Minutes.
CSE 473/573 Computer Vision and Image Processing (CVIP) Ifeoma Nwogu Lecture 27 – Overview of probability concepts 1.
Chapter 12 Analyzing Semistructured Decision Support Systems Systems Analysis and Design Kendall and Kendall Fifth Edition.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Local Search Jim Little UBC CS 322 – CSP October 3, 2014 Textbook §4.8
CPSC 322, Lecture 14Slide 1 Local Search Computer Science cpsc322, Lecture 14 (Textbook Chpt 4.8) Oct, 5, 2012.
Intracellular Compartments and Transport
A SMALL TRUTH TO MAKE LIFE 100%
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
IP, IST, José Bioucas, Probability The mathematical language to quantify uncertainty  Observation mechanism:  Priors:  Parameters Role in inverse.
Essential Cell Biology
How Cells Obtain Energy from Food
12/10/14 Exam Wedn., 12/17/13, 2pm-4:30pm, Baker Laboratory 200 ( Material: Cumulative. Covers all material.
CpSc 3220 Designing a Database
0 WPI First Experience Teaching Software Testing Lessons Learned Gary Pollice Worcester Polytechnic Institute and Rational Software Corp.
Listening non-stop for 150min per week, for 16 weeks –4000$ (your tuition).. Re-viewing all the lecture videos on Youtube –100000$ (in lost girl friends/boy.
Pendulum Swings in AI  Top-down vs. Bottom-up  Ground vs. Lifted representation  The longer I live the farther down the Chomsky Hierarchy I seem to.
CSE 571: Artificial Intelligence Instructor: Subbarao Kambhampati Class Time: 12:40—1:55 M/W Homepage:
Listening non-stop for 150min per week, for 16 weeks –4000$ (your tuition).. Watching Rao sip 30+ doppio machchiatos –30$ (aggravation fee).. Catching.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
Listening non-stop for 150min per week, for 16 weeks –4000$ (your tuition).. Catching up on your beauty sleep in the class –300$ (chairs not very comfy)
1 5/4: Final Agenda… 3:15—3:20 Raspberry bars »In lieu of Google IPO shares.. Homework 3 returned; Questions on Final? 3:15--3:40 Demos of student projects.
Listening non-stop for 150min per week, for 16 weeks –4000$ (your tuition).. Catching up on your beauty sleep in the class –300$ (chairs not very comfy)
Dynamic Bayesian Networks CSE 473. © Daniel S. Weld Topics Agency Problem Spaces Search Knowledge Representation Reinforcement Learning InferencePlanningLearning.
CIS 410/510 Probabilistic Methods for Artificial Intelligence Instructor: Daniel Lowd.
10/3/2015 ARTIFICIAL INTELLIGENCE Russell and Norvig ARTIFICIAL INTELLIGENCE: A Modern Approach.
1 2010/2011 Semester 2 Introduction: Chapter 1 ARTIFICIAL INTELLIGENCE.
FNA/Spring CENG 562 – Machine Learning. FNA/Spring Contact information Instructor: Dr. Ferda N. Alpaslan
The Hebrew University of Jerusalem School of Engineering and Computer Science Academic Year: 2011/2012 Instructor: Jeff Rosenschein.
Brief Intro to Machine Learning CS539
2009: Topics Covered in COSC 6368
2004: Topics Covered in COSC 6368
Presentation transcript:

CSE 571: Artificial Intelligence Instructor: Subbarao Kambhampati Homepage: Office Hours: Right after the class 3:15—4:15pm BY560

History At ASU, CSE 471/598 has been taught as the main introductory AI course – Normally taught by either Rao or Huan Liu 571 has been taught as a graduate level AI course – Didn’t necessarily require 471 – Didn’t necessarily have a breadth aspect Nick Findler taught it for a long time and would focus on distributed AI Chitta Baral taught it after Nick and would focus on knowledge representation Last time Rao taught it was in 1996 – Looking back at that syllabus, it looks like 571 I taught then is a subset of 471 as I teach now

CSE 571 This time? “Run it as a Graduate Level Follow-on to CSE 471” Broad objectives – Deeper treatment of some of the 471 topics – More emphasis on tracking current state of the art – Training for literature survey and independent projects

Who are you & what do you want?

What we did in 471 Week 1: Intro; Intelligent agent design [R&N Ch 1, Ch 2] Week 2: Problem Solving Agents [R&N Ch ] Week 3: Informed search [R&N Ch ] Week 4: CSPs and Local Search[R&N Ch ; Ch 4 4.3] Week 5: Local Search and Propositional Logic[R&N Ch 4 4.3; Ch ] Week 6: Propositional Logic --> Plausible reasoning[R&N Ch ; [ch ]] Week 7: Representations for Reasoning with Uncertainty[ch ]] Week 8: Bayes Nets: Specification & Inference[ch ]] Week 9: Bayes Nets: Inference[ch ]] (Here is a fully worked out example of variable elimination) Week 10: Sampling methods for Bayes net Inference; First-order logic start[ch 13.5; ] Week 11: Unification, Generalized Modus- Ponens, skolemization and resolution refutation. Week 12: Reasoning with change  Planning Week 13: Planning, MDPs & Gametree search Week 14: Learning

Chapters Covered in 471 (Spring 09) Table of Contents (Full Version)Full Version Preface (html); chapter map Part I Artificial Intelligence 1 Introduction 2 Intelligent Agents Part II Problem Solving 3 Solving Problems by Searching 4 Informed Search and Exploration 5 Constraint Satisfaction Problems 6 Adversarial Search Part III Knowledge and Reasoning 7 Logical Agents 8 First-Order Logic 9 Inference in First-Order Logic 10 Knowledge Representation Part IV Planning 11 Planning (pdf) 12 Planning and Acting in the Real Worldhtmlchapter mappdf Part V Uncertain Knowledge and Reasoning 13 Uncertainty 14 Probabilistic Reasoning 15 Probabilistic Reasoning Over Time 16 Making Simple Decisions 17 Making Complex Decisions Part VI Learning 18 Learning from Observations 19 Knowledge in Learning 20 Statistical Learning Methods 21 Reinforcement Learning Part VII Communicating, Perceiving, and Acting 22 Communication 23 Probabilistic Language Processing 24 Perception 25 Robotics Part VIII Conclusions 26 Philosophical Foundations 27 AI: Present and Future

Rao: I could've taught more...I could've taught more, if I'd just...I could've taught more... Yunsong: Rao, there are thirty people who are mad at you because you taught too much. Look at them. Rao: If I'd made more time...I wasted so much time, you have no idea. If I'd just... Yunsong: There will be generations (of bitter people) because of what you did. Rao: I didn't do enough. Yunsong: You did so much. Rao: This slide. We could’ve removed this slide. Why did I keep the slide? Two minutes, right there. Two minutes, two more minutes.. This music, a bit on reinforcement learning. This review. Two points on bagging and boosting. I could easily have made two for it. At least one. I could’ve gotten one more point across. One more. One more point. A point, Yunsong. For this. I could've gotten one more point across and I didn't.  Adieu with an Oscar Schindler Routine.. Schindler: I could've got more...I could've got more, if I'd just...I could've got more... Stern: Oskar, there are eleven hundred people who are alive because of you. Look at them. Schindler: If I'd made more money...I threw away so much money, you have no idea. If I'd just... Stern: There will be generations because of what you did. Schindler: I didn't do enough. Stern: You did so much. Schindler: This car. Goeth would've bought this car. Why did I keep the car? Ten people, right there. Ten people, ten more people...(He rips the swastika pin from his lapel) This pin, two people. This is gold. Two more people. He would've given me two for it. At least one. He would've given me one. One more. One more person. A person, Stern. For this. I could've gotten one more person and I didn't. Top few things I would have done if I had more time Statistical Learning Reinforcement Learning; Bagging/Boosting Planning under uncertainty and incompleteness Ideas of induced tree-width Multi-agent X (X=search,learning..) PERCEPTION (Speech; Language…) Be less demanding more often (or even once…)

Things I Know I want to Cover Search – Local vs. Systematic – Optimization in continuous domains Constraint networks – Tree-width concepts; temporal constraint networks Reasoning: Planning – Temporal planning; belief-space planning, stochastic planning – POMDPs; DecPOMDPs? KR: Templated Probabilistic Networks – Dynamic probabilistic networks – Relational Probabilistic networks Learning: – Relational Learning – Reinforcement learning

Reading Material…Eclectic Chapters from the new edition (in preparation) of R&N (in some cases) – First reading: Advanced Search Techniques chapter (Will be distributed in hardcopy) Chapters from other books – POMDPS from Thrun/Burgard/Fox – Templated Graphical models from Koller &Friedman – CSP/Tree-width stuff from Dechter Tutorial papers etc

“Grading”? 3 main ways – Participate in the class actively. Read assigned chapters/papers; submit reviews before the class; take part in the discussion – Learn/Present the state of the art in a sub-area of AI You will pick papers from IJCAI 2009 as a starting point – Work on a semester-long project Can be in groups of two (or, in exceptional circumstances, 3)

Deadlines.. AAMAS deadline: 10/8/09 KR deadline: 11/10/09 ICAPS deadline: 12/16/09 AAAI deadline: 1/15/10 ICML deadline: ~2/10/10

Discussion What are the current controversies in AI? What are the hot topics in AI?

Pendulum Swings in AI Top-down vs. Bottom-up Ground vs. Lifted representation – The longer I live the farther down the Chomsky Hierarchy I seem to fall [Fernando Pereira] Pure Inference and Pure Learning vs. Interleaved inference and learning Knowledge Engineering vs. Model Learning Human-aware vs.

The representational roller-coaster in CSE 471 atomic propositional/ (factored) relational First-order State-space search CSPProp logicBayes Nets FOPC w.o. functions FOPCSit. Calc. STRIS Planning MDPsMin-max Decision trees Semester time  The plot shows the various topics we discussed this semester, and the representational level at which we discussed them. At the minimum we need to understand every task at the atomic representation level. Once we figure out how to do something at atomic level, we always strive to do it at higher (propositional, relational, first-order) levels for efficiency and compactness. During the course we may not discuss certain tasks at higher representation levels either because of lack of time, or because there simply doesn’t yet exist undergraduate level understanding of that topic at higher levels of representation..

ideas Put the schindler’s list slide Make people in the class come up with currents in AI that are most interesting to them Present the IJCAI statistics Present the main trends Present the deadlines How to make AI commercial?