Skip to content
optimization
4 articles · All tags
- What Is a Support Vector Machine and How Does It Work?
A support vector machine separates two classes with the widest possible margin, and only the training points closest to that boundary decide where it falls. - The Traveling Salesman Problem: Why the Shortest Route Is Hard
The traveling salesman problem asks for the shortest route that visits every city once and returns to the start, simple to state but very hard to solve. - Dynamic Programming
An optimization technique that solves problems by combining solutions to overlapping subproblems and storing intermediate results to avoid recomputation. - Gradient Descent
The iterative optimization algorithm at the heart of training machine learning models: how it works, its variants, and its pitfalls.