uiz Space

January 2025 term · Reinforcement Learning · BSDA5007

Reinforcement Learning Quiz 1: 23 February 2025 (January 2025 term)

The IIT Madras BS Reinforcement Learning (Reinforcement Learning) Quiz 1 paper sat on 23 Feb 2025, in the January 2025 term: 20 questions for 50 marks in 120 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions
20
Marks
50
Duration
120 min
MCQ
10
MSQ
3
Numerical
7
Take as mock testPractise with answers

Updated

Official paper: IIT M DEGREE AN EXAM QDB2 23 Feb 2025 · No negative marking.

Question 1

+2 marksOne correct option

Consider following assertion reason pair:
Assertion: Reinforcement learning is a type of unsupervised learning algorithm as both don’t have correct labels.
Reason: In unsupervised learning, a reward like quantity is not maximized.
Choose the correct option.

  1. A

    Assertion and Reason are both true and Reason is a correct explanation of Assertion.

  2. B

    Assertion and Reason are both true and Reason is not a correct explanation of Assertion.

  3. C

    Assertion is true but Reason is false.

  4. D

    Assertion is false but Reason is true.

Show answer

Correct answer

  • D

    Assertion is false but Reason is true.

Question 1 on its own page

Question 2

+2 marksOne correct option
  1. A

    1, 2, 3

  2. B

    only 3

  3. C

    only 1

  4. D

    1, 2

  5. E

    1, 3

Show answer

Correct answer

  • E

    1, 3

Question 2 on its own page

Question 3

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • B
Question 3 on its own page

Question 4

+2 marksOne correct option

For any given Finite MDP, are all of its optimal policies necessarily deterministic?

  1. A

    TRUE

  2. B

    FALSE

Show answer

Correct answer

  • B

    FALSE

Question 4 on its own page

Question 5

+2 marksOne correct option

Does changing the order of updates (over the entire set of states in each iteration) impact the convergence of Asynchronous Value Iteration?

  1. A

    Yes

  2. B

    No

  3. C

    It depends

Show answer

Correct answer

  • B

    No

Question 5 on its own page

Question 6

+3 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A
Question 6 on its own page

Question 7

+3 marksOne correct option
  1. A

    Arm 1

  2. B

    Arm 2

  3. C

    Arm 3

  4. D

    Arm 4

Show answer

Correct answer

  • B

    Arm 2

Question 7 on its own page

Question 8

+2 marksOne or more correct options

Select the correct options:

Select all that apply.

  1. A

    First-Visit MC is unbiased

  2. B

    Every-Visit MC is unbiased

  3. C

    First-Visit MC is more sample-efficient compared to Every-Visit MC

  4. D

    Every-Visit MC is more sample-efficient compared to First-Visit MC

Show answer

Correct answers

  • A

    First-Visit MC is unbiased

  • D

    Every-Visit MC is more sample-efficient compared to First-Visit MC

Question 8 on its own page

Question 9

+2 marksOne or more correct options

Which of the following methods use bootstrapping?

Select all that apply.

  1. A

    TD

  2. B

    MC

  3. C

    DP

Show answer

Correct answers

  • A

    TD

  • C

    DP

Question 9 on its own page

Question 10

+2 marksOne or more correct options

Which of the following methods use sampling?

Select all that apply.

  1. A

    TD

  2. B

    MC

  3. C

    DP

Show answer

Correct answers

  • A

    TD

  • B

    MC

Question 10 on its own page

Question 11

+4 marksNumerical answer
Show answer

Correct answer: 50 (accepted within ±0.5)

Question 11 on its own page

Question 12

+3 marksNumerical answer
Show answer

Correct answer: 0.5

Question 12 on its own page

Question 13

+2 marksOne correct option

Based on the above data, answer the given subquestions.

Assume M = 10000, then after the 10000 pull:

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A
Question 13 on its own page

Question 14

+2 marksOne correct option

Based on the above data, answer the given subquestions.

Assume M = 10, then after the 10000 pull:

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A
Question 14 on its own page

Question 15

+2 marksOne correct option

Based on the above data, answer the given subquestions.

Does there exist a stochastic (i.e. not deterministic) policy that is optimal?

  1. A

    TRUE

  2. B

    FALSE

Show answer

Correct answer

  • B

    FALSE

Question 15 on its own page

Question 16

+3 marksNumerical answer

Based on the above data, answer the given subquestions.

Show answer

Correct answer: -1.9 (accepted within ±0.05)

Question 16 on its own page

Question 17

+3 marksNumerical answer
Show answer

Correct answer: -1.1 (accepted within ±0.05)

Question 17 on its own page

Question 18

+3 marksNumerical answer
Show answer

Correct answer: -2.18 (accepted within ±0.05)

Question 18 on its own page

Question 19

+3 marksNumerical answer

Based on the above data, answer the given subquestions.

Show answer

Correct answer: 6.66 (accepted within ±0.05)

Question 19 on its own page

Question 20

+3 marksNumerical answer

Based on the above data, answer the given subquestions.

Show answer

Correct answer: 12.25 (accepted within ±0.05)

Question 20 on its own page