Active Inference for Binary Symmetric Hidden Markov Models

11/03/2014
by   Armen E. Allahverdyan, et al.
0

We consider active maximum a posteriori (MAP) inference problem for Hidden Markov Models (HMM), where, given an initial MAP estimate of the hidden sequence, we select to label certain states in the sequence to improve the estimation accuracy of the remaining states. We develop an analytical approach to this problem for the case of binary symmetric HMMs, and obtain a closed form solution that relates the expected error reduction to model parameters under the specified active inference scheme. We then use this solution to determine most optimal active inference scheme in terms of error reduction, and examine the relation of those schemes to heuristic principles of uncertainty reduction and solution unicity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2009

On Maximum a Posteriori Estimation of Hidden Markov Processes

We present a theoretical analysis of Maximum a Posteriori (MAP) sequence...
research
09/09/2011

Logical Hidden Markov Models

Logical hidden Markov models (LOHMMs) upgrade traditional hidden Markov ...
research
11/06/2007

Infinite Viterbi alignments in the two state hidden Markov models

Since the early days of digital communication, Hidden Markov Models (HMM...
research
02/17/2021

A Framework for Characterising the Value of Information in Hidden Markov Models

In this paper, a general framework is formalised to characterise the val...
research
03/15/2012

A Delayed Column Generation Strategy for Exact k-Bounded MAP Inference in Markov Logic Networks

The paper introduces k-bounded MAP inference, a parameterization of MAP ...
research
06/03/2021

Attack Prediction using Hidden Markov Model

It is important to predict any adversarial attacks and their types to en...
research
12/08/2016

Prediction with a Short Memory

We consider the problem of predicting the next observation given a seque...

Please sign up or login with your details

Forgot password? Click here to reset