A Family of Latent Variable Convex Relaxations for IBM Model 2
By: Andrei Simion
Publisher: [publisher not identified]
Published: 2015
Place of publication: [New York, N.Y.?]
Language: eng
Description: Introduced in 1993, the IBM translation models were the first generation Statistical Machine Translation systems. For the IBM Models, only IBM Model 1 is a convex optimization problem, meaning that we can initialize all its probabilistic parameters to uniform values and subsequently converge to a good solution via Expectation Maximization (EM). In this thesis we discuss a mechanism to generate an infinite supply of nontrivial convex relaxations for IBM Model 2 and detail an Exponentiated Subgradient algorithm to solve them. We also detail some interesting relaxations that admit and easy EM algorithm that does not require the tuning of a learning rate. Based on the geometric mean of two variables, this last set of convex models can be seamlessly integrated into the open-source GIZA++ word-alignment library. Finally, we also show other applications of the method, including a more powerful strictly convex IBM Model 1, and a convex HMM surrogate that improves on the performance of the previous convex IBM Model 2 variants.
Notes: Department: Industrial Engineering and Operations Research.

Thesis advisor: Michael Collins.

Thesis advisor: Cliff Stein.

Thesis (Ph.D.)--Columbia University, 2015.