Question

Computational complexity of classes of learning problems depends on which of the following?
A) The size or complexity of the hypothesis space considered by learner
B) the accuracy to which the target concept must be approximated
C) the probability that the learner will output a successful hypothesis
D) All of the above

Answer 1

D) All of the above as the there are three classes of computational classes - Sample complexity, Computational Complexity and Mistake Bound. The specified reasons takes care of each complexity

Answer 2

Hey there!

Q. Computational complexity of classes of learning problems depends on which of the following?

Answer : Option (d) All the above

Explanation :

Computational complexity of learning depends on the following :

▪The size or expressiveness of the hypothesis space considered by learner.

▪The accuracy to which target concept must be approximated.

▪The probability with which the learner must produce  or will output a successful hypothesis.

▪The manner in which training examples are presented, e.g. by query to an oracle or randomly.