Archive for the ‘Combinatorial Optimization’ Category

submodularity.org Tutorials, References, Activities and Tools for Submodular Optimization

September 26, 2012

submodularity.org Tutorials, References, Activities and Tools for Submodular Optimization

This page collects some material and references related to submodular optimization, with applications in particular in machine learning and AI. Convex optimization has become a main workhorse for many machine learning algorithms during the past ten years. When minimizing a convex loss function for, e.g., training a Support Vector Machine, we can rest assured to efficiently find an optimal solution, even for large problems. In recent years, another fundamental problem structure, which has similar beneficial properties, has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns property, stating that adding an element to a smaller set helps more than adding it to a larger set. Similarly to convexity, submodularity allows one to efficiently find provably (near-)optimal solutions.


Nguyen Trung Tuan

Lecture Notes in Mathematics, High School Olympiads

MOOCtalk

Let's teach the world

The Proof is in the Pudding

The proof of the pudding is in the eating.

Windows On Theory

A Research Blog