The Statistical Geometry of Latent Recovery in Hidden Markov Models
math.ST, stat.ML, stat.TH
Submitted: 2026-10-31
Updated: 2026-10-31
Comments: Trang Pham and Dung Le contributed equally to this work
License: http://creativecommons.org/licenses/by/4.0/
The gist: Hidden Markov models (HMMs) offer an important capability to interpret fitted latent states and transitions.
Abstract
Hidden Markov models (HMMs) offer an important capability to interpret fitted latent states and transitions. When emission distributions nearly coincide, a small observation-density error does not ensure accurate estimation of the latent quantities needed for interpretation. This motivates us to characterize convergence rates for latent recovery that account for emission separation. Our main contribution lies in deriving deterministic inverse inequalities that convert Hellinger error between fitted and true densities into bounds on latent recovery errors. We develop these bounds for multivariate Gaussian HMMs with a common, known emission covariance matrix and combine them with a Hellinger estimation guarantee for the global maximum likelihood estimator to obtain latent recovery rates. Although the joint observation distribution is a Gaussian mixture with exponentially many path components, they share the same emission centers across time. Leveraging this shared structure, we show that the separation exponents are governed by the maximum number of simultaneously approaching centers rather than the number of path components. Under exact specification, the global bounds on state-sequence probability discrepancies and the 1-Wasserstein loss for latent location distributions exhibit sharp separation exponents that do not increase with the number of selected times. Moreover, sufficiently small observation-density error guarantees unique matching between fitted and true emission centers, which yields error bounds for individual emission centers and transition rows. Under over-specification, individual split-state transition rows are not necessarily identifiable, so we quantify aggregate latent recovery errors and show that state-sequence probability bounds incur larger separation exponents compared to exact specification. We conduct synthetic experiments to validate our theoretical results.
Sources
- Convergence Rates for Latent Mixing Measures in Infinite Homoscedastic Location-Scale Mixture Models
- Partial Differential Equation Barriers to Identifiability in Infinite Mixture Models
- Characterizing Heterogeneous Rates in Finite Mixture Estimation via Partial Optimal Transport
- On the Geometry of Separation in Finite Gaussian Mixtures
Related papers
- Sigmoid-FTRL: Design-Based Adaptive Neyman Allocation for AIPW Estimators
- Nonparametric Regression on Fixed-Cardinality Subsets:Minimax Risk and Random-Design Effects
- Conformal Prediction for Dyadic Regression Under Complex Missingness
- Optimal Linear Functional Estimation for Proportionally High-Dimensional Linear Models
- Semiparametric Efficient Inference under Non-Informative Complex Survey Designs
- Sharp Asymptotic Theory of Maximum Likelihood Estimation for Gaussian Processes with an RBF Kernel