Quiz Space

Reinforcement Learning · Quiz 2 · 3 Dec 2023 · September 2023 term

Reinforcement Learning Quiz 2 3 Dec 2023 — Question 12

Question 12

+3 marksOne or more correct options

Select correct statements regarding eligibility traces:

Select all that apply.

  1. A

    It is an approach to implement the T D(λ) algorithm.

  2. B

    The state closest to the terminal state in an episode, has the least value of eligibility trace.

  3. C

    It is initialized as 0 before every trajectory in the TD algorithm.

  4. D

    It is initialized as 0 at the beginning of the TD algorithm.

  5. E

    None of these.

Show answer

Correct answers

  • A

    It is an approach to implement the T D(λ) algorithm.

  • C

    It is initialized as 0 before every trajectory in the TD algorithm.

See the whole paperTake it as a mock test

Question 12 of 21 in the IIT Madras BS Reinforcement Learning (Reinforcement Learning) Quiz 2 paper sat on 3 Dec 2023, in the September 2023 term (IIT M DEGREE AN2 EXAM QDB2 03 Dec 2023). It carries 3 marks.

More questions from this paper

  1. Q1Note: For numerical answer type questions, always enter your answer correct upto two decimal places without rounding up…
  2. Q2What is the estimate of V (B) returned by first-visit MC?\ Note: For numerical answer type questions, always enter your…
  3. Q3What is the estimate of V (A) returned by first-visit MC?\ Note: For numerical answer type questions, always enter your…
  4. Q4What is the estimate of V (B) returned by batch TD(0)?\ Note: For numerical answer type questions, always enter your an…
  5. Q5What is the estimate of V(A) returned by batch TD(0)?\ Note: For numerical answer type questions, always enter your ans…
  6. Q6Figure question
  7. Q7Which of the following is correct update rule for expected SARSA:
  8. Q8Choose the correct option:
  9. Q9Consider the following and select the correct option.\ Assertion: Double Q learning removes or minimizes maximization b…
  10. Q10Identify the correct Q function estimated by Dueling DQN?
  11. Q11What is the advantage of computing n^(th) step reward vs 1-step reward?
  12. Q13What are the Q values for all the actions (i.e. left, up, right, down in that order) in state s1?
  13. Q14What is the TD(0) target (Q-learning) for this transition?\ Note: For numerical answer type questions, always enter you…
  14. Q15Note: For numerical answer type questions, always enter your answer correct upto two decimal places without rounding up…
  15. Q16Training a neural network with TD target, can diverge because:
  16. Q17Suppose we are using a policy gradient method to solve a reinforcement learning problem. Assuming that the policy retur…
  17. Q18What are the advantages of policy search methods over other approaches?
  18. Q19Which of the problems does the replay buffer solve regarding training a Q-network?
  19. Q20Which of the following is the correct way to represent policy for policy search methods? Assume θ represents a real val…
  20. Q21Which of the following is the correct way to represent policy for policy search methods?