Discrete Sequence Prediction and its Applications

Learning from experience to predict sequences of discrete symbols is a fundamental problem in machine learning with many applications. We present a simple and practical algorithm (TDAG) for discrete sequence prediction, verify its performance on data compression tasks, and apply it to problem of dynamically optimizing Prolog programs for good average-case behavior.

Authors

• Philip Laird

Keywords

No keywords are indexed for this paper.