Suppose we train a hard-margin linear SVM on n > 100 data points in R2, yielding a hyperplane with exactly 2 support vectors. If we add one more data point and retrain the classifier, what is the maximum possible number of support vectors for the new hyperplane (assuming the n + 1 points are linearly separable)?

M

Mr. Dubey • 87.94K Points
Coach

Q. Suppose we train a hard-margin linear SVM on n > 100 data points in R2, yielding a hyperplane with exactly 2 support vectors. If we add one more data point and retrain the classifier, what is the maximum possible number of support vectors for the new hyperplane (assuming the n + 1 points are linearly separable)?

(A) 2

(B) 3

(C) n

(D) n+1

Correct Answer - Option(D)
Views: 297
Filed under category Machine Learning (ML)

Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The need for data replication can arise in various scenarios like

Q. In general, a pilot test is intended to:

Q. Simplify the Boolean expression F = C(B + C)(A + B + C).

Q. Which of these is not true about recursion?

Q. In _______________ the plain-text is processed 1-bit at a time & a series of actions is carried out on it for generating one bit of cipher-text.

Q. task characteristics include?

Q. Which command is used with vi editor to save file and remain in the editing mode?

Q. Managers are typically integrators of

Q. Which of the following methods can be used to solve the longest palindromic subsequence problem?

Q. Which is the major functioning responsibility of the multiplexing combinational circuit?

Question analytics