Question 2
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.
Both Assertion and Reason are true, and Reason is the correct explanation of Assertion.
Both Assertion and Reason are true, but Reason is NOT the correct explanation of Assertion.
Assertion is true, Reason is false
Assertion is false, Reason is false
Question 3
Policy Iteration
Value Iteration
Both require equal updates
It cannot be determined
13 more questions in this paper
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
More on the Reinforcement Learning Quiz 1 26 Oct 2025 paper
The IIT Madras BS Reinforcement Learning (Reinforcement Learning) Quiz 1 paper sat on 26 Oct 2025, in the September 2025 term: 16 questions for 50 marks in 120 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | Reinforcement Learning Quiz 1 26 Oct 2025 at a glance |
|---|---|
| Term | September 2025 term |
| Subject | Reinforcement Learning |
| Course code | BSDA5007 |
| Questions | 16 |
| Marks | 50 |
| Duration | 120 min |
| MCQ | 11 |
| MSQ | 2 |
| Numerical | 3 |
| Official paper | IIT M DEGREE AN EXAM QDB2 26 Oct 2025 |
| Negative marking | No negative marking. |
| Updated |