REVIEW 1 cited by
Learning nonsingular phylogenies and hidden Markov models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In this paper we study the problem of learning phylogenies and hidden Markov models. We call a Markov model nonsingular if all transition matrices have determinants bounded away from 0 (and 1). We highlight the role of the nonsingularity condition for the learning problem. Learning hidden Markov models without the nonsingularity condition is at least as hard as learning parity with noise, a well-known learning problem conjectured to be computationally hard. On the other hand, we give a polynomial-time algorithm for learning nonsingular phylogenies and hidden Markov models.
Forward citations
Cited by 1 Pith paper
-
LLM-Guided Probabilistic Program Induction for POMDP Model Estimation
LLM-guided probabilistic program induction can learn low-complexity POMDP models from ten demonstrations and outperform tabular learning, behavior cloning, and direct LLM planning in simulated and real robot domains.
Discussion (0). Continue with ORCID to comment.