Hyperplane
One word, taught differently in 2 fields. Each use is given apart.
In Engineering
A set of the form {x | } where a is non-zero.
In Mathematics
Defined by a linear equation where a linear combination of variables is greater than or equal to a constant .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Halfspace2Linear discrimination2Separation oracle2Approximate linear separation1Bourgain's slicing problem1Classical Separating Hyperplane theorem1Contact structure1Cutting-plane oracle1Ellipsoid algorithm1Geometric interpretation of duality1Geometric interpretation of matrix rows1Goemans-Williamson random Hyperplane rounding1
In Engineering
1In Mathematics
1Lectures that assume it
22The first 12 are shown.
- Limitations of Perceptrons: What Simple Neural Models Cannot Do
- Learning: Support Vector Machines
- Geometric Problems Continued
- Goemans-Williamson Algorithm: Rounding the Max-Cut SDP
- Lagrange Duality, Dual Decomposition & Generalized Inequalities
- Support Vector Machines
- Convex Optimization II: Stochastic Programming and Cutting-Plane Methods
- Convex Optimization II: Truncated Newton Method and L1-Norm Methods
- Linear-size ℓ₁ Sparsifiers
- Linear Algebra Review: Range, Nullspace & Matrix Factorizations
- Orthonormal Sets of Vectors, Gram-Schmidt & QR Factorization
- Geometric Problems
Connections
32The lectures that define it or assume it, and the concepts next to it.
Concepts8
Show 2 moreShow fewer
Lectures24
- Affine Sets, Convex Sets, Cones & Hyperplanes
- Duality in Linear Programming
- Limitations of Perceptrons: What Simple Neural Models Cannot Do
- Learning: Support Vector Machines
- Geometric Problems Continued
- Goemans-Williamson Algorithm: Rounding the Max-Cut SDP
Show 18 moreShow fewer
- Lagrange Duality, Dual Decomposition & Generalized Inequalities
- Support Vector Machines
- Convex Optimization II: Stochastic Programming and Cutting-Plane Methods
- Convex Optimization II: Truncated Newton Method and L1-Norm Methods
- Linear-size ℓ₁ Sparsifiers
- Linear Algebra Review: Range, Nullspace & Matrix Factorizations
- Orthonormal Sets of Vectors, Gram-Schmidt & QR Factorization
- Geometric Problems
- The unreasonable effectiveness of the convexity assumption in high dimensions
- The Generic Viewpoint Assumption; Object Recognition
- The Mystery of 3-Manifolds
- Linear Programming: Optimization Reduces to Feasibility
- The Ellipsoid Algorithm
- Machine Learning: Perceptrons and Logistic Regression
- A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies
- Red Points and Blue Points
- Guest Lecture: Dorsa Sadigh (UC Berkeley CS 285)
- Latent Variable models and Subset Smoothing