Test 2

State True or False:
Each sub task, Mi in a MAXQ Framework is not an SMDP.

• True

• False

• Maybe True

• Maybe False

Recall that in MAXQ Value Function Decomposition, we draw a “call graph” where nodes are ‘tasks’ and edges show the dependency of the tasks. Which of the following is true about the graph?

• The graph must be a tree

• The graph must be a DAG

• The graph can be any regular graph without self loops

• Any directed graph can be a call graph

State True or False:
In the MAXQ framework, rewards of the core MDP are not available while learning the policies of the sub-tasks i.e, the agent is restricted to the corresponding sub-task’s pseudo rewards.

• True

• False

• Maybe True

• Maybe False

Which of the following statements are true ?

• Function approximation allows us to deal with continuous state spaces.

• A lookup table is a linear function approximator.

• State aggregates do not overlap in coarse-coding.

• None of the above

Assertion: It is not possible to use look-up table based methods to solve continuous state or action space problems. (Assume discretization of continuous space is not allowed)
Reason: For continuous state or action space, there are an infinite number of states/actions

• Both Assertion and Reason are true, and Reason is correct explanation for Assertion.

• Both Assertion and Reason are true, but Reason is not correct explanation for assertion.

• Assertion is true, Reason is false

• Both Assertion and Reason are false