2000 character limit reached
Entropy and forecasting complexity of hidden Markov models, matrix product states, and observable operator models
Published 6 Jan 2024 in cond-mat.stat-mech | (2401.03279v1)
Abstract: In a series of three papers, Jurgens and Crutchfield recently proposed a supposedly novel method to compute entropies of hidden Markov models (HMMs), discussed in detail its relationship to iterated function systems, and applied it to compute their ambiguity rates", a concept supposedly introduced by Claude Shannon. We point out that the basic formalism is not new (it is the well knownforward algorithm" for HMMs), and that all three papers have also serious other faults.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.