Statistical Machine Learning Part 15 - Convex optimization, Lagrangian, dual problem
Part of the Course "Statistical Machine Learning", Summer Term 2020, Ulrike von Luxburg, University of Tübingen
▶︎
Statistical Machine Learning Part 16 - Support vector machines: hard and soft margin
▶︎
The Karush–Kuhn–Tucker (KKT) Conditions and the Interior Point Method for Convex Optimization
▶︎
Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 1
▶︎
The Lagrangian
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
Statistical Machine Learning Part 18 - Kernels: definitions and examples
▶︎
The World's Most Important Machine
▶︎
16. Learning: Support Vector Machines
▶︎
Statistical Machine Learning Part 1 - Machine learning and inductive bias
▶︎
Machine learning - Introduction to Gaussian processes
▶︎
Kernels - Bernhard Schölkopf - MLSS 2013 Tübingen
▶︎
15. Linear Programming: LP, reductions, Simplex
▶︎
Understanding Lagrange Multipliers Visually
▶︎
Statistical Machine Learning Part 35 - Spectral graph theory
▶︎
9. Lagrangian Duality and Convex Optimization
▶︎
Statistical Machine Learning Part 30 - Isomap
▶︎
Pushing Simulations to the LIMIT to Find Order in Chaos
▶︎
Causality 1 - Bernhard Schölkopf and Dominik Janzing - MLSS 2013 Tübingen
▶︎
Statistical Machine Learning Part 19 - The reproducing kernel Hilbert space
▶︎