arXiv · 0710.5900
Exponential inequalities for empirical unbounded context trees
Abstract
In this paper we obtain non-uniform exponential upper bounds for the rate of convergence of a version of the algorithm Context, when the underlying tree is not necessarily bounded. The algorithm Context is a well-known tool to estimate the context tree of a Variable Length Markov Chain. As a consequence of the exponential bounds we obtain a strong consistency result. We generalize in this way several previous results in the field.
Explore related subjects
Keep this discovery
Antonio Galves, Florencia Leonardi. 2008-05-22. Exponential inequalities for empirical unbounded context trees. https://arxiv.org/abs/0710.5900
Cite the original work for its findings. Save a collection to share your selection of sources.