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
Amazon.co.jp: 組合せ最適化とアルゴリズム (インターネット時代の数学シリーズ 8): 幹雄,久保 (著), 隼人,戸川 (編集), 厚吉,杉原 (編集), 正之,中嶋 (編集), 隆志,野寺 (編集): 本
