Abstract
Hidden Markov models are now used in many fields, for example, speech recognition, natural language processing, etc. However, the mathematical foundation of analysis for the models is not yet constructed, since the HMM is non-identifiable. In recent years, we have developed the algebraic geometrical method that allows us to analyze the non-regular and non-identifiable models. In this paper, we apply this method to the HMM and reveal the asymptotic stochastic complexity in a mathematically rigorous way. Our results show that the Bayesian estimation makes the generalization error small and that the well known BIC is different from the stochastic complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
