1.

Computational learning theory analyzes the sample complexity and computational complexity of __________(a) Unsupervised Learning(b) Inductive learning(c) Forced based learning(d) Weak learningI have been asked this question in an internship interview.The question is from Learning in section Learning of Artificial Intelligence

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