Conditional random field

Description

Lafferty, McCallum and Pereira define a CRF on observations X and random variables Y as follows:

Let G = ( V , E ) be a graph such that

Y = ( Y v ) v ∈ V , so that Y is indexed by the vertices of G . Then ( X , Y ) is a conditional random field when the random variables Y v , conditioned on X , obey the Markov property with respect to the graph: p ( Y v | X , Y w , w ≠ v ) = p ( Y v | X , Y w , w ∼ v ) , where w ∼ v means that w and v are neighbors in G .

What this means is that a CRF is an undirected graphical model whose nodes can be divided into exactly two disjoint sets X and Y , the observed and output variables, respectively; the conditional distribution p ( Y | X ) is then modeled.

Inference

For general graphs, the problem of exact inference in CRFs is intractable. The inference problem for a CRF is basically the same as for an MRF and the same arguments hold. However, there exist special cases for which exact inference is feasible:

If exact inference is impossible, several algorithms can be used to obtain approximate solutions. These include:

Parameter Learning

Learning the parameters θ is usually done by maximum likelihood learning for p ( Y i | X i ; θ ) . If all nodes have exponential family distributions and all nodes are observed during training, this optimization is convex. It can be solved for example using gradient descent algorithms, or Quasi-Newton methods such as the L-BFGS algorithm. On the other hand, if some variables are unobserved, the inference problem has to be solved for these variables. Exact inference is intractable in general graphs, so approximations have to be used.

Examples

In sequence modeling, the graph of interest is usually a chain graph. An input sequence of observed variables X represents a sequence of observations and Y represents a hidden (or unknown) state variable that needs to be inferred given the observations. The Y i are structured to form a chain, with an edge between each Y i − 1 and Y i . As well as having a simple interpretation of the Y i as "labels" for each element in the input sequence, this layout admits efficient algorithms for:

The conditional dependency of each Y i on X is defined through a fixed set of feature functions of the form f ( i , Y i − 1 , Y i , X ) , which can informally be thought of as measurements on the input sequence that partially determine the likelihood of each possible value for Y i . The model assigns each feature a numerical weight and combines them to determine the probability of a certain value for Y i .

Linear-chain CRFs have many of the same applications as conceptually simpler hidden Markov models (HMMs), but relax certain assumptions about the input and output sequence distributions. An HMM can loosely be understood as a CRF with very specific feature functions that use constant probabilities to model state transitions and emissions. Conversely, a CRF can loosely be understood as a generalization of an HMM that makes the constant transition probabilities into arbitrary functions that vary across the positions in the sequence of hidden states, depending on the input sequence.

Notably in contrast to HMMs, CRFs can contain any number of feature functions, the feature functions can inspect the entire input sequence X at any point during inference, and the range of the feature functions need not have a probabilistic interpretation.

Higher-order CRFs and semi-Markov CRFs

CRFs can be extended into higher order models by making each Y i dependent on a fixed number o of previous variables Y i − o , . . . , Y i − 1 . Training and inference are only practical for small values of o (such as o ≤ 5), since their computational cost increases exponentially with o . Large-margin models for structured prediction, such as the structured Support Vector Machine can be seen as an alternative training procedure to CRFs.

There exists another generalization of CRFs, the semi-Markov conditional random field (semi-CRF), which models variable-length segmentations of the label sequence Y . This provides much of the power of higher-order CRFs to model long-range dependencies of the Y i , at a reasonable computational cost.

Latent-dynamic conditional random field

Latent-dynamic conditional random fields (LDCRF) or discriminative probabilistic latent variable models (DPLVM) are a type of CRFs for sequence tagging tasks. They are latent variable models that are trained discriminatively.

In an LDCRF, like in any sequence tagging task, given a sequence of observations x = x 1 , … , x n , the main problem the model must solve is how to assign a sequence of labels y = y 1 , … , y n from one finite set of labels Y. Instead of directly modeling P(y|x) as an ordinary linear-chain CRF would do, a set of latent variables h is "inserted" between x and y using the chain rule of probability:

This allows capturing latent structure between the observations and labels. While LDCRFs can be trained using quasi-Newton methods, a specialized version of the perceptron algorithm called the latent-variable perceptron has been developed for them as well, based on Collins' structured perceptron algorithm. These models find applications in computer vision, specifically gesture recognition from video streams and shallow parsing.

Software

This is a partial list of software that implement generic CRF tools.

This is a partial list of software that implement CRF related tools.