Discriminative training via linear programming

  • Authors:
  • K. A. Papineni

  • Affiliations:
  • IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

  • Venue:
  • ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a linear programming approach to discriminative training. We first define a measure of discrimination of an arbitrary conditional probability model on a set of labeled training data. We consider maximizing discrimination on a parametric family of exponential models that arises naturally in the maximum entropy framework. We show that this optimization problem is globally convex in R/sup n/, and is moreover piecewise linear on R/sup n/. We propose a solution that involves solving a series of linear programming problems. We provide a characterization of global optimizers. We compare this framework with those of minimum classification error and maximum entropy.