Generic identification of binary-valued hidden Markov processes
The generic identification problem is to decide whether a stochastic process $(X_t)$ is a hidden Markov process and if yes to infer its parameters for all but a subset of parametrizations that form a lower-dimensional subvariety in parameter space. Partial answers so far available depend on extra assumptions on the processes, which are usually centered around stationarity. Here we present a general solution for binary-valued hidden Markov processes. Our approach is rooted in algebraic statistics hence it is geometric in nature. We find that the algebraic varieties associated with the probability distributions of binary-valued hidden Markov processes are zero sets of determinantal equations which draws a connection to well-studied objects from algebra. As a consequence, our solution allows for algorithmic implementation based on elementary (linear) algebraic routines.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning the Influence Graph of a High-Dimensional Markov Process with Memory
Motivated by multiple applications in social networks, nervous systems, and financial risk analysis, we consider the problem of learning the underlying (directed) influence graph or causal graph of a high-dimensional mul…
Signal automata and hidden Markov models
A generic method for inferring a dynamical hidden Markov model from a time series is proposed. Under reasonable hypothesis, the model is updated in constant time whenever a new measurement arrives.
Time SeriesTime Series AnalysisThe Infinite Factorial Hidden Markov Model
We introduces a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP to allow temporal dependencies in the h…
blind source separationmodelDistributed System Identification for Linear Stochastic Systems with Binary Sensors
The problem of distributed identification of linear stochastic system with unknown coefficients over time-varying networks is considered. For estimating the unknown coefficients, each agent in the network can only access…
Distributed OptimizationDiscriminative training for Convolved Multiple-Output Gaussian processes
Multi-output Gaussian processes (MOGP) are probability distributions over vector-valued functions, and have been previously used for multi-output regression and for multi-class classification. A less explored facet of th…
Activity RecognitionEmotion RecognitionFace RecognitionGaussian Processes+2