learning objectives
play

Learning Objectives At the end of the class you should be able to: - PowerPoint PPT Presentation

Dec 31, 2022 •778 likes •995 views

Learning Objectives At the end of the class you should be able to: justify why depth-bounded search is useful demonstrate how iterative-deepening works for a particular problem demonstrate how depth-first branch-and-bound works for a

  1. Learning Objectives At the end of the class you should be able to: justify why depth-bounded search is useful demonstrate how iterative-deepening works for a particular problem demonstrate how depth-first branch-and-bound works for a particular problem � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 1

  2. Bounded Depth-first search A bounded depth-first search takes a bound (cost or depth) and does not expand paths that exceed the bound. I explores part of the search graph I uses space linear in the depth of the search. How does this relate to other searches? How can this be extended to be complete? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 2

  3. Which shaded goal will a depth-bounded search find first? Q W R T Y U V � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 3

  4. Iterative-deepening search Iterative-deepening search: I Start with a bound b = 0. I Do a bounded depth-first search with bound b I If a solution is found return that solution I Otherwise increment b and repeat. � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 4

  5. Iterative-deepening search Iterative-deepening search: I Start with a bound b = 0. I Do a bounded depth-first search with bound b I If a solution is found return that solution I Otherwise increment b and repeat. This will find the same first solution as what other method? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 5

  6. Iterative-deepening search Iterative-deepening search: I Start with a bound b = 0. I Do a bounded depth-first search with bound b I If a solution is found return that solution I Otherwise increment b and repeat. This will find the same first solution as what other method? How much space is used? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 6

  7. Iterative-deepening search Iterative-deepening search: I Start with a bound b = 0. I Do a bounded depth-first search with bound b I If a solution is found return that solution I Otherwise increment b and repeat. This will find the same first solution as what other method? How much space is used? What happens if there is no path to a goal? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 7

  8. Iterative-deepening search Iterative-deepening search: I Start with a bound b = 0. I Do a bounded depth-first search with bound b I If a solution is found return that solution I Otherwise increment b and repeat. This will find the same first solution as what other method? How much space is used? What happens if there is no path to a goal? Surely recomputing paths is wasteful!!! � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 8

  9. Iterative Deepening Complexity Complexity with solution at depth k & branching factor b : level breadth-first iterative deepening # nodes 1 1 k b b 2 2 1 k − 1 . . . . . . . . . . . . b k − 1 k − 1 1 2 b k k 1 1 total � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 9

  10. Iterative Deepening Complexity Complexity with solution at depth k & branching factor b : level breadth-first iterative deepening # nodes 1 1 k b b 2 2 1 k − 1 . . . . . . . . . . . . b k − 1 k − 1 1 2 b k k 1 1 ⌘ 2 ≤ b k ⇣ ≥ b k b total b − 1 � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 10

  11. Depth-first Branch-and-Bound combines depth-first search with heuristic information. finds optimal solution. most useful when there are multiple solutions, and we want an optimal one. uses the space of depth-first search. � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 11

  12. Depth-first Branch-and-Bound Suppose we want to find a single optimal solution. Suppose bound is the cost of the lowest-cost path found to a goal so far. What if the search encounters a path p such that cost ( p ) + h ( p ) ≥ bound ? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 12

  13. Depth-first Branch-and-Bound Suppose we want to find a single optimal solution. Suppose bound is the cost of the lowest-cost path found to a goal so far. What if the search encounters a path p such that cost ( p ) + h ( p ) ≥ bound ? p can be pruned. What can we do if a non-pruned path to a goal is found? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 13

  14. Depth-first Branch-and-Bound Suppose we want to find a single optimal solution. Suppose bound is the cost of the lowest-cost path found to a goal so far. What if the search encounters a path p such that cost ( p ) + h ( p ) ≥ bound ? p can be pruned. What can we do if a non-pruned path to a goal is found? bound can be set to the cost of p , and p can be remembered as the best solution so far. Why should this use a depth-first search? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 14

  15. Depth-first Branch-and-Bound Suppose we want to find a single optimal solution. Suppose bound is the cost of the lowest-cost path found to a goal so far. What if the search encounters a path p such that cost ( p ) + h ( p ) ≥ bound ? p can be pruned. What can we do if a non-pruned path to a goal is found? bound can be set to the cost of p , and p can be remembered as the best solution so far. Why should this use a depth-first search? Uses linear space. What can be guaranteed when the search completes? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 15

  16. Depth-first Branch-and-Bound Suppose we want to find a single optimal solution. Suppose bound is the cost of the lowest-cost path found to a goal so far. What if the search encounters a path p such that cost ( p ) + h ( p ) ≥ bound ? p can be pruned. What can we do if a non-pruned path to a goal is found? bound can be set to the cost of p , and p can be remembered as the best solution so far. Why should this use a depth-first search? Uses linear space. What can be guaranteed when the search completes? It has found an optimal solution. � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 16

  17. Depth-first Branch-and-Bound Suppose we want to find a single optimal solution. Suppose bound is the cost of the lowest-cost path found to a goal so far. What if the search encounters a path p such that cost ( p ) + h ( p ) ≥ bound ? p can be pruned. What can we do if a non-pruned path to a goal is found? bound can be set to the cost of p , and p can be remembered as the best solution so far. Why should this use a depth-first search? Uses linear space. What can be guaranteed when the search completes? It has found an optimal solution. How should the bound be initialized? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 17

  18. Depth-first Branch-and-Bound: Initializing Bound The bound can be initialized to ∞ . The bound can be set to an estimate of the optimal path cost. After depth-first search terminates either: � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 18

  19. Depth-first Branch-and-Bound: Initializing Bound The bound can be initialized to ∞ . The bound can be set to an estimate of the optimal path cost. After depth-first search terminates either: I A solution was found. I No solution was found, and no path was pruned I No solution was found, and a path was pruned. � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 19

  20. Which shaded goals will be best solutions so far? Q W R T Y U V � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 3.5, Page 20

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Objectives Objectives Objectives Objectives Learning Learning Learning Learning

Objectives Objectives Objectives Objectives Learning Learning Learning Learning

11/14/2016 Is Starting a Nonprofit Right for You? Objectives Objectives Objectives Objectives Learning Learning Learning Learning Understand what a Nonprofit Organization is and the Objectives Objectives Objectives Objectives

382 views • 11 slides
Trigeminal Autonomic Cephalalgias Learning Objectives Learning Objectives At the conclusion

Trigeminal Autonomic Cephalalgias Learning Objectives Learning Objectives At the conclusion

Steven Graff-Radford, DDS Co-Director, the Pain Center Cedars-Sinai Medical Center Clinical Professor USC School of Dentistry Los Angeles, CA Trigeminal Autonomic Cephalalgias Learning Objectives Learning Objectives At the conclusion

373 views • 23 slides
E-Learning Day 7 March 2019 To promote self-directed Objectives learning using ICT To ensure

E-Learning Day 7 March 2019 To promote self-directed Objectives learning using ICT To ensure

E-Learning Day 7 March 2019 To promote self-directed Objectives learning using ICT To ensure continuity of learning in the event of unscheduled school closure SLS website Student Learning Space Select the URL below to (SLS) access

458 views • 23 slides
Learning Objectives At the end of the class you should be able to: derive Bayesian learning from

Learning Objectives At the end of the class you should be able to: derive Bayesian learning from

Learning Objectives At the end of the class you should be able to: derive Bayesian learning from first principles explain how the Beta and Dirichlet distributions are used for Bayesian learning. D. Poole and A. Mackworth 2019 c Artificial

272 views • 16 slides
Learning Objectives At the end of the class you should be able to: identify a supervised learning

Learning Objectives At the end of the class you should be able to: identify a supervised learning

Learning Objectives At the end of the class you should be able to: identify a supervised learning problem characterize how the prediction is a function of the error measure avoid mixing the training and test sets D. Poole and A. Mackworth

491 views • 37 slides
10601 Learning Objectives Course Level Learning Outcomes 1. Course Level a. Implement and

10601 Learning Objectives Course Level Learning Outcomes 1. Course Level a. Implement and

10601 Learning Objectives Course Level Learning Outcomes 1. Course Level a. Implement and analyze existing learning algorithms, including well-studied methods for classification, regression, structured prediction, clustering, and

88 views • 7 slides
Knowing Your Sons Learning Style Objectives Know your son Strengths and Weaknesses in

Knowing Your Sons Learning Style Objectives Know your son Strengths and Weaknesses in

Knowing Your Sons Learning Style Objectives Know your son Strengths and Weaknesses in learning. Understand your children's learning needs Identify reasons for underachievement Student/teacher interaction improvement Aware that Learning

204 views • 18 slides
PVMD Delft University of Technology Learning objectives Improved light calibration Learning

PVMD Delft University of Technology Learning objectives Improved light calibration Learning

External Quantum Efficiency Ren van Swaaij PVMD Delft University of Technology Learning objectives Improved light calibration Learning objectives Improved light calibration Bias illumination and bias voltage Learning objectives

321 views • 28 slides
Use of IT in own tasks and business and how it is learnt Learning objectives Identify

Use of IT in own tasks and business and how it is learnt Learning objectives Identify

INF 3280, 29 Jan 2020 Use of IT in own tasks and business and how it is learnt Learning objectives Identify the activities in which the application for your Assignments 3-4 will be used Determine learning objectives for use of

351 views • 6 slides
A.I.S. Class 5: Outline I Learning Objectives for Chapter 2 I Elements of Information Systems I

A.I.S. Class 5: Outline I Learning Objectives for Chapter 2 I Elements of Information Systems I

A.I.S. Class 5: Outline I Learning Objectives for Chapter 2 I Elements of Information Systems I Discussion Questions and Problems I Automated Procedures for Sales and Collections Dr. Peter R Gillett September 20, 2000 1 Learning Objectives for

267 views • 15 slides
1 2 These are our learning objectives for the session. - this is an Information Sharing session

1 2 These are our learning objectives for the session. - this is an Information Sharing session

1 2 These are our learning objectives for the session. - this is an Information Sharing session and not a HOW TO 3 To meet the learning objectives, here are the topics we will cover in the session today: Overview of Research Projects will

1.09k views • 70 slides
Standards for Professional Learning Standards for Professional Learning Learning objectives

Standards for Professional Learning Standards for Professional Learning Learning objectives

Introduction to the Standards for Professional Learning Standards for Professional Learning Learning objectives Learners will be able to Explain the purpose of the Standards for Professional Learning. Identify the implications of

347 views • 15 slides
Objectives To encourage on-line independent learning as well as ensure learning can still

Objectives To encourage on-line independent learning as well as ensure learning can still

Objectives To encourage on-line independent learning as well as ensure learning can still continue at home in the event of any school closure for whatever reason in the future. Details Date: 7 March 2017 (Tuesday) Venue: @Home

425 views • 14 slides
Learning skills with Instructions Learning objectives 1. Distinguish IT skills from other IT

Learning skills with Instructions Learning objectives 1. Distinguish IT skills from other IT

INF3280 22 Jan 2019 Learning skills with Instructions Learning objectives 1. Distinguish IT skills from other IT competence 2. Characterize how skills are learnt 3. Identify qualities of Instructions for skill learning 4. Being able to

369 views • 16 slides
Rate vs temporal code about synchrony Learning objectives: Learning objectives: To

Rate vs temporal code about synchrony Learning objectives: Learning objectives: To

Rate vs temporal code about synchrony Learning objectives: Learning objectives: To understand how synchrony can be measured To gain an understanding of a simple neural model of synchronization To gain an understanding of a simple neural

592 views • 25 slides
Wrist Instability and Fusion course Learning Objectives Slides Dorsal Approach Objectives

Wrist Instability and Fusion course Learning Objectives Slides Dorsal Approach Objectives

The Birmingham Hand Centre Wrist Instability and Fusion course Learning Objectives Slides Dorsal Approach Objectives Midline incision over 4 th EC 1. 2. Elevate ER over EC3+4 3. Retract tendons, dissect onto dorsal ligs 4. Open proximal

235 views • 6 slides
Mapping Volcanic Plumes with AIRS, MODIS, and ASTER Data AIRS Science Team Meeting, March 30,

Mapping Volcanic Plumes with AIRS, MODIS, and ASTER Data AIRS Science Team Meeting, March 30,

Mapping Volcanic Plumes with AIRS, MODIS, and ASTER Data AIRS Science Team Meeting, March 30, 2007 Vincent J. Realmuto , Jet Propulsion Laboratory Focus of Presentation: Development of a Common Set of Tools for the Analysis of Thermal Infrared

482 views • 18 slides
GNR607 Principles of Satellite Image Processing Instructor: Prof. B. Krishna Mohan CSRE, IIT

GNR607 Principles of Satellite Image Processing Instructor: Prof. B. Krishna Mohan CSRE, IIT

GNR607 Principles of Satellite Image Processing Instructor: Prof. B. Krishna Mohan CSRE, IIT Bombay bkmohan@csre.iitb.ac.in Slot 2 Lecture 32-34 Principal Component Transform and Band Arithmetic October 14, 2014 10.35 AM 11.30

1.08k views • 67 slides
Updated 19 November: The Mw7.6 Kashmir 8 October 2005 earthquake occurred in a region where a

Updated 19 November: The Mw7.6 Kashmir 8 October 2005 earthquake occurred in a region where a

Source: http://cires.colorado.edu/~bilham/Kashmir%202005.htm (Dr. Roger Bilham of the Cooperative Institute for Research in Environmental Sciences) Updated 19 November: The Mw7.6 Kashmir 8 October 2005 earthquake occurred in a region where a great

192 views • 8 slides
QCD effects on Higgs Boson production and decay at Hadron colliders Damiano Tommasini

QCD effects on Higgs Boson production and decay at Hadron colliders Damiano Tommasini

QCD effects on Higgs Boson production and decay at Hadron colliders Damiano Tommasini Universit-INFN Firenze Universitt Zrich Outline Introduction Higgs boson production: transverse momentum distribution The inclusion of the

267 views • 26 slides
ECE590 Computer and Information Security Fall 2019 Introduction and Course Policies Tyler

ECE590 Computer and Information Security Fall 2019 Introduction and Course Policies Tyler

ECE590 Computer and Information Security Fall 2019 Introduction and Course Policies Tyler Bletsch Duke University Instructor and TAs Professor: Tyler Bletsch Office: Hudson Hall 106 Email: Tyler.Bletsch@duke.edu Office Hours:

292 views • 15 slides
Longitudinal Vector Boson Scattering with Deep Machine Learning Jake Searcy, Lillian Huang,

Longitudinal Vector Boson Scattering with Deep Machine Learning Jake Searcy, Lillian Huang,

Longitudinal Vector Boson Scattering with Deep Machine Learning Jake Searcy, Lillian Huang, Marc-Andre Pleier, Junjie Zhu 1 VBS and the Higgs Without a Higgs the matrix element for Longitudinal VBS (VLVL) grows with energy until it becomes

351 views • 22 slides
Deep Inelastic Scattering: Recent Results and Future D.Naples University of Pittsburgh NuInt

Deep Inelastic Scattering: Recent Results and Future D.Naples University of Pittsburgh NuInt

Deep Inelastic Scattering: Recent Results and Future D.Naples University of Pittsburgh NuInt 2007 Fermilab June 3, 2007 Outline Overview of Neutrino DIS Recent Results NuTeV High energy range Chorus 10-300 GeV WIP

834 views • 61 slides
Reduce Number of Ops and Weights Exploit Activation Statistics Network Pruning Compact

Reduce Number of Ops and Weights Exploit Activation Statistics Network Pruning Compact

Reduce Number of Ops and Weights Exploit Activation Statistics Network Pruning Compact Network Architectures Knowledge Distillation 26 Sparsity in Fmaps Many zeros in output fmaps after ReLU ReLU 9 -1 -3 9 0 0 1 -5 5 1 0 5 -2 6 -1

667 views • 35 slides

More recommend