This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 18 published solutions
Question 215 MCQ · 7.0 marks
6406532050488.
I have written answers on the answer sheets
6406532050489.
Not applicable
**RL**
**Section Id :** 64065341418
**Section Number :** 10
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 16
**Number of Questions to be attempted :** 16
**Section Marks :** 50
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
Yes
**Clear Response :**
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
Given a problem with a well defined hierarchy, what ordering would you expect on the total
expected reward for a hierarchically optimal policy (H), a recursively optimal policy (R) and a flat
optimal policy (F)?
Policy gradient methods use a parameterized policy that can select actions
without consulting a value function.
6406532050522.
Policy gradient methods **must** use a value function to learn the policy
parameters.
6406532050523.
According to the policy gradient theorem, computing the gradient of the
performance requires the computation of the gradient of the state distribution μ(s).
6406532050524.
In REINFORCE with baseline, the baseline **cannot** be a function of the actions.
A published solution is not available for this question yet.
Based on the above data, answer the given subquestions.
If the eligibility traces are replacing in nature, which state would have highest eligibility trace at
the end of a trajectory, and what will be the value of the eligibility trace of the corresponding
state?
**Statistical Computing**
**Section Id :** 64065341419
**Section Number :** 11
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 6
**Number of Questions to be attempted :** 6
**Section Marks :** 50
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
Yes
**Clear Response :**
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
