图 书 馆
在线批量强凸多核学习Online-Batch Strongly Convex Multi Kernel Learning |
|
| 课程网址: | http://videolectures.net/cvpr2010_orabona_obsc/ |
| 主讲教师: | Francesco Orabona |
| 开课单位: | 芝加哥丰田技术学院 |
| 开课时间: | 2010-07-19 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart performance. A general drawback of these strategies is the high computational cost during training, that prevents their application to large-scale problems. They also do not provide theoretical guarantees on their convergence rate. Here we present a Multiclass Multi Kernel Learning (MKL) algorithm that obtains state-of-the-art performance in a considerably lower training time. We generalize the standardMKL formulation to introduce a parameter that allows us to decide the level of sparsity of the solution. Thanks to this new setting, we can directly solve the problem in the primal formulation. We prove theoretically and experimentally that 1) our algorithm has a faster convergence rate as the number of kernels grow; 2) the training complexity is linear in the number of training examples; 3) very few iterations are enough to reach good solutions. Experiments on three standard benchmark databases support our claims. |
| 关 键 词: | 计算机科学; 计算机视觉; 稀疏和凸优化 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-03：毛岱琦(课程编辑志愿者) |
| 阅读次数: | 53 |