A Stochastic Memoizer for Sequence Data
Description
We propose an unbounded-depth, hierarchical, Bayesian nonparametric model for discrete sequence data. This model can be estimated from a single training sequence, yet shares statistical strength between subsequent
symbol predictive distributions in such
a way that predictive performance generalizes well. The model builds on a specific parameterization of an unbounded-depth hierarchical Pitman-Yor process. We introduce analytic marginalization steps (using coagulation
operators) to reduce this model to one
that can be represented in time and space linear in the length of the training sequence. We show how to perform inference in such a model without truncation approximation and introduce fragmentation operators necessary to do predictive inference. We demonstrate the sequence memoizer by using it as a language model, achieving state-of-the-art results.
| Slides | |
| 0:00 | The Sequence Memoizer |
| 0:29 | Executive Summary - 1 |
| 2:16 | Executive Summary - 2 |
| 3:10 | Statistically Characterizing a Sequence |
| 4:53 | Finite Order Markov Model |
| 6:04 | Learning Discrete Conditional Distributions |
| 6:54 | Bayesian Smoothing |
| 8:16 | A Way To Tie Together Distributions |
| 9:15 | Pitman-Yor Process Continued |
| 9:59 | Hierarchical Bayesian Smoothing |
| 11:29 | SM/HPYP Sharing in Action |
| 12:17 | CRF Particle Filter Posterior Update - 1 |
| 12:36 | CRF Particle Filter Posterior Update - 2 |
| 12:55 | Hierarchical Pitman Yor Process |
| 14:37 | Alternative Sequence Charecterization |
| 15:51 | "Non-Markov" Model |
| 16:24 | Sequence Memoizer |
| 17:25 | Graphical Model Trie - 1 |
| 18:37 | Suffix Trie Datastructure - 1 |
| 19:09 | Suffix Trie Datastructure - 2 |
| 19:23 | Suffix Trie |
| 19:27 | Suffix Trie Datastructure - 3 |
| 19:52 | Suffix Tree Datastructure |
| 19:57 | Graphical Model Identification |
| 20:28 | Marginalization |
| 21:15 | Graphical Model Trie - 2 |
| 21:29 | Graphical Model Tree |
| 21:35 | Graphical Model Initialization |
| 21:43 | Nodes In The Graphical Model |
| 22:06 | Never build more than a 5-gram |
| 23:03 | Sequence Memoizer Bounds N-Gram Performance |
| 23:59 | Language Modelling Results |
| 24:28 | The Sequence Memoizer |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





