图 书 馆
线性规划松弛的解稳定性：图分割和无监督学习Solution Stability in Linear Programming Relaxations: Graph Partitioning and Unsupervised Learning |
|
| 课程网址: | http://videolectures.net/icml09_nowozin_ssl/ |
| 主讲教师: | Sebastian Nowozin |
| 开课单位: | 马克斯普朗克研究所 |
| 开课时间: | 2009-08-26 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | We propose a new method to quantify the solution stability of a large class of combinatorial optimization problems arising in machine learning. As practical example we apply the method to correlation clustering, clustering aggregation, modularity clustering, and relative performance signi cance clustering. Our method is extensively motivated by the idea of linear programming relaxations. We prove that when a relaxation is used to solve the original clustering problem, then the solution stability calculated by our method is conservative, that is, it never overestimates the solution stability of the true, unrelaxed problem. We also demonstrate how our method can be used to compute the entire path of optimal solutions as the optimization problem is increasingly perturbed. Experimentally, our method is shown to perform well on a number of benchmark problems. |
| 关 键 词: | 机器学习; 组合优化; 相关聚类 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-04-24：cwx |
| 阅读次数: | 83 |