This document discusses linear classification and the optimal hyperplane. The optimal hyperplane is found by minimizing WTW subject to constraints involving the weights W, data points X, labels y, and bias b. The Lagrangian is used to solve this constrained optimization problem to find the optimal hyperplane.
This document discusses linear classification and the optimal hyperplane. The optimal hyperplane is found by minimizing WTW subject to constraints involving the weights W, data points X, labels y, and bias b. The Lagrangian is used to solve this constrained optimization problem to find the optimal hyperplane.
This document discusses linear classification and the optimal hyperplane. The optimal hyperplane is found by minimizing WTW subject to constraints involving the weights W, data points X, labels y, and bias b. The Lagrangian is used to solve this constrained optimization problem to find the optimal hyperplane.
) ● The optimal hyperplane is a solution of the following constrained optimization problem Minimize WTW Subject to 1-yi(WTXi+b)<=0 ,i=1,...,n ● The Lagrangian is given by