Gradient Computation In Linear-Chain Conditional Random Fields Using The Entropy Message Passing Algorithm

The paper proposes a numerically stable recursive algorithm for the exact computation of the linear-chain conditional random field gradient. It operates as a forward algorithm over the log-domain expectation semiring and has the purpose of enhancing memory efficiency when applied to long observation...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2012-05
Main Authors: Ilic, Velimir M, Mancev, Dejan I, Todorovic, Branimir T, Stankovic, Miomir S
Format: Article
Language:English
Subjects:
Algorithms
Chains
Computation
Conditional random fields
Message passing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper proposes a numerically stable recursive algorithm for the exact computation of the linear-chain conditional random field gradient. It operates as a forward algorithm over the log-domain expectation semiring and has the purpose of enhancing memory efficiency when applied to long observation sequences. Unlike the traditional algorithm based on the forward-backward recursions, the memory complexity of our algorithm does not depend on the sequence length. The experiments on real data show that it can be useful for the problems which deal with long sequences.
ISSN:2331-8422