Name
Abstract | ||
|---|---|---|
We propose a novel Bayesian nonparametric approach to learning with probabilistic deterministic finite automata (PDFA). We define and develop and sampler for a PDFA with an infinite number of states which we call the probabilistic deterministic infinite automata (PDIA). Posterior predictive inference in this model, given a finite training sequence, can be interpreted as averaging over multiple PDFAs of varying structure, where each PDFA is biased towards having few states. We suggest that our method for averaging over PDFAs is a novel approach to predictive distribution smoothing. We test PDIA inference both on PDFA structure learning and on both natural language and DNA data prediction tasks. The results suggest that the PDIA presents an attractive compromise between the computational cost of hidden Markov models and the storage requirements of hierarchically smoothed Markov models. |
Year | Venue | Field |
|---|---|---|
2010 | NIPS | Inference,Markov model,Deterministic finite automaton,Computer science,Automaton,Smoothing,Predictive inference,Artificial intelligence,Probabilistic logic,Hidden Markov model,Machine learning |
DocType | Citations | PageRank |
Conference | 8 | 0.48 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pfau, David | 1 | 80 | 6.76 |
| Nicholas Bartlett | 2 | 54 | 3.07 |
| Wood, Frank | 3 | 46 | 2.16 |