Compressed Inference for Probabilistic Sequential Models

Details Compressed Inference for Probabilistic Sequential Models Compressed Inference for Probabilistic Sequential Models

2012-02-14

arxiv.org/abs/1202.3759v1

Computer Science

Artificial Intelligence

Scientific paper

Hidden Markov models (HMMs) and conditional random fields (CRFs) are two popular techniques for modeling sequential data. Inference algorithms designed over CRFs and HMMs allow estimation of the state sequence given the observations. In several applications, estimation of the state sequence is not the end goal; instead the goal is to compute some function of it. In such scenarios, estimating the state sequence by conventional inference techniques, followed by computing the functional mapping from the estimate is not necessarily optimal. A more formal approach is to directly infer the final outcome from the observations. In particular, we consider the specific instantiation of the problem where the goal is to find the state trajectories without exact transition points and derive a novel polynomial time inference algorithm that outperforms vanilla inference techniques. We show that this particular problem arises commonly in many disparate applications and present experiments on three of them: (1) Toy robot tracking; (2) Single stroke character recognition; (3) Handwritten word recognition.

Affiliated with

Also associated with

No associations

Rating

Compressed Inference for Probabilistic Sequential Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compressed Inference for Probabilistic Sequential Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed Inference for Probabilistic Sequential Models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90667