1.

Computational learning theory analyzes the sample complexity and computational complexity of __________(a) Unsupervised Learning(b) Inductive learning(c) Forced based learning(d) Weak learning

Answer» The correct choice is (b) Inductive learning

Easy explanation: Computational learning theory analyzes the sample complexity and computational complexity of inductive learning. There is a tradeoff between the expressiveness of the hypothesis language and the ease of learning.


Discussion

No Comment Found

Related InterviewSolutions