SELECT Lab::Tutorial at ICML 2008: Beyond Convexity - Submodularity in Machine LearningBeyond Convexity: Submodularity in Machine Learning Description 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 st
plda - Google Code
