Concept

Hyperplane separation theorem

Related lectures (31)

Covers the basics of Support Vector Machines, focusing on hard-margin and soft-margin formulations.

Farkas' Lemma: Applications in Game Theory

Explores Farkas' Lemma, hyperplane separation, combinatorics, and its application in game theory, focusing on penalty kick strategies.

Convex Optimization: Convex Functions

Covers the concept of convex functions and their applications in optimization problems.

Convex Optimization: Conjugate Duality

Explores envelope representations, subgradients, conjugate functions, duality gap, and strong duality in convex optimization.

Conjugate Duality: Envelope Representations and Subgradients

Explores envelope representations, subgradients, and the duality gap in convex optimization.

Convex Optimization

Covers an overview of convex optimization, affine sets, polyhedra, ellipsoids, and convex functions.

Differential and Tangent Plan

Explores differentiable functions, gradients, and tangent planes in two-variable functions.

Supporting hyperplanes

Covers supporting hyperplanes for approximating functions' graphs in different dimensions using hyperplanes and linear approximations.

Separation Theorem: Convex Sets

Explores the Second Separation Theorem for closed convex sets and the concept of supporting hyperplanes.

Support Vector Machine: Primal Formulation with Hard Margin

Covers the Support Vector Machine with a hard margin formulation and the importance of maximizing the margin between classes.

Supporting Hyperplanes

Explores supporting hyperplanes for approximating function graphs in higher dimensions through normal vectors and linear approximations.

Implicit Function Theorem

Explores the Implicit Function Theorem, supporting hyperplanes, local extrema, and higher-order derivatives, concluding with the classification of stationary points.

Support Vector Machines: Linear Separability

Explores linear separability in support vector machines, focusing on hyperplane separation and margin optimization.

Linear Models: Recap and Logistic Regression

Covers linear models, binary classification, logistic regression, and model evaluation metrics.

Minkowski-Weyl: Convexity and Separation Theorem

Explores convex sets, Minkowski-Weyl theorem, and Separation theorem in convex analysis.

Kernel Methods: Efficient Dot Product Computation

Demonstrates efficient dot product computation and introduces nonlinear boundaries in the original space.

Binary Classification

Explains how to find the best hyperplane to separate two classes.

Support Vector Machine and Logistic Regression

Explains support vector machine and logistic regression for classification tasks, emphasizing margin maximization and risk minimization.

Linear Models: Continued

Explores linear models, logistic regression, gradient descent, and multi-class logistic regression with practical applications and examples.