top of page

Chapter 17: making complex decisions

ARTIFICIAL INTELLIGENCE MODERN APPROACH

Chapter Audio

Deepen your comprehension by listening to the curated audio discussion for this segment. This resource breaks down complex theories into digestible insights for effective retention.

Visual Summaries

  • AI17.png
  • unnamed (1).png
  • unnamed.png

Chapter 01: Introduction

ARTIFICIAL INTELLIGENCE MODERN APPROACH

Table Summary

17.png

Core Terminology

Master key academic terminology through active recall and spaced repetition concepts.

 Markov Decision Process (MDP)

A sequential decision problem for a fully observable, stochastic environment with a Markovian transition model and additive rewards.

 optimal policy (π∗)

The policy that yields the highest expected utility among all possible policies.

Value iteration

Which algorithm calculates an optimal policy by iteratively updating state utilities until they reach equilibrium?

 'contraction' mapping

An operator that, when applied to two different vectors, results in two new vectors that are closer together.

Policy evaluation and policy improvement.

What are the two alternating steps in the policy iteration algorithm?

modified policy iteration

An algorithm that approximates policy evaluation using a few steps of value iteration instead of solving linear equations exactly.

Chapter Quiz

According to the source, which capability is uniquely required for a computer to pass the 'Total Turing Test' compared to the standard Turing Test?

What is a primary obstacle to the 'laws of thought' (logicist) approach to artificial intelligence?

Which field is described as combining probability theory with utility theory to provide a framework for decisions made under uncertainty?

The 'General Problem Solver' (GPS) was the first program designed to embody which specific approach to AI?

Why was the DENDRAL program significant in the history of AI development?

Answers: D, C, A, D, A

bottom of page