IAI Questions - Minji Lee | Library

1

What is wrong about discounting reward?

1

Below explains some properties of RL. What is incorrectly connected?

1

What is wrong about optimal value functions?

1

We stop the value iteration when:

1

 The time complexity of value iteration is ________   per iteration, where policy evaluation is ________  per iteration.

Other Answer Choices:

1

What is the advantage of policy iteration over value iteration?

1

Match the algorithms with appropriate target.

Draggable item		Corresponding Item
MC
Q-learning
SARSA
TD(0)

1

Categorize algorithms.

Value iteration
MC
TD
DQN

Model-free
Model-based

1

Categorize algorithms.

DQN
Q-learning
SARSA
TD

On-policy
Off-policy

1

MC
TD
DP
SARSA

Bootstrapping
Sampling

1

What is wrong about DQN? Choose all.

1

What is wrong about the below explanations about the representation of search problems?

1

What is true about search problem and algorithms? Choose all.

1

What is the data structure of frontier by the algorithm?

Tree search
Graph search
DFS
UCS
A*
Best first search

Closed list
Queue
Priority queue

1

DLS is complete if ________ and optimal if ________  where l denotes depth limit, m denotes max depth, and d denotes the depth of the shallowest goal.

Other Answer Choices:

m is finite

d is finite

1

(Row) expands the (Column) unexplored node in the frontier. Choose the right

1

The space complexity of frontier of BFS is ________ and explored list ________ . The space complexity of frontier of DFS is ________ .

Other Answer Choices:

1

When is inappropriate to use the bi-directional search?

1

What is wrong about DLS? Choose all.

1

What is true about UCS? Choose all.

1

What is true about A* search?

1

What is wrong about relaxed problems?

1

What is wrong about approaches for obtaining heuristics?

1

Categorize local search methods.

Hill-climbing
Stochastic hill-climbing
Simulated annealing
Local beam search

Select highest valued neighbor
Select neighbor that produces an improvement
Accept bad moves

1

Consider map coloring problem, which is CSP. Here, adjacent regions must have different colors. We have 3 regions A, B, C, that are all adjacent to each other.
A is not equal to B is __________ constraint. The __________ of the constraint is (A,B). We can add __________ such as red is better than green.

1

Backtracking search is __________ algorithm. It is __________ with constraint checking. It checks constraints __________. It backtracks when __________ .

1

Match the explanation of approaches of ordering variable in CSP.

Draggable item		Corresponding Item
Most constrained variable		The variable with the fewest remaining legal values in its domain
Degree heuristic		The variable involved in the largest number of constraints on other unassigned variables.

1

Match the explanation of approaches of filtering variable in CSP.

Draggable item		Corresponding Item
Forward checking		Propagation from assigned variable to unassigned variable
Arc consistency		Examines further implications, not only 1-step
Both		Detects failures earlier

1

The time complexity of AC-3 is O(?) because there are ________ edges, take________ time for consistency enforcing, and ________ for arc insertions.

Other Answer Choices:

1

________ add new sentences to knowledge base. Agent can use inference to deduce new facts from _________ ed facts.

Other Answer Choices:

TELL

ASK

1

________________ commitment of propositional language is fact. ____________________ commitment is T/F/unknown.

Other Answer Choices:

Epistemological

Ontological

1

What can be inferred from below?

1

Below sentence explains the syntax of FOL. ^ ________________ . ∀ is ________________ . 

Other Answer Choices:

connectives

quantifiers

1

Match the explanation of well-known problems of planning.

Draggable item		Corresponding Item
Qualification problem		Representing all things that stay the same
Ramification problem		Defining conditions for an action to succeed
Frame problem		Representing implicit consequences of actions

1

What is true about linear planning?

1

Consider PDDL. What is included in what?

Actions
Initial state
Goal
Types
Predicates
Objects
Constants

Domain definition
Problem definition

1

What is wrong about Bayes Rule?

1

__________ allows incremental updating of beliefs
as more evidence is gathered.

1

Bayesian networks describe __________ distributions using __________ distributions.

Other Answer Choices:

local

joint

1

Match the type of causal chain with the definition of joint distribution.

Draggable item		Corresponding Item
Casual chain
Common cause
Common effect

1

Observing the cause ________________  the path between two effects of same cause. Observing the cause ______________ the path between two causes of same effect.

Other Answer Choices:

inactivates

activates

	Deepest	Shallowest	Cheapest
BFS
DFS
DLS
UCS
IDS

	Deepest	Shallowest	Cheapest
BFS
DFS
DLS
UCS
IDS