NPTEL Introduction to Machine Learning Week 12 Assignment Answers 2025
1.
Answer :- For Answers Click Here
2. Given 50 hypothesis functions, each trained with 105 samples, what is the lower bound on the probability that there does not exist a hypothesis function with error greater than 0.1?
- 1−100−2⋅103
- 1−100e−103
- 1−50−2⋅103
- 1−50−103
Answer :-
3. The VC dimension of a pair of squares is:
- 3
- 4
- 5
- 6
Answer :-
4. In games like Chess or Ludo, the transition function is known to us. But what about Counter Strike or Mortal Combat or Super Mario? In games where we do not know T, we can only query the game simulator with current state and action, and it returns the next state.
This means we cannot directly argmax or argmin for V(T(S,a)). Therefore, learning the value function V is not sufficient to construct a policy.
Which of these could we do to overcome this? (more than 1 may apply)
Assume there exists a method to do each option. You have to judge whether doing it solves the stated problem.
- Directly learn the policy.
- Learn a different function which stores value for state-action pairs (instead of only state like V does).
- Learn T along with V.
- Run a random agent repeatedly till it wins. Use this as the winning policy.
Answer :-
5.
Answer :-
6. What is V(X1) after one application of given formula?
- -1
- -0.9
- -0.81
- 0
Answer :-
7. What is V(X1) after V converges?
- 0.54
- -0.9
- 0.63
- 0
Answer :-
8.
Answer :- For Answers Click Here
