Quiz Space

Reinforcement Learning · Quiz 1 · 26 Oct 2025 · September 2025 term

Question 2: Consider following assertion reason pair:\ Assertion:\ In…

Question 2

+3 marksOne correct option

Consider following assertion reason pair:
Assertion:
In the UCB algorithm for multi-armed bandits, replacing the upper confidence bound with a lower confidence bound (and greedily selecting actions based on that lower bound)
would still promote effective exploration or lead to optimal reward maximisation.
Reason:
Even when lower confidence bounds are used instead of upper bounds, if the algorithm greedily selects arms based on these lower bounds, it would still encourage exploration and ultimately achieve optimal reward maximisation.

  1. A

    Both Assertion and Reason are true, and Reason is the correct explanation of Assertion.

  2. B

    Both Assertion and Reason are true, but Reason is NOT the correct explanation of Assertion.

  3. C

    Assertion is true, Reason is false

  4. D

    Assertion is false, Reason is false

Show answer

Correct answer

  • D

    Assertion is false, Reason is false

See the whole paperTake it as a mock test

Question 2 of 16 in the IIT Madras BS Reinforcement Learning (Reinforcement Learning) Quiz 1 paper sat on 26 Oct 2025, in the September 2025 term (IIT M DEGREE AN EXAM QDB2 26 Oct 2025). It carries 3 marks.

More questions from this paper

  1. Q1Figure question
  2. Q3Figure question
  3. Q4Figure question
  4. Q5Which of the following statements correctly describes the differences in computational complexity and convergence behav…
  5. Q6Figure question
  6. Q7Figure question
  7. Q8If you cannot observe which case you face, what is the best expected reward per step you can achieve, and what strategy…
  8. Q9If, at each time step, you are told whether you face case A or case B (but not the true action values), what is the bes…
  9. Q10Which of the following best explains why a contextual bandit approach is preferred over a standard multi-armed bandit i…
  10. Q11Based on the above data, answer the given subquestions.
  11. Q12What is the main optimality goal of a contextual bandit algorithm over many rounds?
  12. Q13What is the total reward if the robot collects both treasures and then exits,taking the shortest possible path and neve…
  13. Q14Based on the above data, answer the given subquestions.
  14. Q15Consider a pole-balancing task where the goal is to apply forces to a cart moving along a track to keep a hinged pole f…
  15. Q16Consider a pole-balancing task where the goal is to apply forces to a cart moving along a track to keep a hinged pole f…