Bregman Divergences are incredibly powerful tools for deriving and analyzing many machine learning algorithms. This blog shows how they are derived and how you can find new ones.
In this post we take the first steps in the field of Online Learning, framed as a game between the learner and an evil adversary. We look at some simple algorithms and analyze them.
Spectral Clustering is a powerful clustering method which avoids the pitfalls of simpler methods such as K-means. It uses some beautiful graph theory, let's go!