MauryaHub PYQ Practice

Reinforcement Learning · End Term · Sep 2023 · AN

Reinforcement Learning · End Term · Sep 2023 AN

← Course papers · Start practice / exam

Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.

0 / 32 published solutions

Question 147 MSQ · 3.0 marks

Which of the following Boolean functions can be used as a universal gate? Note: The boolean input zero and one are available.
6406532335277.Source diagram or notation
6406532335278.Source diagram or notation
6406532335279.Source diagram or notation
6406532335280.Source diagram or notation
      **RL** **Section Id :** 64065349326 **Section Number :** 7 **Section type :** Online **Mandatory or Optional :** Mandatory **Number of Questions :** 30 **Number of Questions to be attempted :** 30 **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.

Report a correction for Q147

Question 149 MCQ · 0.0 marks

**Note:** 1. Always enter your answer correct upto 3 decimal places without rounding off for numerical questions.
6406532335297.
Useful Data has been mentioned above.
6406532335298.
This data attachment is just for a reference & not for an evaluation.

A published solution is not available for this question yet.

Report a correction for Q149

Question 150 MCQ · 1.0 marks

Assertion: Taking exploratory actions is important for RL agents Reason: If the rewards obtained for actions are stochastic, an action which gave a high reward once, might give lower reward next time.
6406532335299.
Assertion and Reason are both true and Reason is a correct explanation of Assertion.
6406532335300.
Assertion and Reason are both true and Reason is not a correct explanation of Assertion.
6406532335301.
Assertion is true and Reason is false
6406532335302.
Both Assertion and Reason are false.

A published solution is not available for this question yet.

Report a correction for Q150

Question 151 MCQ · 1.0 marks

Match the methods with their corresponding characteristics.
6406532335329.
DP: bootstraps, full backups MC: does not bootstrap, full backups TD: bootstraps, full backups
6406532335330.
DP: bootstraps, full backups MC: does not bootstrap, sample backups TD: bootstraps, sample backups
6406532335331.
DP: bootstraps, sample backups MC: bootstraps, sample backups TD: does not bootstrap, full backups
6406532335332.
DP: does not bootstrap, full backups MC: bootstraps, full backups TD: bootstraps, sample backups
6406532335333.
None of these

A published solution is not available for this question yet.

Report a correction for Q151

Question 152 MCQ · 1.0 marks

Which of the following is correct formulation of advantage function(A)?
6406532335383.Source diagram or notation
6406532335384.Source diagram or notation
6406532335385.Source diagram or notation
6406532335386.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q152

Question 153 MCQ · 1.0 marks

Which of the following is the most suitable way to solve for highest reusability?
6406532335398.
Hierarchical optimal
6406532335399.
Flat Optimal.
6406532335400.
Recursive optimal.
6406532335401.
None of these

A published solution is not available for this question yet.

Report a correction for Q153

Question 154 MCQ · 2.0 marks

Consider following assertion-reason pair: Assertion: Monte Carlo value function approximation methods need knowledge of model to be implemented. Reason: Monte Carlo value function approximation methods require a way to sample trajectories from the environment.
6406532335309.
Assertion and Reason are both true and Reason is a correct explanation of Assertion.
6406532335310.
Assertion and Reason are both true and Reason is not a correct explanation of Assertion.
6406532335311.
Assertion is true but Reason is false.
6406532335312.
Assertion is false but Reason is true.

A published solution is not available for this question yet.

Report a correction for Q154

Question 155 MCQ · 2.0 marks

Which of the following is the correct definition of accumulating eligibility traces?
6406532335334.Source diagram or notation
6406532335335.Source diagram or notation
6406532335336.Source diagram or notation
6406532335337.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q155

Question 156 MCQ · 2.0 marks

Which of the following statement(s) are correct about the TD(λ) algorithm?
6406532335342.
For λ = 1, the algorithm will behave like SARSA.
6406532335343.
For λ = 1, the algorithm will behave like Q-learning.
6406532335344.
For λ = 1, the algorithm will behave like Double Q-learning.
6406532335345.
For λ = 1, the algorithm will behave like Monte Carlo and will update incrementally instead of waiting for the trajectory to end.
6406532335346.
None of these

A published solution is not available for this question yet.

Report a correction for Q156

Question 157 MCQ · 2.0 marks

In the naive method of state aggregation such as we have in a grid world, the assumption that states that are close together have similar values breaks down for which of the following scenarios?
6406532335347.
A pair of states that are in the middle of some cell.
6406532335348.
A pair of states that are close to the border with both of them lying in the same cell.
6406532335349.
A pair of states that are close to the border with both of them lying in different cells.
6406532335350.
None of these

A published solution is not available for this question yet.

Report a correction for Q157

Question 158 MCQ · 2.0 marks

Which of the following learning algorithms exhibit maximization bias?
6406532335351.
Q-learning
6406532335352.
Double-Q learning
6406532335353.
SARSA
6406532335354.
Expected SARSA
6406532335355.
TD(λ) with eligibility traces
6406532335356.
None of these

A published solution is not available for this question yet.

Report a correction for Q158

Question 159 MCQ · 2.0 marks

As a consequence of the proposed fix for the non-stationarity of the target in DQN, the target network changes at a _______ rate than the online network.
6406532335357.
faster
6406532335358.
slower
6406532335359.
None of these

A published solution is not available for this question yet.

Report a correction for Q159

Question 160 MCQ · 2.0 marks

Which of the following is the correct update rule for θ (representing the policy) with the policy gradient method?
6406532335360.Source diagram or notation
6406532335361.Source diagram or notation
6406532335362.Source diagram or notation
6406532335363.Source diagram or notation
6406532335364.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q160

Question 161 MCQ · 2.0 marks

Which of the following is the correct formulation of cost function for multi arm bandit problem?
6406532335365.Source diagram or notation
6406532335366.Source diagram or notation
6406532335367.Source diagram or notation
6406532335368.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q161

Question 162 MCQ · 2.0 marks

Source diagram or notation
6406532335369.Source diagram or notation
6406532335370.Source diagram or notation
6406532335371.Source diagram or notation
6406532335372.Source diagram or notation
6406532335373.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q162

Question 163 MCQ · 2.0 marks

Which of the following is correct formulation of policy gradient theorem with baseline?
6406532335374.Source diagram or notation
6406532335375.Source diagram or notation
6406532335376.Source diagram or notation
6406532335377.Source diagram or notation
6406532335378.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q163

Question 164 MCQ · 2.0 marks

Choose the correct formula for UCT:
6406532335410.Source diagram or notation
6406532335411.Source diagram or notation
6406532335412.Source diagram or notation
6406532335413.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q164

Question 165 MCQ · 2.0 marks

Source diagram or notation
6406532335414.Source diagram or notation
6406532335415.Source diagram or notation
6406532335416.Source diagram or notation
6406532335417.Source diagram or notation
6406532335418.
None of these

A published solution is not available for this question yet.

Report a correction for Q165

Question 166 MSQ · 1.0 marks

Source diagram or notation
6406532335305.Source diagram or notation
6406532335306.Source diagram or notation
6406532335307.Source diagram or notation
6406532335308.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q166

Question 167 MSQ · 1.0 marks

Source diagram or notation
6406532335313.
S1
6406532335314.
S2
6406532335315.Source diagram or notation
S6
6406532335316.
S4
6406532335317.
None of these

A published solution is not available for this question yet.

Report a correction for Q167

Question 168 MSQ · 1.0 marks

Choose the correct qualifiers for SARSA from the options given below.
6406532335322.
On-policy
6406532335323.
Off-policy
6406532335324.
TD-control
6406532335325.
TD-prediction
6406532335326.
None of these

A published solution is not available for this question yet.

Report a correction for Q168

Question 169 MSQ · 1.0 marks

What are the correct changes you have to make in the standard policy gradient theorem to come up with MC policy gradient with baseline update rule?
6406532335379.Source diagram or notation
6406532335380.Source diagram or notation
6406532335381.Source diagram or notation
6406532335382.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q169

Question 170 MSQ · 1.0 marks

Choose the correct statement regarding the A3C algorihtm:
6406532335387.
It uses parallel processing.
6406532335388.
It is sequential in natures.
6406532335389.
All the individual learners have to produce only small updates to the gradient.
6406532335390.
All the individual learners can produce small and large updates to the gradient.
6406532335391.
It uses n-step TD error to update the policy parameters.
6406532335392.
None of these

A published solution is not available for this question yet.

Report a correction for Q170

Question 171 MSQ · 1.0 marks

Which of the following are characteristics of MCTS?
6406532335406.
Aheuristic.
6406532335407.
Anytime.
6406532335408.
Symmetric.
6406532335409.
None of these.

A published solution is not available for this question yet.

Report a correction for Q171

Question 172 MSQ · 2.0 marks

Select the correct statements from the options below:
6406532335318.
Asynchronous DP is a type of generalized policy iteration.
6406532335319.
Value iteration algorithm is not a type of generalized policy iteration.
6406532335320.
Policy iteration algorithm is a type of generalized policy iteration.
6406532335321.
If an algorithm is some form of generalized policy iteration, it is guaranteed to converge to an optimal policy.

A published solution is not available for this question yet.

Report a correction for Q172

Question 173 MSQ · 2.0 marks

Which of the following are correct about the notion of eligibility traces?
6406532335338.
It is the backward view of the TD(λ) algorithm.
6406532335339.
It is the forward view of the TD(λ) algorithm.
6406532335340.
The motivation behind eligibility traces is, if an agent receives a reward/punishment at any time step, then which decisions in the past are eligible to get credit for it.
6406532335341.
None of these

A published solution is not available for this question yet.

Report a correction for Q173

Question 174 MSQ · 2.0 marks

Choose the correct components of an option:
6406532335393.
Initiation.
6406532335394.
Policy.
6406532335395.
Termination.
6406532335396.
Set of actions.
6406532335397.
None of these

A published solution is not available for this question yet.

Report a correction for Q174

Question 175 MSQ · 2.0 marks

Which of the following is true about Markov and Semi Markov Options?
6406532335402.
In a Markov Option the option’s policy depends only on the current state.
6406532335403.
In a Semi Markov Option the option’s policy can depend only on the current state.
6406532335404.
In a Semi Markov Option, the option’s policy may depend on the history since the execution of the option began.
6406532335405.
A Semi-Markov Option is always a Markov Option but not vice versa.

A published solution is not available for this question yet.

Report a correction for Q175

Question 176 NAT · 2.0 marks

Source diagram or notation
What is the 2 step value function for state 2, computed in synchronous manner, following equiprobable random policy?

A published solution is not available for this question yet.

Report a correction for Q176

Question 177 NAT · 2.0 marks

Source diagram or notation
What is the 3 step value function for state 5, computed in synchronous manner, following equiprobable random policy?

A published solution is not available for this question yet.

Report a correction for Q177

Question 178 NAT · 2.0 marks

Source diagram or notation
What is the first-visit estimator of the value of the nonterminal state?

A published solution is not available for this question yet.

Report a correction for Q178

Question 179 NAT · 2.0 marks

Source diagram or notation
What is the every-visit estimator of the value of the nonterminal state?

A published solution is not available for this question yet.

Report a correction for Q179