NPTEL Reinforcement Learning Week 1 Assignment Answers 2024

Join Our WhatsApp Group Join Now
Join Us On Telegram Join Now

NPTEL Reinforcement Learning Week 1 Assignment Answers 2024

1. Which of the following is not a useful way to approach a standard multi-armed bandit problem with n arms? Assume bandits are stationary.

  • “How can I ensure the best action is the one which is mostly selected as time tends to infinity?”
  • “How can I ensure the total regret as time tends to infinity is minimal?”
  • “How can I ensure an arm which has an expected reward within a certain threshold of the optimal arm is chosen with a probability above a certain threshold?”
  • “How can I ensure that when given any 2 arms, I can select the arm with a higher expected return with a probability above a certain threshold?”
Answer :- For Answer Click Here

2. What is the decay rate of the weightage given to past rewards in the computation of the Q function in the stationary and non-stationary updates in the multi-armed bandit problem?

  • hyperbolic, linear
  • linear, hyperbolic
  • hyperbolic, exponential
  • exponential, linear
Answer :- For Answer Click Here

3. In the update rule Qt+1(a)←Qt(a)+α(Rt−Qt(a)), select the value of α ,that we would prefer to estimate Q values in a non-stationary bandit problem.

NPTEL Reinforcement Learning Week 1 Assignment Answers 2024
Answer :- For Answer Click Here

4. 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.

  • Assertion and Reason are both true and Reason is a correct explanation of Assertion
  • Assertion and Reason are both true and Reason is not a correct explanation of Assertion
  • Assertion is true and Reason is false
  • Both Assertion and Reason are false
Answer :- 

5. We are trying different algorithms to find the optimal arm for a multi arm bandit. We plot expected payoff vs time graph for each algorithm for which the expected payoff satisfy some function with respect to time (staring from 0). Which among the following functions will have the least regret. (We know that the optimal expected pay off is 1) (Hint: Plot the functions)

  • tanh(t)
  • 1−2−t
  • x/20 if x<20 and 1 after that
  • Same regret for all the above functions
Answer :- 

6. Consider the following statements for ϵ-greedy approach in a non-stationary environment:
i Keeping a small constant ϵ is a good approach if the environment is non-stationary..
ii Large values of ϵ will lead to unnecessary exploration in the long run.
iii For a stationary environment, decaying ϵ value to zero is a good approach, as after reaching optimality, we would like to reduce exploration.
Which of the above statements is/are correct?

  • ii, iii
  • only iii
  • only ii
  • i, ii
Answer :- For Answer Click Here
NPTEL Reinforcement Learning Week 1 Assignment Answers 2024
  • Both are good as both formulas can bound probability in range 0 to 1.
  • (i) is better because it is differentiable and requires less complex computation.
  • None of the above.
Answer :- 

8. Which of the following best refers to PAC -optimality solution to bandit problems?
ϵ – is the difference between the reward of the chosen arm and true optimal reward
δ – is the probability that chosen arm is not optimal
N – is the number of steps to reach PAC-optimality

  • Given δ and ϵ, minimize the number of steps to reach PAC-optimality(i.e. N)
  • Given δ and N, minimize ϵ.
  • Given ϵ and N, maximize the probability of choosing optimal arm(i.e. minimize δ)
  • none of the above is true about PAC -optimality
Answer :- 

9. Suppose we have a 10-armed bandit problem where the rewards for each of the 10 arms is deterministic and in the range (0, 10). Which among the following methods will allow us to accumulate maximum reward in the long term?

  • ϵ-greedy with ϵ = 0.1.
  • ϵ-greedy with ϵ = 0.01.
  • greedy with initial reward estimates set to 0.
  • greedy with initial reward estimates set to 10.
Answer :- 

10. Which of the following is/are correct and valid reasons to consider sampling actions from a softmax distribution instead of using an ϵ-greedy approach?

i. Softmax exploration makes the probability of picking an action proportional to the actionvalue estimates. By doing so, it avoids wasting time exploring obviously ’bad’ actions.
ii. We do not need to worry about decaying exploration slowly like we do in the ϵ-greedy case. Softmax exploration gives us asymptotic correctness even for a sharp decrease in temperature.
iii. It helps us differentiate between actions with action-value estimates (Q values) that are very close to the action with maximum Q value.

Which of the above statements is/are correct?

  • i, ii, iii
  • only iii
  • only i
  • i, ii
  • i, iii
Answer :-  For Answer Click Here