0


结构预测的有效判别训练方法

Efficient Discriminative Training Method for Structured Predictions
课程网址: http://videolectures.net/mlg08_yu_edtm/  
主讲教师: Huizhen Yu
开课单位: 阿尔伯塔大学
开课时间: 2008-08-25
课程语种: 英语
中文简介:
我们提出了一种在监督学习下生成模型的有效判别训练方法。在我们的设置中,完全观察到的实例作为训练样例,以及预测感兴趣的变量的规范。我们将训练表示为凸规划问题,将SVM类型的大边际约束结合到有利于参数的情况下,在这些参数下,以其余为条件的预测变量的最大后验(MAP)估计接近于它们给出的真实值。训练实例。然而,由此产生的优化问题比其二次规划(QP)对应物更复杂由于存在,由条件模型的SVM类型训练产生对参数的非线性约束。我们提出了一种有效的优化方法,它结合了几种技术,即双变量的数据相关的重新参数化,受限的单纯分解和近端点算法。我们的方法扩展了解决上述QP对应物的方法,一些作者早先提出过。
课程简介: We propose an efficient discriminative training method for generative models under supervised learning. In our setting, fully observed instances are given as training examples, together with a specification of variables of interest for prediction. We formulate the training as a convex programming problem, incorporating the SVM-type large margin constraints to favor parameters under which the maximum a posteriori (MAP) estimates of the prediction variables, conditioned on the rest, are close to their true values given in the training instances. The resulting optimization problem is, however, more complex than its quadratic programming (QP) counterpart resulting from the SVM-type training of conditional models, because of the presence of non-linear constraints on the parameters. We present an efficient optimization method, which combines several techniques, namely, a data-dependent reparametrization of dual variables, restricted simplicial decomposition, and the proximal point algorithm. Our method extends the one for solving the aforementioned QP counterpart, proposed earlier by some of the authors.
关 键 词: 凸规划问题; 二次规划; 近端点算法
课程来源: 视频讲座网
最后编审: 2019-07-02:cjy
阅读次数: 53