SPSA vs Simplex in statistical machine translation optimization

Most statistical machine translation systems are combinations of various models and tuning scaling factors is an important step. However, this optimisation problem is hard because the objective function has many local minima and the available algorithms cannot achieve a global optimum. Consequently, optimisations starting from different initial settings can converge to fairly different solutions. We present tuning experiments with the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm, and compare them with the widely used downhill simplex method. With IWSLT 2005 Chinese-English data, both methods showed similar performance, but SPSA was more robust to the choice of initial settings. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)